/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 11:39:54,323 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 11:39:54,325 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 11:39:54,337 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 11:39:54,337 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 11:39:54,338 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 11:39:54,339 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 11:39:54,341 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 11:39:54,343 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 11:39:54,344 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 11:39:54,344 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 11:39:54,345 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 11:39:54,346 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 11:39:54,347 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 11:39:54,348 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 11:39:54,349 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 11:39:54,349 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 11:39:54,350 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 11:39:54,352 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 11:39:54,354 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 11:39:54,355 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 11:39:54,356 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 11:39:54,357 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 11:39:54,358 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 11:39:54,360 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 11:39:54,361 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 11:39:54,361 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 11:39:54,362 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 11:39:54,362 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 11:39:54,363 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 11:39:54,363 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 11:39:54,364 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 11:39:54,365 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 11:39:54,365 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 11:39:54,366 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 11:39:54,366 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 11:39:54,367 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 11:39:54,367 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 11:39:54,367 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 11:39:54,368 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 11:39:54,369 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 11:39:54,370 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 11:39:54,384 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 11:39:54,384 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 11:39:54,385 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 11:39:54,386 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 11:39:54,386 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 11:39:54,386 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 11:39:54,386 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 11:39:54,386 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 11:39:54,387 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 11:39:54,387 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 11:39:54,387 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 11:39:54,387 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 11:39:54,387 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 11:39:54,387 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 11:39:54,388 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:39:54,388 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 11:39:54,388 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 11:39:54,388 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 11:39:54,388 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 11:39:54,389 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 11:39:54,389 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 11:39:54,389 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 11:39:54,389 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 11:39:54,389 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 11:39:54,389 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 11:39:54,390 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 11:39:54,390 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 11:39:54,390 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 11:39:54,390 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 11:39:54,625 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 11:39:54,639 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 11:39:54,643 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 11:39:54,644 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 11:39:54,645 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 11:39:54,645 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 11:39:54,702 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_YrfDDo/tmp/9625839962b64f5399e60d8ff373d828/FLAGcc3122e20 [2020-07-01 11:39:55,052 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 11:39:55,053 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 11:39:55,060 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_YrfDDo/tmp/9625839962b64f5399e60d8ff373d828/FLAGcc3122e20 [2020-07-01 11:39:55,457 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_YrfDDo/tmp/9625839962b64f5399e60d8ff373d828 [2020-07-01 11:39:55,469 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 11:39:55,470 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 11:39:55,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 11:39:55,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 11:39:55,476 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 11:39:55,477 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 11:39:55" (1/1) ... [2020-07-01 11:39:55,481 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@262624e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:39:55, skipping insertion in model container [2020-07-01 11:39:55,481 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 11:39:55" (1/1) ... [2020-07-01 11:39:55,489 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 11:39:55,506 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 11:39:55,744 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 11:39:55,748 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 11:39:55,769 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 11:39:55,791 INFO L208 MainTranslator]: Completed translation [2020-07-01 11:39:55,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:39:55 WrapperNode [2020-07-01 11:39:55,791 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 11:39:55,792 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 11:39:55,792 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 11:39:55,792 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 11:39:55,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:39:55" (1/1) ... [2020-07-01 11:39:55,811 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:39:55" (1/1) ... [2020-07-01 11:39:55,832 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 11:39:55,832 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 11:39:55,832 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 11:39:55,832 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 11:39:55,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:39:55" (1/1) ... [2020-07-01 11:39:55,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:39:55" (1/1) ... [2020-07-01 11:39:55,844 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:39:55" (1/1) ... [2020-07-01 11:39:55,845 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:39:55" (1/1) ... [2020-07-01 11:39:55,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:39:55" (1/1) ... [2020-07-01 11:39:55,854 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:39:55" (1/1) ... [2020-07-01 11:39:55,855 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:39:55" (1/1) ... [2020-07-01 11:39:55,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 11:39:55,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 11:39:55,857 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 11:39:55,857 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 11:39:55,858 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:39:55" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 11:39:55,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 11:39:55,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 11:39:55,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 11:39:55,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 11:39:55,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 11:39:56,120 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 11:39:56,121 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-01 11:39:56,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:39:56 BoogieIcfgContainer [2020-07-01 11:39:56,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 11:39:56,125 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 11:39:56,125 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 11:39:56,127 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 11:39:56,128 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:39:56" (1/1) ... [2020-07-01 11:39:56,142 INFO L313 BlockEncoder]: Initial Icfg 16 locations, 19 edges [2020-07-01 11:39:56,143 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 11:39:56,144 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 11:39:56,145 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 11:39:56,145 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 11:39:56,148 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 11:39:56,149 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 11:39:56,149 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 11:39:56,166 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 11:39:56,184 INFO L200 BlockEncoder]: SBE split 5 edges [2020-07-01 11:39:56,188 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 11:39:56,189 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 11:39:56,216 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding [2020-07-01 11:39:56,218 INFO L70 RemoveSinkStates]: Removed 5 edges and 3 locations by removing sink states [2020-07-01 11:39:56,219 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 11:39:56,219 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 11:39:56,225 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding [2020-07-01 11:39:56,225 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 11:39:56,226 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 11:39:56,226 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 11:39:56,226 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 11:39:56,227 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 11:39:56,227 INFO L313 BlockEncoder]: Encoded RCFG 9 locations, 14 edges [2020-07-01 11:39:56,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:39:56 BasicIcfg [2020-07-01 11:39:56,228 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 11:39:56,229 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 11:39:56,229 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 11:39:56,233 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 11:39:56,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 11:39:55" (1/4) ... [2020-07-01 11:39:56,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cd6f039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 11:39:56, skipping insertion in model container [2020-07-01 11:39:56,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:39:55" (2/4) ... [2020-07-01 11:39:56,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cd6f039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 11:39:56, skipping insertion in model container [2020-07-01 11:39:56,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:39:56" (3/4) ... [2020-07-01 11:39:56,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cd6f039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:39:56, skipping insertion in model container [2020-07-01 11:39:56,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:39:56" (4/4) ... [2020-07-01 11:39:56,237 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 11:39:56,248 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 11:39:56,258 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2020-07-01 11:39:56,272 INFO L251 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-07-01 11:39:56,296 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 11:39:56,296 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 11:39:56,296 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 11:39:56,296 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 11:39:56,296 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 11:39:56,297 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 11:39:56,297 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 11:39:56,297 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 11:39:56,312 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-07-01 11:39:56,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 11:39:56,318 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:39:56,319 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 11:39:56,319 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 11:39:56,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:39:56,325 INFO L82 PathProgramCache]: Analyzing trace with hash 3129328, now seen corresponding path program 1 times [2020-07-01 11:39:56,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:39:56,336 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022097203] [2020-07-01 11:39:56,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:39:56,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:56,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:39:56,486 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022097203] [2020-07-01 11:39:56,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:39:56,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 11:39:56,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904426767] [2020-07-01 11:39:56,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 11:39:56,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:39:56,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:39:56,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:39:56,512 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2020-07-01 11:39:56,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:39:56,560 INFO L93 Difference]: Finished difference Result 16 states and 25 transitions. [2020-07-01 11:39:56,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:39:56,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 11:39:56,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:39:56,573 INFO L225 Difference]: With dead ends: 16 [2020-07-01 11:39:56,573 INFO L226 Difference]: Without dead ends: 9 [2020-07-01 11:39:56,576 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:39:56,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2020-07-01 11:39:56,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-07-01 11:39:56,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-01 11:39:56,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2020-07-01 11:39:56,612 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 13 transitions. Word has length 4 [2020-07-01 11:39:56,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:39:56,612 INFO L479 AbstractCegarLoop]: Abstraction has 9 states and 13 transitions. [2020-07-01 11:39:56,612 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 11:39:56,612 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 13 transitions. [2020-07-01 11:39:56,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 11:39:56,613 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:39:56,613 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 11:39:56,615 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 11:39:56,615 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 11:39:56,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:39:56,616 INFO L82 PathProgramCache]: Analyzing trace with hash 3130289, now seen corresponding path program 1 times [2020-07-01 11:39:56,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:39:56,616 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606124223] [2020-07-01 11:39:56,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:39:56,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:56,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:39:56,655 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606124223] [2020-07-01 11:39:56,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:39:56,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 11:39:56,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275460070] [2020-07-01 11:39:56,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 11:39:56,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:39:56,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:39:56,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:39:56,658 INFO L87 Difference]: Start difference. First operand 9 states and 13 transitions. Second operand 3 states. [2020-07-01 11:39:56,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:39:56,683 INFO L93 Difference]: Finished difference Result 9 states and 13 transitions. [2020-07-01 11:39:56,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:39:56,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 11:39:56,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:39:56,685 INFO L225 Difference]: With dead ends: 9 [2020-07-01 11:39:56,685 INFO L226 Difference]: Without dead ends: 7 [2020-07-01 11:39:56,686 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:39:56,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2020-07-01 11:39:56,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-07-01 11:39:56,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-01 11:39:56,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2020-07-01 11:39:56,688 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 9 transitions. Word has length 4 [2020-07-01 11:39:56,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:39:56,688 INFO L479 AbstractCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-07-01 11:39:56,689 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 11:39:56,689 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2020-07-01 11:39:56,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 11:39:56,689 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:39:56,689 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 11:39:56,690 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 11:39:56,690 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 11:39:56,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:39:56,690 INFO L82 PathProgramCache]: Analyzing trace with hash 3130291, now seen corresponding path program 1 times [2020-07-01 11:39:56,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:39:56,691 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181993995] [2020-07-01 11:39:56,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:39:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:56,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:39:56,751 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181993995] [2020-07-01 11:39:56,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:39:56,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 11:39:56,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947787577] [2020-07-01 11:39:56,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 11:39:56,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:39:56,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 11:39:56,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 11:39:56,752 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. Second operand 4 states. [2020-07-01 11:39:56,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:39:56,806 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2020-07-01 11:39:56,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:39:56,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2020-07-01 11:39:56,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:39:56,807 INFO L225 Difference]: With dead ends: 12 [2020-07-01 11:39:56,807 INFO L226 Difference]: Without dead ends: 10 [2020-07-01 11:39:56,808 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 11:39:56,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2020-07-01 11:39:56,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-07-01 11:39:56,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-01 11:39:56,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2020-07-01 11:39:56,812 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 4 [2020-07-01 11:39:56,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:39:56,812 INFO L479 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2020-07-01 11:39:56,813 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 11:39:56,813 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2020-07-01 11:39:56,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 11:39:56,813 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:39:56,813 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2020-07-01 11:39:56,814 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 11:39:56,814 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 11:39:56,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:39:56,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1234440823, now seen corresponding path program 1 times [2020-07-01 11:39:56,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:39:56,815 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95992237] [2020-07-01 11:39:56,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:39:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:56,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 11:39:56,873 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95992237] [2020-07-01 11:39:56,873 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702355450] [2020-07-01 11:39:56,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:39:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:56,911 INFO L264 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:39:56,916 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:56,972 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2020-07-01 11:39:56,972 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:39:56,980 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:39:56,981 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:39:56,981 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2020-07-01 11:39:57,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 11:39:57,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:39:57,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2020-07-01 11:39:57,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805199330] [2020-07-01 11:39:57,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 11:39:57,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:39:57,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 11:39:57,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-01 11:39:57,029 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 6 states. [2020-07-01 11:39:57,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:39:57,083 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2020-07-01 11:39:57,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 11:39:57,084 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2020-07-01 11:39:57,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:39:57,084 INFO L225 Difference]: With dead ends: 12 [2020-07-01 11:39:57,084 INFO L226 Difference]: Without dead ends: 10 [2020-07-01 11:39:57,085 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-07-01 11:39:57,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2020-07-01 11:39:57,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-07-01 11:39:57,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-01 11:39:57,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2020-07-01 11:39:57,088 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2020-07-01 11:39:57,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:39:57,088 INFO L479 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2020-07-01 11:39:57,089 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 11:39:57,089 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2020-07-01 11:39:57,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 11:39:57,089 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:39:57,089 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2020-07-01 11:39:57,290 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:39:57,291 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 11:39:57,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:39:57,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1234440822, now seen corresponding path program 1 times [2020-07-01 11:39:57,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:39:57,292 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735146039] [2020-07-01 11:39:57,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:39:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:57,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:39:57,366 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735146039] [2020-07-01 11:39:57,367 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602897093] [2020-07-01 11:39:57,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:39:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:57,399 INFO L264 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:39:57,400 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:57,468 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2020-07-01 11:39:57,469 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:39:57,475 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:39:57,476 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:39:57,476 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:7 [2020-07-01 11:39:57,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:39:57,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:39:57,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2020-07-01 11:39:57,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386791722] [2020-07-01 11:39:57,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-01 11:39:57,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:39:57,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 11:39:57,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-01 11:39:57,508 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 8 states. [2020-07-01 11:39:57,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:39:57,646 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2020-07-01 11:39:57,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 11:39:57,647 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2020-07-01 11:39:57,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:39:57,647 INFO L225 Difference]: With dead ends: 10 [2020-07-01 11:39:57,647 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 11:39:57,648 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-07-01 11:39:57,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 11:39:57,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 11:39:57,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 11:39:57,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 11:39:57,649 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2020-07-01 11:39:57,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:39:57,649 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 11:39:57,649 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-01 11:39:57,649 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 11:39:57,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 11:39:57,850 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:39:57,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 11:39:57,972 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 11:39:57,972 INFO L268 CegarLoopResult]: For program point L23(line 23) no Hoare annotation was computed. [2020-07-01 11:39:57,972 INFO L268 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2020-07-01 11:39:57,973 INFO L264 CegarLoopResult]: At program point L19-2(lines 19 24) the Hoare annotation is: (let ((.cse0 (= 1 (select |#valid| |ULTIMATE.start_main_~#a~0.base|))) (.cse1 (= 0 |ULTIMATE.start_main_~#a~0.offset|)) (.cse2 (<= 1 |#StackHeapBarrier|)) (.cse3 (<= 1 ULTIMATE.start_main_~offset~0)) (.cse4 (= (select |#length| |ULTIMATE.start_main_~#a~0.base|) (* ULTIMATE.start_main_~a_length~0 4)))) (or (and (<= 1 ULTIMATE.start_main_~i~0) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 (= 0 ULTIMATE.start_main_~i~0) .cse1 .cse2 .cse3 .cse4 (<= 1 ULTIMATE.start_main_~a_length~0)))) [2020-07-01 11:39:57,973 INFO L268 CegarLoopResult]: For program point L13(lines 13 15) no Hoare annotation was computed. [2020-07-01 11:39:57,974 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 11:39:57,974 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 11:39:57,974 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 11:39:57,974 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 11:39:57,976 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 11:39:57,986 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 11:39:57,987 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:39:57,987 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 11:39:57,987 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:39:57,995 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 11:39:57,995 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:39:57,995 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 11:39:57,995 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:39:57,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:39:57 BasicIcfg [2020-07-01 11:39:57,998 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 11:39:57,999 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 11:39:57,999 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 11:39:58,002 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 11:39:58,003 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:39:58,003 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 11:39:55" (1/5) ... [2020-07-01 11:39:58,004 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b7b02fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 11:39:58, skipping insertion in model container [2020-07-01 11:39:58,004 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:39:58,004 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:39:55" (2/5) ... [2020-07-01 11:39:58,004 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b7b02fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 11:39:58, skipping insertion in model container [2020-07-01 11:39:58,004 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:39:58,005 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:39:56" (3/5) ... [2020-07-01 11:39:58,005 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b7b02fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 11:39:58, skipping insertion in model container [2020-07-01 11:39:58,005 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:39:58,005 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:39:56" (4/5) ... [2020-07-01 11:39:58,005 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b7b02fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 11:39:58, skipping insertion in model container [2020-07-01 11:39:58,006 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:39:58,006 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:39:57" (5/5) ... [2020-07-01 11:39:58,007 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 11:39:58,028 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 11:39:58,028 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 11:39:58,028 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 11:39:58,029 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 11:39:58,029 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 11:39:58,029 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 11:39:58,029 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 11:39:58,029 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 11:39:58,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2020-07-01 11:39:58,037 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-01 11:39:58,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:39:58,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:39:58,041 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 11:39:58,042 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-01 11:39:58,042 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 11:39:58,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2020-07-01 11:39:58,043 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-01 11:39:58,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:39:58,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:39:58,043 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 11:39:58,043 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-01 11:39:58,048 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [72] ULTIMATE.startENTRY-->L13: Formula: (and (= 0 |v_#NULL.base_2|) (= |v_#valid_11| (store |v_#valid_12| 0 0)) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_9|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_~a_length~0=v_ULTIMATE.start_main_~a_length~0_8, #NULL.base=|v_#NULL.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_11|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, #valid=|v_#valid_11|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_~offset~0=v_ULTIMATE.start_main_~offset~0_4, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~#a~0.offset, ULTIMATE.start_main_~#a~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_~offset~0, #NULL.offset, ULTIMATE.start_main_#t~mem1, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~a_length~0, #NULL.base] 8#L13true [63] L13-->L19-2: Formula: (and (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_~#a~0.base_4|)) (= v_ULTIMATE.start_main_~i~0_2 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#a~0.base_4|) (= 0 |v_ULTIMATE.start_main_~#a~0.offset_4|) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#a~0.base_4| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_~#a~0.base_4| (* v_ULTIMATE.start_main_~a_length~0_5 4)) |v_#length_1|) (< 0 |v_ULTIMATE.start_main_~#a~0.base_4|) (>= v_ULTIMATE.start_main_~a_length~0_5 1) (= v_ULTIMATE.start_main_~offset~0_2 1)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_2|, ULTIMATE.start_main_~a_length~0=v_ULTIMATE.start_main_~a_length~0_5, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_4|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_4|, #valid=|v_#valid_5|, ULTIMATE.start_main_~offset~0=v_ULTIMATE.start_main_~offset~0_2, #length=|v_#length_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_2, ULTIMATE.start_main_~a_length~0=v_ULTIMATE.start_main_~a_length~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~#a~0.offset, ULTIMATE.start_main_~#a~0.base, #valid, ULTIMATE.start_main_~offset~0, #length, ULTIMATE.start_main_~i~0] 6#L19-2true [2020-07-01 11:39:58,049 INFO L796 eck$LassoCheckResult]: Loop: 6#L19-2true [39] L19-2-->L20: Formula: (< v_ULTIMATE.start_main_~i~0_4 v_ULTIMATE.start_main_~a_length~0_7) InVars {ULTIMATE.start_main_~a_length~0=v_ULTIMATE.start_main_~a_length~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4} OutVars{ULTIMATE.start_main_~a_length~0=v_ULTIMATE.start_main_~a_length~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4} AuxVars[] AssignedVars[] 10#L20true [75] L20-->L23: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_14))) (and (= 1 (select |v_#valid_14| |v_ULTIMATE.start_main_~#a~0.base_13|)) (<= 0 (+ .cse0 |v_ULTIMATE.start_main_~#a~0.offset_11|)) (<= 0 (select (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#a~0.base_13|) (+ (* v_ULTIMATE.start_main_~i~0_14 4) |v_ULTIMATE.start_main_~#a~0.offset_11|))) (<= (+ .cse0 |v_ULTIMATE.start_main_~#a~0.offset_11| 4) (select |v_#length_8| |v_ULTIMATE.start_main_~#a~0.base_13|)))) InVars {ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_11|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_13|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, #length=|v_#length_8|} OutVars{ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_11|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_13|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, #length=|v_#length_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 7#L23true [74] L23-->L19-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_13))) (and (= v_ULTIMATE.start_main_~i~0_12 (+ (select (select |v_#memory_int_3| |v_ULTIMATE.start_main_~#a~0.base_12|) (+ |v_ULTIMATE.start_main_~#a~0.offset_10| (* v_ULTIMATE.start_main_~i~0_13 4))) v_ULTIMATE.start_main_~i~0_13 v_ULTIMATE.start_main_~offset~0_5)) (<= (+ |v_ULTIMATE.start_main_~#a~0.offset_10| .cse0 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#a~0.base_12|)) (= 1 (select |v_#valid_13| |v_ULTIMATE.start_main_~#a~0.base_12|)) (<= 0 (+ |v_ULTIMATE.start_main_~#a~0.offset_10| .cse0)))) InVars {ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_10|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_12|, #valid=|v_#valid_13|, ULTIMATE.start_main_~offset~0=v_ULTIMATE.start_main_~offset~0_5, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, #length=|v_#length_7|} OutVars{ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_10|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_12|, #valid=|v_#valid_13|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_6|, ULTIMATE.start_main_~offset~0=v_ULTIMATE.start_main_~offset~0_5, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, #length=|v_#length_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_~i~0] 6#L19-2true [2020-07-01 11:39:58,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:39:58,049 INFO L82 PathProgramCache]: Analyzing trace with hash 3256, now seen corresponding path program 1 times [2020-07-01 11:39:58,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:39:58,050 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949740563] [2020-07-01 11:39:58,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:39:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:58,079 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:39:58,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:39:58,080 INFO L82 PathProgramCache]: Analyzing trace with hash 69669, now seen corresponding path program 1 times [2020-07-01 11:39:58,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:39:58,081 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702226466] [2020-07-01 11:39:58,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:39:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:58,092 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:39:58,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:39:58,092 INFO L82 PathProgramCache]: Analyzing trace with hash 97039374, now seen corresponding path program 1 times [2020-07-01 11:39:58,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:39:58,093 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910105111] [2020-07-01 11:39:58,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:39:58,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:58,113 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:39:58,245 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:39:58,246 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:39:58,246 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:39:58,246 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:39:58,246 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 11:39:58,246 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:39:58,247 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:39:58,247 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:39:58,247 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-07-01 11:39:58,247 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:39:58,247 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:39:58,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:58,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:58,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:58,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:58,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:58,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:58,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:39:58,518 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:39:58,523 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:39:58,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:39:58,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:39:58,532 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:39:58,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:39:58,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:39:58,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:39:58,535 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:39:58,535 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:39:58,538 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:39:58,572 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:39:58,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:39:58,574 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:39:58,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:39:58,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:39:58,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:39:58,576 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:39:58,576 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:39:58,578 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:39:58,611 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:39:58,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:39:58,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:39:58,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:39:58,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:39:58,618 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 11:39:58,618 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 11:39:58,622 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:39:58,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:39:58,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:39:58,661 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:39:58,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:39:58,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:39:58,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:39:58,662 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:39:58,662 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:39:58,664 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:39:58,701 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:39:58,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:39:58,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:39:58,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:39:58,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:39:58,720 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 11:39:58,720 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 11:39:58,732 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 11:39:58,753 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-07-01 11:39:58,753 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:39:58,763 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 11:39:58,767 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-01 11:39:58,767 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 11:39:58,768 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~a_length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~a_length~0 Supporting invariants [1*ULTIMATE.start_main_~offset~0 - 1 >= 0] [2020-07-01 11:39:58,808 INFO L297 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2020-07-01 11:39:58,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:39:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:58,841 INFO L264 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:39:58,842 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:58,848 INFO L264 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:39:58,849 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:39:58,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:39:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:58,941 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:39:58,941 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-07-01 11:39:58,945 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-07-01 11:39:58,945 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 9 states. Second operand 4 states. [2020-07-01 11:39:59,070 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 9 states.. Second operand 4 states. Result 23 states and 37 transitions. Complement of second has 7 states. [2020-07-01 11:39:59,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states [2020-07-01 11:39:59,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-01 11:39:59,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2020-07-01 11:39:59,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 2 letters. Loop has 3 letters. [2020-07-01 11:39:59,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:39:59,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 3 letters. [2020-07-01 11:39:59,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:39:59,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 2 letters. Loop has 6 letters. [2020-07-01 11:39:59,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:39:59,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 37 transitions. [2020-07-01 11:39:59,084 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-01 11:39:59,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 5 states and 5 transitions. [2020-07-01 11:39:59,086 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-07-01 11:39:59,086 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-07-01 11:39:59,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 5 transitions. [2020-07-01 11:39:59,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-01 11:39:59,087 INFO L688 BuchiCegarLoop]: Abstraction has 5 states and 5 transitions. [2020-07-01 11:39:59,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states and 5 transitions. [2020-07-01 11:39:59,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2020-07-01 11:39:59,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-01 11:39:59,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2020-07-01 11:39:59,089 INFO L711 BuchiCegarLoop]: Abstraction has 5 states and 5 transitions. [2020-07-01 11:39:59,089 INFO L591 BuchiCegarLoop]: Abstraction has 5 states and 5 transitions. [2020-07-01 11:39:59,089 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-01 11:39:59,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 5 transitions. [2020-07-01 11:39:59,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-01 11:39:59,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:39:59,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:39:59,090 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 11:39:59,090 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-01 11:39:59,090 INFO L794 eck$LassoCheckResult]: Stem: 96#ULTIMATE.startENTRY [72] ULTIMATE.startENTRY-->L13: Formula: (and (= 0 |v_#NULL.base_2|) (= |v_#valid_11| (store |v_#valid_12| 0 0)) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_9|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_~a_length~0=v_ULTIMATE.start_main_~a_length~0_8, #NULL.base=|v_#NULL.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_11|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, #valid=|v_#valid_11|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_~offset~0=v_ULTIMATE.start_main_~offset~0_4, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~#a~0.offset, ULTIMATE.start_main_~#a~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_~offset~0, #NULL.offset, ULTIMATE.start_main_#t~mem1, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~a_length~0, #NULL.base] 97#L13 [62] L13-->L19-2: Formula: (and (> 0 |v_ULTIMATE.start_main_~#a~0.base_4|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_~#a~0.base_4|)) (= v_ULTIMATE.start_main_~i~0_2 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#a~0.base_4|) (= 0 |v_ULTIMATE.start_main_~#a~0.offset_4|) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#a~0.base_4| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_~#a~0.base_4| (* v_ULTIMATE.start_main_~a_length~0_5 4)) |v_#length_1|) (>= v_ULTIMATE.start_main_~a_length~0_5 1) (= v_ULTIMATE.start_main_~offset~0_2 1)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_2|, ULTIMATE.start_main_~a_length~0=v_ULTIMATE.start_main_~a_length~0_5, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_4|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_4|, #valid=|v_#valid_5|, ULTIMATE.start_main_~offset~0=v_ULTIMATE.start_main_~offset~0_2, #length=|v_#length_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_2, ULTIMATE.start_main_~a_length~0=v_ULTIMATE.start_main_~a_length~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~#a~0.offset, ULTIMATE.start_main_~#a~0.base, #valid, ULTIMATE.start_main_~offset~0, #length, ULTIMATE.start_main_~i~0] 98#L19-2 [2020-07-01 11:39:59,091 INFO L796 eck$LassoCheckResult]: Loop: 98#L19-2 [39] L19-2-->L20: Formula: (< v_ULTIMATE.start_main_~i~0_4 v_ULTIMATE.start_main_~a_length~0_7) InVars {ULTIMATE.start_main_~a_length~0=v_ULTIMATE.start_main_~a_length~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4} OutVars{ULTIMATE.start_main_~a_length~0=v_ULTIMATE.start_main_~a_length~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4} AuxVars[] AssignedVars[] 99#L20 [75] L20-->L23: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_14))) (and (= 1 (select |v_#valid_14| |v_ULTIMATE.start_main_~#a~0.base_13|)) (<= 0 (+ .cse0 |v_ULTIMATE.start_main_~#a~0.offset_11|)) (<= 0 (select (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#a~0.base_13|) (+ (* v_ULTIMATE.start_main_~i~0_14 4) |v_ULTIMATE.start_main_~#a~0.offset_11|))) (<= (+ .cse0 |v_ULTIMATE.start_main_~#a~0.offset_11| 4) (select |v_#length_8| |v_ULTIMATE.start_main_~#a~0.base_13|)))) InVars {ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_11|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_13|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, #length=|v_#length_8|} OutVars{ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_11|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_13|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, #length=|v_#length_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 100#L23 [74] L23-->L19-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_13))) (and (= v_ULTIMATE.start_main_~i~0_12 (+ (select (select |v_#memory_int_3| |v_ULTIMATE.start_main_~#a~0.base_12|) (+ |v_ULTIMATE.start_main_~#a~0.offset_10| (* v_ULTIMATE.start_main_~i~0_13 4))) v_ULTIMATE.start_main_~i~0_13 v_ULTIMATE.start_main_~offset~0_5)) (<= (+ |v_ULTIMATE.start_main_~#a~0.offset_10| .cse0 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#a~0.base_12|)) (= 1 (select |v_#valid_13| |v_ULTIMATE.start_main_~#a~0.base_12|)) (<= 0 (+ |v_ULTIMATE.start_main_~#a~0.offset_10| .cse0)))) InVars {ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_10|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_12|, #valid=|v_#valid_13|, ULTIMATE.start_main_~offset~0=v_ULTIMATE.start_main_~offset~0_5, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, #length=|v_#length_7|} OutVars{ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_10|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_12|, #valid=|v_#valid_13|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_6|, ULTIMATE.start_main_~offset~0=v_ULTIMATE.start_main_~offset~0_5, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, #length=|v_#length_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_~i~0] 98#L19-2 [2020-07-01 11:39:59,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:39:59,091 INFO L82 PathProgramCache]: Analyzing trace with hash 3255, now seen corresponding path program 1 times [2020-07-01 11:39:59,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:39:59,091 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876402410] [2020-07-01 11:39:59,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:39:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:39:59,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:39:59,106 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876402410] [2020-07-01 11:39:59,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:39:59,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-07-01 11:39:59,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172838509] [2020-07-01 11:39:59,107 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 11:39:59,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:39:59,107 INFO L82 PathProgramCache]: Analyzing trace with hash 69669, now seen corresponding path program 2 times [2020-07-01 11:39:59,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:39:59,107 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306035702] [2020-07-01 11:39:59,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:39:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:39:59,116 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:39:59,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:39:59,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:39:59,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:39:59,176 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. cyclomatic complexity: 1 Second operand 3 states. [2020-07-01 11:39:59,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:39:59,176 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2020-07-01 11:39:59,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:39:59,178 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2 states and 1 transitions. [2020-07-01 11:39:59,179 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-01 11:39:59,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2 states to 0 states and 0 transitions. [2020-07-01 11:39:59,179 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-01 11:39:59,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-01 11:39:59,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-01 11:39:59,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-01 11:39:59,180 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 11:39:59,180 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 11:39:59,180 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 11:39:59,180 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-01 11:39:59,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-01 11:39:59,180 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-01 11:39:59,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-01 11:39:59,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 11:39:59 BasicIcfg [2020-07-01 11:39:59,186 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-01 11:39:59,188 INFO L168 Benchmark]: Toolchain (without parser) took 3717.69 ms. Allocated memory was 514.9 MB in the beginning and 607.6 MB in the end (delta: 92.8 MB). Free memory was 435.3 MB in the beginning and 566.3 MB in the end (delta: -131.0 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 11:39:59,188 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 514.9 MB. Free memory is still 458.6 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 11:39:59,189 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.87 ms. Allocated memory was 514.9 MB in the beginning and 575.1 MB in the end (delta: 60.3 MB). Free memory was 435.3 MB in the beginning and 543.5 MB in the end (delta: -108.3 MB). Peak memory consumption was 28.0 MB. Max. memory is 50.3 GB. [2020-07-01 11:39:59,189 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.80 ms. Allocated memory is still 575.1 MB. Free memory was 543.5 MB in the beginning and 542.0 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 50.3 GB. [2020-07-01 11:39:59,190 INFO L168 Benchmark]: Boogie Preprocessor took 24.15 ms. Allocated memory is still 575.1 MB. Free memory was 542.0 MB in the beginning and 540.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 50.3 GB. [2020-07-01 11:39:59,190 INFO L168 Benchmark]: RCFGBuilder took 267.79 ms. Allocated memory is still 575.1 MB. Free memory was 540.5 MB in the beginning and 525.7 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 50.3 GB. [2020-07-01 11:39:59,191 INFO L168 Benchmark]: BlockEncodingV2 took 102.85 ms. Allocated memory is still 575.1 MB. Free memory was 525.7 MB in the beginning and 518.9 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 50.3 GB. [2020-07-01 11:39:59,191 INFO L168 Benchmark]: TraceAbstraction took 1769.46 ms. Allocated memory was 575.1 MB in the beginning and 599.8 MB in the end (delta: 24.6 MB). Free memory was 518.2 MB in the beginning and 534.9 MB in the end (delta: -16.7 MB). Peak memory consumption was 8.0 MB. Max. memory is 50.3 GB. [2020-07-01 11:39:59,192 INFO L168 Benchmark]: BuchiAutomizer took 1187.34 ms. Allocated memory was 599.8 MB in the beginning and 607.6 MB in the end (delta: 7.9 MB). Free memory was 534.9 MB in the beginning and 566.3 MB in the end (delta: -31.4 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 11:39:59,196 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 16 locations, 19 edges - StatisticsResult: Encoded RCFG 9 locations, 14 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 514.9 MB. Free memory is still 458.6 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 319.87 ms. Allocated memory was 514.9 MB in the beginning and 575.1 MB in the end (delta: 60.3 MB). Free memory was 435.3 MB in the beginning and 543.5 MB in the end (delta: -108.3 MB). Peak memory consumption was 28.0 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 39.80 ms. Allocated memory is still 575.1 MB. Free memory was 543.5 MB in the beginning and 542.0 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 24.15 ms. Allocated memory is still 575.1 MB. Free memory was 542.0 MB in the beginning and 540.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 50.3 GB. * RCFGBuilder took 267.79 ms. Allocated memory is still 575.1 MB. Free memory was 540.5 MB in the beginning and 525.7 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 102.85 ms. Allocated memory is still 575.1 MB. Free memory was 525.7 MB in the beginning and 518.9 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1769.46 ms. Allocated memory was 575.1 MB in the beginning and 599.8 MB in the end (delta: 24.6 MB). Free memory was 518.2 MB in the beginning and 534.9 MB in the end (delta: -16.7 MB). Peak memory consumption was 8.0 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 1187.34 ms. Allocated memory was 599.8 MB in the beginning and 607.6 MB in the end (delta: 7.9 MB). Free memory was 534.9 MB in the beginning and 566.3 MB in the end (delta: -31.4 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 19]: Loop Invariant [2020-07-01 11:39:59,204 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 11:39:59,204 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:39:59,204 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 11:39:59,205 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:39:59,205 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 11:39:59,206 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:39:59,206 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 11:39:59,206 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((1 <= i && 1 == \valid[a]) && 0 == a) && 1 <= unknown-#StackHeapBarrier-unknown) && 1 <= offset) && unknown-#length-unknown[a] == a_length * 4) || ((((((1 == \valid[a] && 0 == i) && 0 == a) && 1 <= unknown-#StackHeapBarrier-unknown) && 1 <= offset) && unknown-#length-unknown[a] == a_length * 4) && 1 <= a_length) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.5s, OverallIterations: 5, TraceHistogramMax: 2, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 9 SDtfs, 31 SDslu, 0 SDs, 0 SdLazy, 87 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 3 NumberOfFragments, 54 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 16 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 33 ConstructedInterpolants, 0 QuantifiedInterpolants, 1554 SizeOfPredicates, 4 NumberOfNonLiveVariables, 70 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 2/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function -1 * i + a_length and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.1s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 5 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 5 SDtfs, 50 SDslu, 2 SDs, 0 SdLazy, 39 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital101 mio100 ax100 hnf100 lsp94 ukn64 mio100 lsp75 div100 bol100 ite100 ukn100 eq154 hnf92 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-07-01 11:39:52.044 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp/BenchExec_run_YrfDDo/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 11:39:59.437 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check