/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/nec40.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:27:32,021 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:27:32,023 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:27:32,035 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:27:32,035 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:27:32,036 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:27:32,038 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:27:32,039 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:27:32,041 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:27:32,042 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:27:32,043 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:27:32,044 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:27:32,044 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:27:32,045 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:27:32,046 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:27:32,047 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:27:32,048 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:27:32,050 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:27:32,052 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:27:32,056 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:27:32,060 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:27:32,061 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:27:32,064 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:27:32,064 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:27:32,067 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:27:32,067 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:27:32,067 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:27:32,071 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:27:32,071 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:27:32,072 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:27:32,072 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:27:32,074 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:27:32,075 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:27:32,076 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:27:32,077 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:27:32,077 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:27:32,078 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:27:32,082 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:27:32,082 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:27:32,083 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:27:32,084 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:27:32,085 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:27:32,105 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:27:32,105 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:27:32,107 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:27:32,107 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:27:32,107 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:27:32,108 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:27:32,108 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:27:32,108 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:27:32,108 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:27:32,108 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:27:32,109 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:27:32,110 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:27:32,110 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:27:32,110 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:27:32,110 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:27:32,110 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:27:32,111 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:27:32,111 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:27:32,111 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:27:32,111 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:27:32,112 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:27:32,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:27:32,112 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:27:32,112 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:27:32,112 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:27:32,113 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:27:32,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:27:32,113 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:27:32,113 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:27:32,113 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:27:32,381 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:27:32,401 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:27:32,405 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:27:32,407 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:27:32,407 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:27:32,408 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/nec40.c [2020-07-10 15:27:32,479 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55d6b6348/f3fc0e46f8d24a34a289f45a86dae247/FLAGac66e7e96 [2020-07-10 15:27:32,932 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:27:32,933 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/nec40.c [2020-07-10 15:27:32,939 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55d6b6348/f3fc0e46f8d24a34a289f45a86dae247/FLAGac66e7e96 [2020-07-10 15:27:33,360 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55d6b6348/f3fc0e46f8d24a34a289f45a86dae247 [2020-07-10 15:27:33,370 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:27:33,372 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:27:33,373 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:27:33,374 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:27:33,377 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:27:33,379 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:27:33" (1/1) ... [2020-07-10 15:27:33,381 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47941ef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:33, skipping insertion in model container [2020-07-10 15:27:33,382 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:27:33" (1/1) ... [2020-07-10 15:27:33,389 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:27:33,406 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:27:33,570 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:27:33,580 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:27:33,600 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:27:33,623 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:27:33,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:33 WrapperNode [2020-07-10 15:27:33,624 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:27:33,625 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:27:33,625 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:27:33,625 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:27:33,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:33" (1/1) ... [2020-07-10 15:27:33,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:33" (1/1) ... [2020-07-10 15:27:33,732 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:33" (1/1) ... [2020-07-10 15:27:33,732 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:33" (1/1) ... [2020-07-10 15:27:33,742 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:33" (1/1) ... [2020-07-10 15:27:33,747 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:33" (1/1) ... [2020-07-10 15:27:33,748 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:33" (1/1) ... [2020-07-10 15:27:33,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:27:33,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:27:33,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:27:33,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:27:33,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:27:33,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:27:33,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:27:33,817 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:27:33,817 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:27:33,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:27:33,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:27:33,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:27:33,817 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:27:33,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:27:33,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:27:33,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:27:33,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:27:33,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:27:33,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:27:34,119 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:27:34,119 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 15:27:34,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:27:34 BoogieIcfgContainer [2020-07-10 15:27:34,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:27:34,125 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:27:34,125 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:27:34,128 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:27:34,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:27:33" (1/3) ... [2020-07-10 15:27:34,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c4c12d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:27:34, skipping insertion in model container [2020-07-10 15:27:34,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:33" (2/3) ... [2020-07-10 15:27:34,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c4c12d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:27:34, skipping insertion in model container [2020-07-10 15:27:34,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:27:34" (3/3) ... [2020-07-10 15:27:34,132 INFO L109 eAbstractionObserver]: Analyzing ICFG nec40.c [2020-07-10 15:27:34,144 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:27:34,152 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:27:34,167 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:27:34,190 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:27:34,190 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:27:34,190 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:27:34,191 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:27:34,191 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:27:34,191 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:27:34,191 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:27:34,191 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:27:34,211 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-07-10 15:27:34,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-10 15:27:34,217 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:34,218 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:34,218 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:34,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:34,224 INFO L82 PathProgramCache]: Analyzing trace with hash -91485938, now seen corresponding path program 1 times [2020-07-10 15:27:34,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:34,231 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247629945] [2020-07-10 15:27:34,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:34,557 INFO L280 TraceCheckUtils]: 0: Hoare triple {31#(and (= |~#y~0.offset| |old(~#y~0.offset)|) (= ~i~0 |old(~i~0)|) (= ~j~0 |old(~j~0)|) (= |#valid| |old(#valid)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |~#y~0.base| |old(~#y~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |old(#length)| |#length|) (= ~k~0 |old(~k~0)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(100);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);call ~#y~0.base, ~#y~0.offset := #Ultimate.allocOnStack(100);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base);~i~0 := 0;~j~0 := 0;~k~0 := 0; {26#true} is VALID [2020-07-10 15:27:34,557 INFO L280 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2020-07-10 15:27:34,558 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #47#return; {26#true} is VALID [2020-07-10 15:27:34,563 INFO L263 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {31#(and (= |~#y~0.offset| |old(~#y~0.offset)|) (= ~i~0 |old(~i~0)|) (= ~j~0 |old(~j~0)|) (= |#valid| |old(#valid)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |~#y~0.base| |old(~#y~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |old(#length)| |#length|) (= ~k~0 |old(~k~0)|))} is VALID [2020-07-10 15:27:34,564 INFO L280 TraceCheckUtils]: 1: Hoare triple {31#(and (= |~#y~0.offset| |old(~#y~0.offset)|) (= ~i~0 |old(~i~0)|) (= ~j~0 |old(~j~0)|) (= |#valid| |old(#valid)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |~#y~0.base| |old(~#y~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |old(#length)| |#length|) (= ~k~0 |old(~k~0)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(100);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);call ~#y~0.base, ~#y~0.offset := #Ultimate.allocOnStack(100);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base);~i~0 := 0;~j~0 := 0;~k~0 := 0; {26#true} is VALID [2020-07-10 15:27:34,564 INFO L280 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2020-07-10 15:27:34,564 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #47#return; {26#true} is VALID [2020-07-10 15:27:34,565 INFO L263 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret5 := main(); {26#true} is VALID [2020-07-10 15:27:34,565 INFO L280 TraceCheckUtils]: 5: Hoare triple {26#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {26#true} is VALID [2020-07-10 15:27:34,567 INFO L280 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID [2020-07-10 15:27:34,568 INFO L280 TraceCheckUtils]: 7: Hoare triple {27#false} call write~int(0, ~#y~0.base, ~#y~0.offset + ~i~0, 1); {27#false} is VALID [2020-07-10 15:27:34,568 INFO L280 TraceCheckUtils]: 8: Hoare triple {27#false} assume ~k~0 >= 0 && ~k~0 < ~i~0;call #t~mem4 := read~int(~#y~0.base, ~#y~0.offset + ~k~0, 1); {27#false} is VALID [2020-07-10 15:27:34,569 INFO L280 TraceCheckUtils]: 9: Hoare triple {27#false} assume 0 != #t~mem4;havoc #t~mem4; {27#false} is VALID [2020-07-10 15:27:34,569 INFO L263 TraceCheckUtils]: 10: Hoare triple {27#false} call __VERIFIER_assert(0); {27#false} is VALID [2020-07-10 15:27:34,570 INFO L280 TraceCheckUtils]: 11: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2020-07-10 15:27:34,570 INFO L280 TraceCheckUtils]: 12: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2020-07-10 15:27:34,570 INFO L280 TraceCheckUtils]: 13: Hoare triple {27#false} assume !false; {27#false} is VALID [2020-07-10 15:27:34,573 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-10 15:27:34,574 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247629945] [2020-07-10 15:27:34,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:34,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:27:34,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846792732] [2020-07-10 15:27:34,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-07-10 15:27:34,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:34,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:27:34,639 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:34,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:27:34,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:34,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:27:34,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:27:34,655 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2020-07-10 15:27:34,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:34,835 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2020-07-10 15:27:34,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:27:34,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-07-10 15:27:34,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:34,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:27:34,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2020-07-10 15:27:34,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:27:34,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2020-07-10 15:27:34,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2020-07-10 15:27:34,935 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:34,946 INFO L225 Difference]: With dead ends: 38 [2020-07-10 15:27:34,947 INFO L226 Difference]: Without dead ends: 16 [2020-07-10 15:27:34,950 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-10 15:27:34,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-10 15:27:35,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-10 15:27:35,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:35,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2020-07-10 15:27:35,013 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-10 15:27:35,013 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-10 15:27:35,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:35,017 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-10 15:27:35,017 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-10 15:27:35,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:35,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:35,018 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-10 15:27:35,018 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-10 15:27:35,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:35,021 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-10 15:27:35,022 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-10 15:27:35,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:35,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:35,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:35,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:35,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-10 15:27:35,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2020-07-10 15:27:35,027 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2020-07-10 15:27:35,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:35,028 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2020-07-10 15:27:35,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:27:35,028 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-10 15:27:35,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-10 15:27:35,029 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:35,029 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:35,030 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:27:35,030 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:35,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:35,044 INFO L82 PathProgramCache]: Analyzing trace with hash 883179888, now seen corresponding path program 1 times [2020-07-10 15:27:35,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:35,044 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137354312] [2020-07-10 15:27:35,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:35,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:35,205 INFO L280 TraceCheckUtils]: 0: Hoare triple {142#(and (= |~#y~0.offset| |old(~#y~0.offset)|) (= ~i~0 |old(~i~0)|) (= ~j~0 |old(~j~0)|) (= |#valid| |old(#valid)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |~#y~0.base| |old(~#y~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |old(#length)| |#length|) (= ~k~0 |old(~k~0)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(100);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);call ~#y~0.base, ~#y~0.offset := #Ultimate.allocOnStack(100);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base);~i~0 := 0;~j~0 := 0;~k~0 := 0; {136#true} is VALID [2020-07-10 15:27:35,206 INFO L280 TraceCheckUtils]: 1: Hoare triple {136#true} assume true; {136#true} is VALID [2020-07-10 15:27:35,206 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {136#true} {136#true} #47#return; {136#true} is VALID [2020-07-10 15:27:35,209 INFO L263 TraceCheckUtils]: 0: Hoare triple {136#true} call ULTIMATE.init(); {142#(and (= |~#y~0.offset| |old(~#y~0.offset)|) (= ~i~0 |old(~i~0)|) (= ~j~0 |old(~j~0)|) (= |#valid| |old(#valid)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |~#y~0.base| |old(~#y~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |old(#length)| |#length|) (= ~k~0 |old(~k~0)|))} is VALID [2020-07-10 15:27:35,210 INFO L280 TraceCheckUtils]: 1: Hoare triple {142#(and (= |~#y~0.offset| |old(~#y~0.offset)|) (= ~i~0 |old(~i~0)|) (= ~j~0 |old(~j~0)|) (= |#valid| |old(#valid)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |~#y~0.base| |old(~#y~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |old(#length)| |#length|) (= ~k~0 |old(~k~0)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(100);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);call ~#y~0.base, ~#y~0.offset := #Ultimate.allocOnStack(100);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base);~i~0 := 0;~j~0 := 0;~k~0 := 0; {136#true} is VALID [2020-07-10 15:27:35,210 INFO L280 TraceCheckUtils]: 2: Hoare triple {136#true} assume true; {136#true} is VALID [2020-07-10 15:27:35,211 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {136#true} {136#true} #47#return; {136#true} is VALID [2020-07-10 15:27:35,211 INFO L263 TraceCheckUtils]: 4: Hoare triple {136#true} call #t~ret5 := main(); {136#true} is VALID [2020-07-10 15:27:35,213 INFO L280 TraceCheckUtils]: 5: Hoare triple {136#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {141#(= 0 ~i~0)} is VALID [2020-07-10 15:27:35,215 INFO L280 TraceCheckUtils]: 6: Hoare triple {141#(= 0 ~i~0)} call #t~mem1 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1); {141#(= 0 ~i~0)} is VALID [2020-07-10 15:27:35,216 INFO L280 TraceCheckUtils]: 7: Hoare triple {141#(= 0 ~i~0)} assume !(0 != #t~mem1);havoc #t~mem1; {141#(= 0 ~i~0)} is VALID [2020-07-10 15:27:35,217 INFO L280 TraceCheckUtils]: 8: Hoare triple {141#(= 0 ~i~0)} call write~int(0, ~#y~0.base, ~#y~0.offset + ~i~0, 1); {141#(= 0 ~i~0)} is VALID [2020-07-10 15:27:35,218 INFO L280 TraceCheckUtils]: 9: Hoare triple {141#(= 0 ~i~0)} assume ~k~0 >= 0 && ~k~0 < ~i~0;call #t~mem4 := read~int(~#y~0.base, ~#y~0.offset + ~k~0, 1); {137#false} is VALID [2020-07-10 15:27:35,218 INFO L280 TraceCheckUtils]: 10: Hoare triple {137#false} assume 0 != #t~mem4;havoc #t~mem4; {137#false} is VALID [2020-07-10 15:27:35,219 INFO L263 TraceCheckUtils]: 11: Hoare triple {137#false} call __VERIFIER_assert(0); {137#false} is VALID [2020-07-10 15:27:35,219 INFO L280 TraceCheckUtils]: 12: Hoare triple {137#false} ~cond := #in~cond; {137#false} is VALID [2020-07-10 15:27:35,220 INFO L280 TraceCheckUtils]: 13: Hoare triple {137#false} assume 0 == ~cond; {137#false} is VALID [2020-07-10 15:27:35,220 INFO L280 TraceCheckUtils]: 14: Hoare triple {137#false} assume !false; {137#false} is VALID [2020-07-10 15:27:35,223 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-10 15:27:35,223 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137354312] [2020-07-10 15:27:35,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:35,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 15:27:35,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256834132] [2020-07-10 15:27:35,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-07-10 15:27:35,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:35,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:27:35,255 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:35,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:27:35,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:35,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:27:35,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:27:35,256 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 4 states. [2020-07-10 15:27:35,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:35,454 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2020-07-10 15:27:35,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:27:35,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-07-10 15:27:35,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:35,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:27:35,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2020-07-10 15:27:35,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:27:35,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2020-07-10 15:27:35,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2020-07-10 15:27:35,502 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:35,503 INFO L225 Difference]: With dead ends: 26 [2020-07-10 15:27:35,503 INFO L226 Difference]: Without dead ends: 18 [2020-07-10 15:27:35,504 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:27:35,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-10 15:27:35,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-10 15:27:35,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:35,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2020-07-10 15:27:35,528 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-10 15:27:35,529 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-10 15:27:35,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:35,531 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-10 15:27:35,531 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-07-10 15:27:35,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:35,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:35,532 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-10 15:27:35,532 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-10 15:27:35,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:35,534 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-10 15:27:35,534 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-07-10 15:27:35,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:35,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:35,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:35,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:35,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-10 15:27:35,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2020-07-10 15:27:35,537 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2020-07-10 15:27:35,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:35,537 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2020-07-10 15:27:35,537 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:27:35,538 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-07-10 15:27:35,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-10 15:27:35,538 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:35,539 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:35,539 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:27:35,539 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:35,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:35,540 INFO L82 PathProgramCache]: Analyzing trace with hash 975532875, now seen corresponding path program 1 times [2020-07-10 15:27:35,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:35,540 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458493049] [2020-07-10 15:27:35,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:35,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:35,704 INFO L280 TraceCheckUtils]: 0: Hoare triple {252#(and (= |~#y~0.offset| |old(~#y~0.offset)|) (= ~i~0 |old(~i~0)|) (= ~j~0 |old(~j~0)|) (= |#valid| |old(#valid)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |~#y~0.base| |old(~#y~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |old(#length)| |#length|) (= ~k~0 |old(~k~0)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(100);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);call ~#y~0.base, ~#y~0.offset := #Ultimate.allocOnStack(100);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base);~i~0 := 0;~j~0 := 0;~k~0 := 0; {250#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 15:27:35,705 INFO L280 TraceCheckUtils]: 1: Hoare triple {250#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} assume true; {250#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 15:27:35,708 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {250#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} {245#true} #47#return; {250#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 15:27:35,711 INFO L263 TraceCheckUtils]: 0: Hoare triple {245#true} call ULTIMATE.init(); {252#(and (= |~#y~0.offset| |old(~#y~0.offset)|) (= ~i~0 |old(~i~0)|) (= ~j~0 |old(~j~0)|) (= |#valid| |old(#valid)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |~#y~0.base| |old(~#y~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |old(#length)| |#length|) (= ~k~0 |old(~k~0)|))} is VALID [2020-07-10 15:27:35,713 INFO L280 TraceCheckUtils]: 1: Hoare triple {252#(and (= |~#y~0.offset| |old(~#y~0.offset)|) (= ~i~0 |old(~i~0)|) (= ~j~0 |old(~j~0)|) (= |#valid| |old(#valid)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |~#y~0.base| |old(~#y~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |old(#length)| |#length|) (= ~k~0 |old(~k~0)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(100);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);call ~#y~0.base, ~#y~0.offset := #Ultimate.allocOnStack(100);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base);~i~0 := 0;~j~0 := 0;~k~0 := 0; {250#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 15:27:35,714 INFO L280 TraceCheckUtils]: 2: Hoare triple {250#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} assume true; {250#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 15:27:35,715 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {250#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} {245#true} #47#return; {250#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 15:27:35,716 INFO L263 TraceCheckUtils]: 4: Hoare triple {250#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} call #t~ret5 := main(); {250#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 15:27:35,717 INFO L280 TraceCheckUtils]: 5: Hoare triple {250#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {250#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 15:27:35,718 INFO L280 TraceCheckUtils]: 6: Hoare triple {250#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} call #t~mem1 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1); {251#(= 0 |main_#t~mem1|)} is VALID [2020-07-10 15:27:35,719 INFO L280 TraceCheckUtils]: 7: Hoare triple {251#(= 0 |main_#t~mem1|)} assume !!(0 != #t~mem1);havoc #t~mem1;call #t~mem2 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1);call write~int(#t~mem2, ~#y~0.base, ~#y~0.offset + ~i~0, 1);havoc #t~mem2;#t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {246#false} is VALID [2020-07-10 15:27:35,719 INFO L280 TraceCheckUtils]: 8: Hoare triple {246#false} call #t~mem1 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1); {246#false} is VALID [2020-07-10 15:27:35,719 INFO L280 TraceCheckUtils]: 9: Hoare triple {246#false} assume !(0 != #t~mem1);havoc #t~mem1; {246#false} is VALID [2020-07-10 15:27:35,720 INFO L280 TraceCheckUtils]: 10: Hoare triple {246#false} call write~int(0, ~#y~0.base, ~#y~0.offset + ~i~0, 1); {246#false} is VALID [2020-07-10 15:27:35,720 INFO L280 TraceCheckUtils]: 11: Hoare triple {246#false} assume ~k~0 >= 0 && ~k~0 < ~i~0;call #t~mem4 := read~int(~#y~0.base, ~#y~0.offset + ~k~0, 1); {246#false} is VALID [2020-07-10 15:27:35,720 INFO L280 TraceCheckUtils]: 12: Hoare triple {246#false} assume 0 != #t~mem4;havoc #t~mem4; {246#false} is VALID [2020-07-10 15:27:35,721 INFO L263 TraceCheckUtils]: 13: Hoare triple {246#false} call __VERIFIER_assert(0); {246#false} is VALID [2020-07-10 15:27:35,721 INFO L280 TraceCheckUtils]: 14: Hoare triple {246#false} ~cond := #in~cond; {246#false} is VALID [2020-07-10 15:27:35,721 INFO L280 TraceCheckUtils]: 15: Hoare triple {246#false} assume 0 == ~cond; {246#false} is VALID [2020-07-10 15:27:35,722 INFO L280 TraceCheckUtils]: 16: Hoare triple {246#false} assume !false; {246#false} is VALID [2020-07-10 15:27:35,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:35,723 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458493049] [2020-07-10 15:27:35,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:35,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 15:27:35,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778627872] [2020-07-10 15:27:35,725 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-10 15:27:35,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:35,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:27:35,753 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:35,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:27:35,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:35,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:27:35,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:27:35,754 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 5 states. [2020-07-10 15:27:35,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:35,882 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-10 15:27:35,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:27:35,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-10 15:27:35,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:35,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:27:35,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2020-07-10 15:27:35,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:27:35,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2020-07-10 15:27:35,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 18 transitions. [2020-07-10 15:27:35,916 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:35,916 INFO L225 Difference]: With dead ends: 18 [2020-07-10 15:27:35,916 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:27:35,917 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:27:35,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:27:35,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:27:35,918 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:35,918 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:27:35,918 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:27:35,919 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:27:35,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:35,919 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:27:35,920 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:27:35,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:35,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:35,920 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:27:35,920 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:27:35,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:35,921 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:27:35,921 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:27:35,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:35,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:35,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:35,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:35,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:27:35,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:27:35,923 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2020-07-10 15:27:35,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:35,923 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:27:35,923 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:27:35,924 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:27:35,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:35,924 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:27:35,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:27:36,075 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:27:36,075 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |~#y~0.offset| |old(~#y~0.offset)|) (= ~i~0 |old(~i~0)|) (= ~j~0 |old(~j~0)|) (= |#valid| |old(#valid)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |~#y~0.base| |old(~#y~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |old(#length)| |#length|) (= ~k~0 |old(~k~0)|)) [2020-07-10 15:27:36,076 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:27:36,076 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:27:36,076 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 ~i~0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))) [2020-07-10 15:27:36,076 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:27:36,076 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:27:36,076 INFO L268 CegarLoopResult]: For program point L25(lines 25 26) no Hoare annotation was computed. [2020-07-10 15:27:36,076 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 14 29) no Hoare annotation was computed. [2020-07-10 15:27:36,077 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 14 29) no Hoare annotation was computed. [2020-07-10 15:27:36,077 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 14 29) the Hoare annotation is: (or (not (= 0 |old(~i~0)|)) (and (= 0 ~i~0) (= |#memory_int| |old(#memory_int)|) (= ~k~0 |old(~k~0)|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|)))) [2020-07-10 15:27:36,077 INFO L264 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (or (not (= 0 |old(~i~0)|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|)))) [2020-07-10 15:27:36,077 INFO L268 CegarLoopResult]: For program point L24(lines 24 26) no Hoare annotation was computed. [2020-07-10 15:27:36,077 INFO L268 CegarLoopResult]: For program point L24-1(lines 24 26) no Hoare annotation was computed. [2020-07-10 15:27:36,077 INFO L268 CegarLoopResult]: For program point L18-1(lines 18 21) no Hoare annotation was computed. [2020-07-10 15:27:36,078 INFO L264 CegarLoopResult]: At program point L18-3(lines 18 21) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (= 0 |old(~i~0)|)) (and (= 0 ~i~0) (= .cse0 (select |#memory_int| |~#x~0.base|))) (not (= .cse0 (select |old(#memory_int)| |~#x~0.base|))))) [2020-07-10 15:27:36,078 INFO L268 CegarLoopResult]: For program point L18-4(lines 18 21) no Hoare annotation was computed. [2020-07-10 15:27:36,078 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2020-07-10 15:27:36,078 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2020-07-10 15:27:36,078 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-10 15:27:36,079 INFO L268 CegarLoopResult]: For program point L4(lines 4 6) no Hoare annotation was computed. [2020-07-10 15:27:36,079 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2020-07-10 15:27:36,079 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2020-07-10 15:27:36,083 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:27:36,086 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:27:36,086 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:27:36,086 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:27:36,087 WARN L170 areAnnotationChecker]: L18-4 has no Hoare annotation [2020-07-10 15:27:36,087 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2020-07-10 15:27:36,087 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:27:36,088 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:27:36,088 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:27:36,088 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:27:36,088 WARN L170 areAnnotationChecker]: L18-4 has no Hoare annotation [2020-07-10 15:27:36,088 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2020-07-10 15:27:36,088 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2020-07-10 15:27:36,088 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 15:27:36,089 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 15:27:36,089 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-10 15:27:36,089 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-10 15:27:36,089 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-10 15:27:36,089 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:27:36,089 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-10 15:27:36,089 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-10 15:27:36,089 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2020-07-10 15:27:36,090 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2020-07-10 15:27:36,090 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:27:36,090 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:27:36,090 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:27:36,096 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:238) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:693) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:217) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-10 15:27:36,101 INFO L168 Benchmark]: Toolchain (without parser) took 2727.95 ms. Allocated memory was 138.4 MB in the beginning and 246.9 MB in the end (delta: 108.5 MB). Free memory was 103.3 MB in the beginning and 205.4 MB in the end (delta: -102.1 MB). Peak memory consumption was 6.4 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:36,102 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-10 15:27:36,103 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.86 ms. Allocated memory is still 138.4 MB. Free memory was 103.1 MB in the beginning and 92.6 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:36,104 INFO L168 Benchmark]: Boogie Preprocessor took 125.64 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 92.6 MB in the beginning and 180.3 MB in the end (delta: -87.7 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:36,104 INFO L168 Benchmark]: RCFGBuilder took 373.32 ms. Allocated memory is still 202.9 MB. Free memory was 180.3 MB in the beginning and 160.8 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:36,105 INFO L168 Benchmark]: TraceAbstraction took 1972.75 ms. Allocated memory was 202.9 MB in the beginning and 246.9 MB in the end (delta: 44.0 MB). Free memory was 160.1 MB in the beginning and 205.4 MB in the end (delta: -45.3 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 15:27:36,109 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.52 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 250.86 ms. Allocated memory is still 138.4 MB. Free memory was 103.1 MB in the beginning and 92.6 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 125.64 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 92.6 MB in the beginning and 180.3 MB in the end (delta: -87.7 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 373.32 ms. Allocated memory is still 202.9 MB. Free memory was 180.3 MB in the beginning and 160.8 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1972.75 ms. Allocated memory was 202.9 MB in the beginning and 246.9 MB in the end (delta: 44.0 MB). Free memory was 160.1 MB in the beginning and 205.4 MB in the end (delta: -45.3 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:238) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...