/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/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loops/nec40.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:21:56,590 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:21:56,592 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:21:56,605 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:21:56,605 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:21:56,606 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:21:56,608 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:21:56,610 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:21:56,612 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:21:56,613 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:21:56,614 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:21:56,615 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:21:56,615 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:21:56,616 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:21:56,617 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:21:56,619 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:21:56,620 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:21:56,621 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:21:56,623 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:21:56,625 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:21:56,633 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:21:56,635 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:21:56,636 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:21:56,637 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:21:56,644 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:21:56,645 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:21:56,645 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:21:56,646 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:21:56,646 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:21:56,649 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:21:56,649 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:21:56,650 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:21:56,651 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:21:56,653 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:21:56,655 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:21:56,655 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:21:56,656 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:21:56,656 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:21:56,656 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:21:56,661 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:21:56,663 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:21:56,663 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 20:21:56,681 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:21:56,682 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:21:56,684 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:21:56,684 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:21:56,684 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:21:56,685 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:21:56,685 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:21:56,685 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:21:56,685 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:21:56,685 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:21:56,686 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:21:56,687 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:21:56,687 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:21:56,687 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:21:56,687 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:21:56,688 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:21:56,688 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:21:56,688 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:21:56,688 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:21:56,688 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:21:56,689 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:21:56,689 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:21:56,689 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:21:56,952 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:21:56,966 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:21:56,970 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:21:56,972 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:21:56,972 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:21:56,973 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 20:21:57,057 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1f3b94fa/9a4fac1e0a6a4ace87e97bdad6a3a45e/FLAGa424c62af [2020-07-10 20:21:57,534 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:21:57,534 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/nec40.c [2020-07-10 20:21:57,541 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1f3b94fa/9a4fac1e0a6a4ace87e97bdad6a3a45e/FLAGa424c62af [2020-07-10 20:21:57,896 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1f3b94fa/9a4fac1e0a6a4ace87e97bdad6a3a45e [2020-07-10 20:21:57,904 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:21:57,906 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:21:57,908 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:57,908 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:21:57,911 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:21:57,913 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:57" (1/1) ... [2020-07-10 20:21:57,916 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e73a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:57, skipping insertion in model container [2020-07-10 20:21:57,916 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:57" (1/1) ... [2020-07-10 20:21:57,924 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:21:57,940 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:21:58,133 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:58,143 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:21:58,165 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:58,190 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:21:58,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:58 WrapperNode [2020-07-10 20:21:58,191 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:58,191 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:21:58,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:21:58,192 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:21:58,293 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:58" (1/1) ... [2020-07-10 20:21:58,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:58" (1/1) ... [2020-07-10 20:21:58,303 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:58" (1/1) ... [2020-07-10 20:21:58,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:58" (1/1) ... [2020-07-10 20:21:58,325 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:58" (1/1) ... [2020-07-10 20:21:58,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:58" (1/1) ... [2020-07-10 20:21:58,341 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:58" (1/1) ... [2020-07-10 20:21:58,343 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:21:58,344 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:21:58,344 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:21:58,344 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:21:58,345 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:58" (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 20:21:58,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:21:58,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:21:58,404 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:21:58,404 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:21:58,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:21:58,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:21:58,405 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:21:58,405 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:21:58,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 20:21:58,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 20:21:58,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:21:58,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 20:21:58,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:21:58,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 20:21:58,753 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:21:58,753 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 20:21:58,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:58 BoogieIcfgContainer [2020-07-10 20:21:58,758 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:21:58,760 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:21:58,760 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:21:58,764 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:21:58,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:21:57" (1/3) ... [2020-07-10 20:21:58,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1887b0b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:58, skipping insertion in model container [2020-07-10 20:21:58,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:58" (2/3) ... [2020-07-10 20:21:58,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1887b0b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:58, skipping insertion in model container [2020-07-10 20:21:58,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:58" (3/3) ... [2020-07-10 20:21:58,768 INFO L109 eAbstractionObserver]: Analyzing ICFG nec40.c [2020-07-10 20:21:58,782 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:21:58,790 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:21:58,825 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:21:58,861 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:21:58,862 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:21:58,862 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:21:58,862 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:21:58,862 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:21:58,862 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:21:58,862 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:21:58,863 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:21:58,880 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2020-07-10 20:21:58,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 20:21:58,890 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:58,891 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:21:58,891 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:58,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:58,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1729523867, now seen corresponding path program 1 times [2020-07-10 20:21:58,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:58,905 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1541991433] [2020-07-10 20:21:58,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:59,232 INFO L280 TraceCheckUtils]: 0: Hoare triple {63#(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; {49#true} is VALID [2020-07-10 20:21:59,233 INFO L280 TraceCheckUtils]: 1: Hoare triple {49#true} #valid := #valid[0 := 0]; {49#true} is VALID [2020-07-10 20:21:59,233 INFO L280 TraceCheckUtils]: 2: Hoare triple {49#true} assume 0 < #StackHeapBarrier; {49#true} is VALID [2020-07-10 20:21:59,234 INFO L280 TraceCheckUtils]: 3: Hoare triple {49#true} SUMMARY for call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(100); srcloc: L11 {49#true} is VALID [2020-07-10 20:21:59,234 INFO L280 TraceCheckUtils]: 4: Hoare triple {49#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base); {49#true} is VALID [2020-07-10 20:21:59,235 INFO L280 TraceCheckUtils]: 5: Hoare triple {49#true} SUMMARY for call ~#y~0.base, ~#y~0.offset := #Ultimate.allocOnStack(100); srcloc: L11-2 {49#true} is VALID [2020-07-10 20:21:59,235 INFO L280 TraceCheckUtils]: 6: Hoare triple {49#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base); {49#true} is VALID [2020-07-10 20:21:59,236 INFO L280 TraceCheckUtils]: 7: Hoare triple {49#true} ~i~0 := 0; {49#true} is VALID [2020-07-10 20:21:59,236 INFO L280 TraceCheckUtils]: 8: Hoare triple {49#true} ~j~0 := 0; {49#true} is VALID [2020-07-10 20:21:59,237 INFO L280 TraceCheckUtils]: 9: Hoare triple {49#true} ~k~0 := 0; {49#true} is VALID [2020-07-10 20:21:59,237 INFO L280 TraceCheckUtils]: 10: Hoare triple {49#true} assume true; {49#true} is VALID [2020-07-10 20:21:59,238 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {49#true} {49#true} #70#return; {49#true} is VALID [2020-07-10 20:21:59,243 INFO L263 TraceCheckUtils]: 0: Hoare triple {49#true} call ULTIMATE.init(); {63#(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 20:21:59,243 INFO L280 TraceCheckUtils]: 1: Hoare triple {63#(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; {49#true} is VALID [2020-07-10 20:21:59,244 INFO L280 TraceCheckUtils]: 2: Hoare triple {49#true} #valid := #valid[0 := 0]; {49#true} is VALID [2020-07-10 20:21:59,244 INFO L280 TraceCheckUtils]: 3: Hoare triple {49#true} assume 0 < #StackHeapBarrier; {49#true} is VALID [2020-07-10 20:21:59,245 INFO L280 TraceCheckUtils]: 4: Hoare triple {49#true} SUMMARY for call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(100); srcloc: L11 {49#true} is VALID [2020-07-10 20:21:59,245 INFO L280 TraceCheckUtils]: 5: Hoare triple {49#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base); {49#true} is VALID [2020-07-10 20:21:59,246 INFO L280 TraceCheckUtils]: 6: Hoare triple {49#true} SUMMARY for call ~#y~0.base, ~#y~0.offset := #Ultimate.allocOnStack(100); srcloc: L11-2 {49#true} is VALID [2020-07-10 20:21:59,246 INFO L280 TraceCheckUtils]: 7: Hoare triple {49#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base); {49#true} is VALID [2020-07-10 20:21:59,247 INFO L280 TraceCheckUtils]: 8: Hoare triple {49#true} ~i~0 := 0; {49#true} is VALID [2020-07-10 20:21:59,247 INFO L280 TraceCheckUtils]: 9: Hoare triple {49#true} ~j~0 := 0; {49#true} is VALID [2020-07-10 20:21:59,248 INFO L280 TraceCheckUtils]: 10: Hoare triple {49#true} ~k~0 := 0; {49#true} is VALID [2020-07-10 20:21:59,248 INFO L280 TraceCheckUtils]: 11: Hoare triple {49#true} assume true; {49#true} is VALID [2020-07-10 20:21:59,248 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {49#true} {49#true} #70#return; {49#true} is VALID [2020-07-10 20:21:59,249 INFO L263 TraceCheckUtils]: 13: Hoare triple {49#true} call #t~ret5 := main(); {49#true} is VALID [2020-07-10 20:21:59,249 INFO L280 TraceCheckUtils]: 14: Hoare triple {49#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {49#true} is VALID [2020-07-10 20:21:59,250 INFO L280 TraceCheckUtils]: 15: Hoare triple {49#true} ~k~0 := #t~nondet0; {49#true} is VALID [2020-07-10 20:21:59,250 INFO L280 TraceCheckUtils]: 16: Hoare triple {49#true} havoc #t~nondet0; {49#true} is VALID [2020-07-10 20:21:59,251 INFO L280 TraceCheckUtils]: 17: Hoare triple {49#true} ~i~0 := 0; {49#true} is VALID [2020-07-10 20:21:59,252 INFO L280 TraceCheckUtils]: 18: Hoare triple {49#true} assume !true; {50#false} is VALID [2020-07-10 20:21:59,252 INFO L280 TraceCheckUtils]: 19: Hoare triple {50#false} SUMMARY for call write~int(0, ~#y~0.base, ~#y~0.offset + ~i~0, 1); srcloc: L18-6 {50#false} is VALID [2020-07-10 20:21:59,253 INFO L280 TraceCheckUtils]: 20: Hoare triple {50#false} assume ~k~0 >= 0 && ~k~0 < ~i~0; {50#false} is VALID [2020-07-10 20:21:59,253 INFO L280 TraceCheckUtils]: 21: Hoare triple {50#false} SUMMARY for call #t~mem4 := read~int(~#y~0.base, ~#y~0.offset + ~k~0, 1); srcloc: L25 {50#false} is VALID [2020-07-10 20:21:59,253 INFO L280 TraceCheckUtils]: 22: Hoare triple {50#false} assume 0 != #t~mem4; {50#false} is VALID [2020-07-10 20:21:59,254 INFO L280 TraceCheckUtils]: 23: Hoare triple {50#false} havoc #t~mem4; {50#false} is VALID [2020-07-10 20:21:59,254 INFO L263 TraceCheckUtils]: 24: Hoare triple {50#false} call __VERIFIER_assert(0); {50#false} is VALID [2020-07-10 20:21:59,255 INFO L280 TraceCheckUtils]: 25: Hoare triple {50#false} ~cond := #in~cond; {50#false} is VALID [2020-07-10 20:21:59,255 INFO L280 TraceCheckUtils]: 26: Hoare triple {50#false} assume 0 == ~cond; {50#false} is VALID [2020-07-10 20:21:59,256 INFO L280 TraceCheckUtils]: 27: Hoare triple {50#false} assume !false; {50#false} is VALID [2020-07-10 20:21:59,260 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 20:21:59,261 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:59,263 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1541991433] [2020-07-10 20:21:59,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:59,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 20:21:59,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81338843] [2020-07-10 20:21:59,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-07-10 20:21:59,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:59,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 20:21:59,332 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:59,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 20:21:59,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:59,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 20:21:59,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:21:59,346 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2020-07-10 20:21:59,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:59,723 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2020-07-10 20:21:59,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 20:21:59,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-07-10 20:21:59,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:59,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:21:59,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2020-07-10 20:21:59,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:21:59,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2020-07-10 20:21:59,742 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 71 transitions. [2020-07-10 20:21:59,848 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:59,862 INFO L225 Difference]: With dead ends: 64 [2020-07-10 20:21:59,862 INFO L226 Difference]: Without dead ends: 38 [2020-07-10 20:21:59,867 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 20:21:59,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-10 20:21:59,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-07-10 20:21:59,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:59,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2020-07-10 20:21:59,977 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2020-07-10 20:21:59,977 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2020-07-10 20:21:59,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:59,982 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2020-07-10 20:21:59,983 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2020-07-10 20:21:59,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:59,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:59,984 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2020-07-10 20:21:59,984 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2020-07-10 20:21:59,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:59,989 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2020-07-10 20:21:59,989 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2020-07-10 20:21:59,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:59,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:59,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:59,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:59,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-10 20:21:59,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2020-07-10 20:21:59,996 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 28 [2020-07-10 20:21:59,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:59,996 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2020-07-10 20:21:59,997 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 20:21:59,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 38 transitions. [2020-07-10 20:22:00,046 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:00,047 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2020-07-10 20:22:00,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 20:22:00,048 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:00,048 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:22:00,049 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:22:00,049 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:00,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:00,050 INFO L82 PathProgramCache]: Analyzing trace with hash 736321097, now seen corresponding path program 1 times [2020-07-10 20:22:00,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:00,050 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [901200478] [2020-07-10 20:22:00,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:00,238 INFO L280 TraceCheckUtils]: 0: Hoare triple {361#(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; {346#true} is VALID [2020-07-10 20:22:00,239 INFO L280 TraceCheckUtils]: 1: Hoare triple {346#true} #valid := #valid[0 := 0]; {346#true} is VALID [2020-07-10 20:22:00,239 INFO L280 TraceCheckUtils]: 2: Hoare triple {346#true} assume 0 < #StackHeapBarrier; {346#true} is VALID [2020-07-10 20:22:00,239 INFO L280 TraceCheckUtils]: 3: Hoare triple {346#true} SUMMARY for call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(100); srcloc: L11 {346#true} is VALID [2020-07-10 20:22:00,240 INFO L280 TraceCheckUtils]: 4: Hoare triple {346#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base); {346#true} is VALID [2020-07-10 20:22:00,240 INFO L280 TraceCheckUtils]: 5: Hoare triple {346#true} SUMMARY for call ~#y~0.base, ~#y~0.offset := #Ultimate.allocOnStack(100); srcloc: L11-2 {346#true} is VALID [2020-07-10 20:22:00,241 INFO L280 TraceCheckUtils]: 6: Hoare triple {346#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base); {346#true} is VALID [2020-07-10 20:22:00,241 INFO L280 TraceCheckUtils]: 7: Hoare triple {346#true} ~i~0 := 0; {346#true} is VALID [2020-07-10 20:22:00,242 INFO L280 TraceCheckUtils]: 8: Hoare triple {346#true} ~j~0 := 0; {346#true} is VALID [2020-07-10 20:22:00,242 INFO L280 TraceCheckUtils]: 9: Hoare triple {346#true} ~k~0 := 0; {346#true} is VALID [2020-07-10 20:22:00,242 INFO L280 TraceCheckUtils]: 10: Hoare triple {346#true} assume true; {346#true} is VALID [2020-07-10 20:22:00,243 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {346#true} {346#true} #70#return; {346#true} is VALID [2020-07-10 20:22:00,245 INFO L263 TraceCheckUtils]: 0: Hoare triple {346#true} call ULTIMATE.init(); {361#(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 20:22:00,246 INFO L280 TraceCheckUtils]: 1: Hoare triple {361#(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; {346#true} is VALID [2020-07-10 20:22:00,246 INFO L280 TraceCheckUtils]: 2: Hoare triple {346#true} #valid := #valid[0 := 0]; {346#true} is VALID [2020-07-10 20:22:00,247 INFO L280 TraceCheckUtils]: 3: Hoare triple {346#true} assume 0 < #StackHeapBarrier; {346#true} is VALID [2020-07-10 20:22:00,247 INFO L280 TraceCheckUtils]: 4: Hoare triple {346#true} SUMMARY for call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(100); srcloc: L11 {346#true} is VALID [2020-07-10 20:22:00,247 INFO L280 TraceCheckUtils]: 5: Hoare triple {346#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base); {346#true} is VALID [2020-07-10 20:22:00,248 INFO L280 TraceCheckUtils]: 6: Hoare triple {346#true} SUMMARY for call ~#y~0.base, ~#y~0.offset := #Ultimate.allocOnStack(100); srcloc: L11-2 {346#true} is VALID [2020-07-10 20:22:00,248 INFO L280 TraceCheckUtils]: 7: Hoare triple {346#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base); {346#true} is VALID [2020-07-10 20:22:00,248 INFO L280 TraceCheckUtils]: 8: Hoare triple {346#true} ~i~0 := 0; {346#true} is VALID [2020-07-10 20:22:00,249 INFO L280 TraceCheckUtils]: 9: Hoare triple {346#true} ~j~0 := 0; {346#true} is VALID [2020-07-10 20:22:00,249 INFO L280 TraceCheckUtils]: 10: Hoare triple {346#true} ~k~0 := 0; {346#true} is VALID [2020-07-10 20:22:00,250 INFO L280 TraceCheckUtils]: 11: Hoare triple {346#true} assume true; {346#true} is VALID [2020-07-10 20:22:00,250 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {346#true} {346#true} #70#return; {346#true} is VALID [2020-07-10 20:22:00,250 INFO L263 TraceCheckUtils]: 13: Hoare triple {346#true} call #t~ret5 := main(); {346#true} is VALID [2020-07-10 20:22:00,250 INFO L280 TraceCheckUtils]: 14: Hoare triple {346#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {346#true} is VALID [2020-07-10 20:22:00,251 INFO L280 TraceCheckUtils]: 15: Hoare triple {346#true} ~k~0 := #t~nondet0; {346#true} is VALID [2020-07-10 20:22:00,251 INFO L280 TraceCheckUtils]: 16: Hoare triple {346#true} havoc #t~nondet0; {346#true} is VALID [2020-07-10 20:22:00,252 INFO L280 TraceCheckUtils]: 17: Hoare triple {346#true} ~i~0 := 0; {360#(= 0 ~i~0)} is VALID [2020-07-10 20:22:00,253 INFO L280 TraceCheckUtils]: 18: Hoare triple {360#(= 0 ~i~0)} SUMMARY for call #t~mem1 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1); srcloc: L18-5 {360#(= 0 ~i~0)} is VALID [2020-07-10 20:22:00,254 INFO L280 TraceCheckUtils]: 19: Hoare triple {360#(= 0 ~i~0)} assume !(0 != #t~mem1); {360#(= 0 ~i~0)} is VALID [2020-07-10 20:22:00,255 INFO L280 TraceCheckUtils]: 20: Hoare triple {360#(= 0 ~i~0)} havoc #t~mem1; {360#(= 0 ~i~0)} is VALID [2020-07-10 20:22:00,256 INFO L280 TraceCheckUtils]: 21: Hoare triple {360#(= 0 ~i~0)} SUMMARY for call write~int(0, ~#y~0.base, ~#y~0.offset + ~i~0, 1); srcloc: L18-6 {360#(= 0 ~i~0)} is VALID [2020-07-10 20:22:00,257 INFO L280 TraceCheckUtils]: 22: Hoare triple {360#(= 0 ~i~0)} assume ~k~0 >= 0 && ~k~0 < ~i~0; {347#false} is VALID [2020-07-10 20:22:00,257 INFO L280 TraceCheckUtils]: 23: Hoare triple {347#false} SUMMARY for call #t~mem4 := read~int(~#y~0.base, ~#y~0.offset + ~k~0, 1); srcloc: L25 {347#false} is VALID [2020-07-10 20:22:00,258 INFO L280 TraceCheckUtils]: 24: Hoare triple {347#false} assume 0 != #t~mem4; {347#false} is VALID [2020-07-10 20:22:00,258 INFO L280 TraceCheckUtils]: 25: Hoare triple {347#false} havoc #t~mem4; {347#false} is VALID [2020-07-10 20:22:00,258 INFO L263 TraceCheckUtils]: 26: Hoare triple {347#false} call __VERIFIER_assert(0); {347#false} is VALID [2020-07-10 20:22:00,259 INFO L280 TraceCheckUtils]: 27: Hoare triple {347#false} ~cond := #in~cond; {347#false} is VALID [2020-07-10 20:22:00,259 INFO L280 TraceCheckUtils]: 28: Hoare triple {347#false} assume 0 == ~cond; {347#false} is VALID [2020-07-10 20:22:00,259 INFO L280 TraceCheckUtils]: 29: Hoare triple {347#false} assume !false; {347#false} is VALID [2020-07-10 20:22:00,261 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 20:22:00,262 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:00,262 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [901200478] [2020-07-10 20:22:00,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:00,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 20:22:00,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044973301] [2020-07-10 20:22:00,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2020-07-10 20:22:00,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:00,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 20:22:00,303 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:00,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 20:22:00,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:00,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 20:22:00,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 20:22:00,305 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 4 states. [2020-07-10 20:22:00,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:00,641 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2020-07-10 20:22:00,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 20:22:00,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2020-07-10 20:22:00,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:00,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 20:22:00,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2020-07-10 20:22:00,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 20:22:00,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2020-07-10 20:22:00,661 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 57 transitions. [2020-07-10 20:22:00,739 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:00,741 INFO L225 Difference]: With dead ends: 57 [2020-07-10 20:22:00,742 INFO L226 Difference]: Without dead ends: 46 [2020-07-10 20:22:00,743 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 20:22:00,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-10 20:22:00,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2020-07-10 20:22:00,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:00,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 40 states. [2020-07-10 20:22:00,808 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 40 states. [2020-07-10 20:22:00,808 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 40 states. [2020-07-10 20:22:00,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:00,812 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2020-07-10 20:22:00,812 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2020-07-10 20:22:00,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:00,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:00,813 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 46 states. [2020-07-10 20:22:00,813 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 46 states. [2020-07-10 20:22:00,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:00,817 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2020-07-10 20:22:00,817 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2020-07-10 20:22:00,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:00,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:00,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:00,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:00,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-10 20:22:00,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2020-07-10 20:22:00,822 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 30 [2020-07-10 20:22:00,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:00,822 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2020-07-10 20:22:00,823 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 20:22:00,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 40 transitions. [2020-07-10 20:22:00,879 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:00,880 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2020-07-10 20:22:00,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-10 20:22:00,881 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:00,881 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:22:00,882 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:22:00,882 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:00,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:00,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1137669723, now seen corresponding path program 1 times [2020-07-10 20:22:00,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:00,883 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [803191557] [2020-07-10 20:22:00,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:00,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:01,082 INFO L280 TraceCheckUtils]: 0: Hoare triple {668#(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; {652#true} is VALID [2020-07-10 20:22:01,082 INFO L280 TraceCheckUtils]: 1: Hoare triple {652#true} #valid := #valid[0 := 0]; {652#true} is VALID [2020-07-10 20:22:01,083 INFO L280 TraceCheckUtils]: 2: Hoare triple {652#true} assume 0 < #StackHeapBarrier; {652#true} is VALID [2020-07-10 20:22:01,083 INFO L280 TraceCheckUtils]: 3: Hoare triple {652#true} SUMMARY for call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(100); srcloc: L11 {652#true} is VALID [2020-07-10 20:22:01,084 INFO L280 TraceCheckUtils]: 4: Hoare triple {652#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base); {666#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:22:01,085 INFO L280 TraceCheckUtils]: 5: Hoare triple {666#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} SUMMARY for call ~#y~0.base, ~#y~0.offset := #Ultimate.allocOnStack(100); srcloc: L11-2 {666#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:22:01,086 INFO L280 TraceCheckUtils]: 6: Hoare triple {666#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base); {666#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:22:01,087 INFO L280 TraceCheckUtils]: 7: Hoare triple {666#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} ~i~0 := 0; {666#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:22:01,088 INFO L280 TraceCheckUtils]: 8: Hoare triple {666#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} ~j~0 := 0; {666#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:22:01,089 INFO L280 TraceCheckUtils]: 9: Hoare triple {666#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} ~k~0 := 0; {666#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:22:01,090 INFO L280 TraceCheckUtils]: 10: Hoare triple {666#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} assume true; {666#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:22:01,091 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {666#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} {652#true} #70#return; {666#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:22:01,093 INFO L263 TraceCheckUtils]: 0: Hoare triple {652#true} call ULTIMATE.init(); {668#(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 20:22:01,093 INFO L280 TraceCheckUtils]: 1: Hoare triple {668#(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; {652#true} is VALID [2020-07-10 20:22:01,094 INFO L280 TraceCheckUtils]: 2: Hoare triple {652#true} #valid := #valid[0 := 0]; {652#true} is VALID [2020-07-10 20:22:01,094 INFO L280 TraceCheckUtils]: 3: Hoare triple {652#true} assume 0 < #StackHeapBarrier; {652#true} is VALID [2020-07-10 20:22:01,094 INFO L280 TraceCheckUtils]: 4: Hoare triple {652#true} SUMMARY for call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(100); srcloc: L11 {652#true} is VALID [2020-07-10 20:22:01,096 INFO L280 TraceCheckUtils]: 5: Hoare triple {652#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base); {666#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:22:01,096 INFO L280 TraceCheckUtils]: 6: Hoare triple {666#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} SUMMARY for call ~#y~0.base, ~#y~0.offset := #Ultimate.allocOnStack(100); srcloc: L11-2 {666#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:22:01,098 INFO L280 TraceCheckUtils]: 7: Hoare triple {666#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base); {666#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:22:01,098 INFO L280 TraceCheckUtils]: 8: Hoare triple {666#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} ~i~0 := 0; {666#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:22:01,099 INFO L280 TraceCheckUtils]: 9: Hoare triple {666#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} ~j~0 := 0; {666#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:22:01,100 INFO L280 TraceCheckUtils]: 10: Hoare triple {666#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} ~k~0 := 0; {666#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:22:01,101 INFO L280 TraceCheckUtils]: 11: Hoare triple {666#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} assume true; {666#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:22:01,102 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {666#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} {652#true} #70#return; {666#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:22:01,103 INFO L263 TraceCheckUtils]: 13: Hoare triple {666#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} call #t~ret5 := main(); {666#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:22:01,104 INFO L280 TraceCheckUtils]: 14: Hoare triple {666#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {666#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:22:01,104 INFO L280 TraceCheckUtils]: 15: Hoare triple {666#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} ~k~0 := #t~nondet0; {666#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:22:01,105 INFO L280 TraceCheckUtils]: 16: Hoare triple {666#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} havoc #t~nondet0; {666#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:22:01,106 INFO L280 TraceCheckUtils]: 17: Hoare triple {666#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} ~i~0 := 0; {666#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:22:01,107 INFO L280 TraceCheckUtils]: 18: Hoare triple {666#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} SUMMARY for call #t~mem1 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1); srcloc: L18-5 {667#(= 0 |main_#t~mem1|)} is VALID [2020-07-10 20:22:01,108 INFO L280 TraceCheckUtils]: 19: Hoare triple {667#(= 0 |main_#t~mem1|)} assume !!(0 != #t~mem1); {653#false} is VALID [2020-07-10 20:22:01,108 INFO L280 TraceCheckUtils]: 20: Hoare triple {653#false} havoc #t~mem1; {653#false} is VALID [2020-07-10 20:22:01,108 INFO L280 TraceCheckUtils]: 21: Hoare triple {653#false} SUMMARY for call #t~mem2 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1); srcloc: L19 {653#false} is VALID [2020-07-10 20:22:01,109 INFO L280 TraceCheckUtils]: 22: Hoare triple {653#false} SUMMARY for call write~int(#t~mem2, ~#y~0.base, ~#y~0.offset + ~i~0, 1); srcloc: L19-1 {653#false} is VALID [2020-07-10 20:22:01,109 INFO L280 TraceCheckUtils]: 23: Hoare triple {653#false} havoc #t~mem2; {653#false} is VALID [2020-07-10 20:22:01,109 INFO L280 TraceCheckUtils]: 24: Hoare triple {653#false} #t~post3 := ~i~0; {653#false} is VALID [2020-07-10 20:22:01,110 INFO L280 TraceCheckUtils]: 25: Hoare triple {653#false} ~i~0 := 1 + #t~post3; {653#false} is VALID [2020-07-10 20:22:01,110 INFO L280 TraceCheckUtils]: 26: Hoare triple {653#false} havoc #t~post3; {653#false} is VALID [2020-07-10 20:22:01,110 INFO L280 TraceCheckUtils]: 27: Hoare triple {653#false} SUMMARY for call #t~mem1 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1); srcloc: L18-5 {653#false} is VALID [2020-07-10 20:22:01,111 INFO L280 TraceCheckUtils]: 28: Hoare triple {653#false} assume !(0 != #t~mem1); {653#false} is VALID [2020-07-10 20:22:01,111 INFO L280 TraceCheckUtils]: 29: Hoare triple {653#false} havoc #t~mem1; {653#false} is VALID [2020-07-10 20:22:01,111 INFO L280 TraceCheckUtils]: 30: Hoare triple {653#false} SUMMARY for call write~int(0, ~#y~0.base, ~#y~0.offset + ~i~0, 1); srcloc: L18-6 {653#false} is VALID [2020-07-10 20:22:01,111 INFO L280 TraceCheckUtils]: 31: Hoare triple {653#false} assume ~k~0 >= 0 && ~k~0 < ~i~0; {653#false} is VALID [2020-07-10 20:22:01,112 INFO L280 TraceCheckUtils]: 32: Hoare triple {653#false} SUMMARY for call #t~mem4 := read~int(~#y~0.base, ~#y~0.offset + ~k~0, 1); srcloc: L25 {653#false} is VALID [2020-07-10 20:22:01,112 INFO L280 TraceCheckUtils]: 33: Hoare triple {653#false} assume 0 != #t~mem4; {653#false} is VALID [2020-07-10 20:22:01,112 INFO L280 TraceCheckUtils]: 34: Hoare triple {653#false} havoc #t~mem4; {653#false} is VALID [2020-07-10 20:22:01,113 INFO L263 TraceCheckUtils]: 35: Hoare triple {653#false} call __VERIFIER_assert(0); {653#false} is VALID [2020-07-10 20:22:01,113 INFO L280 TraceCheckUtils]: 36: Hoare triple {653#false} ~cond := #in~cond; {653#false} is VALID [2020-07-10 20:22:01,113 INFO L280 TraceCheckUtils]: 37: Hoare triple {653#false} assume 0 == ~cond; {653#false} is VALID [2020-07-10 20:22:01,114 INFO L280 TraceCheckUtils]: 38: Hoare triple {653#false} assume !false; {653#false} is VALID [2020-07-10 20:22:01,117 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 20:22:01,117 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:01,117 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [803191557] [2020-07-10 20:22:01,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:01,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:22:01,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007135266] [2020-07-10 20:22:01,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2020-07-10 20:22:01,119 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:01,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:22:01,163 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:01,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:22:01,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:01,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:22:01,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:22:01,164 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 5 states. [2020-07-10 20:22:01,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:01,342 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2020-07-10 20:22:01,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 20:22:01,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2020-07-10 20:22:01,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:01,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:22:01,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2020-07-10 20:22:01,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:22:01,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2020-07-10 20:22:01,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2020-07-10 20:22:01,393 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:01,394 INFO L225 Difference]: With dead ends: 40 [2020-07-10 20:22:01,394 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 20:22:01,395 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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 20:22:01,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 20:22:01,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 20:22:01,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:01,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:01,396 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:01,396 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:01,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:01,396 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:22:01,396 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:22:01,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:01,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:01,397 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:01,397 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:01,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:01,398 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:22:01,398 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:22:01,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:01,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:01,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:01,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:01,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 20:22:01,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 20:22:01,399 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2020-07-10 20:22:01,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:01,400 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 20:22:01,400 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:22:01,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-10 20:22:01,400 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:01,400 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:22:01,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:01,401 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:22:01,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 20:22:01,870 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 20:22:01,870 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-07-10 20:22:01,871 INFO L264 CegarLoopResult]: At program point ULTIMATE.initFINAL(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 20:22:01,871 INFO L264 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) [2020-07-10 20:22:01,871 INFO L271 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: true [2020-07-10 20:22:01,871 INFO L264 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: (and (= 0 ~i~0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))) [2020-07-10 20:22:01,871 INFO L271 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: true [2020-07-10 20:22:01,871 INFO L264 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: (and (= 0 ~i~0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))) [2020-07-10 20:22:01,872 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 20:22:01,872 INFO L264 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) [2020-07-10 20:22:01,872 INFO L264 CegarLoopResult]: At program point L11-3(line 11) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) [2020-07-10 20:22:01,872 INFO L264 CegarLoopResult]: At program point ULTIMATE.initEXIT(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 20:22:01,872 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:22:01,873 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 20:22:01,873 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 20:22:01,873 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:22:01,873 INFO L264 CegarLoopResult]: At program point L25(line 25) 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 20:22:01,873 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 14 29) the Hoare annotation is: true [2020-07-10 20:22:01,873 INFO L264 CegarLoopResult]: At program point L25-1(lines 25 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 20:22:01,874 INFO L264 CegarLoopResult]: At program point L25-2(line 25) 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 20:22:01,874 INFO L271 CegarLoopResult]: At program point L25-3(line 25) the Hoare annotation is: true [2020-07-10 20:22:01,874 INFO L264 CegarLoopResult]: At program point L19(line 19) 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 20:22:01,874 INFO L264 CegarLoopResult]: At program point L19-1(line 19) 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 20:22:01,874 INFO L264 CegarLoopResult]: At program point L17(line 17) 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 20:22:01,875 INFO L264 CegarLoopResult]: At program point L19-2(line 19) 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 20:22:01,875 INFO L264 CegarLoopResult]: At program point L15(line 15) 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 20:22:01,875 INFO L264 CegarLoopResult]: At program point L15-1(line 15) 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 20:22:01,875 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 14 29) the Hoare annotation is: true [2020-07-10 20:22:01,875 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 20:22:01,876 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 20:22:01,876 INFO L271 CegarLoopResult]: At program point L24(lines 24 26) the Hoare annotation is: true [2020-07-10 20:22:01,876 INFO L264 CegarLoopResult]: At program point L22(lines 14 29) the Hoare annotation is: (or (not (= 0 |old(~i~0)|)) (= 0 ~i~0) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|)))) [2020-07-10 20:22:01,876 INFO L264 CegarLoopResult]: At program point L20(line 20) 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 20:22:01,876 INFO L264 CegarLoopResult]: At program point L20-1(line 20) 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 20:22:01,876 INFO L264 CegarLoopResult]: At program point L20-2(line 20) 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 20:22:01,877 INFO L264 CegarLoopResult]: At program point L18-1(lines 18 21) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (= 0 |old(~i~0)|)) (and (= 0 |main_#t~mem1|) (= 0 ~i~0) (= .cse0 (select |#memory_int| |~#x~0.base|))) (not (= .cse0 (select |old(#memory_int)| |~#x~0.base|))))) [2020-07-10 20:22:01,877 INFO L264 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: (or (not (= 0 |old(~i~0)|)) (= 0 ~i~0) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|)))) [2020-07-10 20:22:01,877 INFO L264 CegarLoopResult]: At program point L18-4(line 18) 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 20:22:01,877 INFO L264 CegarLoopResult]: At program point L18-5(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 20:22:01,878 INFO L264 CegarLoopResult]: At program point L18-6(lines 18 21) the Hoare annotation is: (or (not (= 0 |old(~i~0)|)) (= 0 ~i~0) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|)))) [2020-07-10 20:22:01,878 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2020-07-10 20:22:01,878 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 3 8) the Hoare annotation is: true [2020-07-10 20:22:01,878 INFO L271 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: true [2020-07-10 20:22:01,878 INFO L271 CegarLoopResult]: At program point L4(lines 4 6) the Hoare annotation is: true [2020-07-10 20:22:01,878 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) the Hoare annotation is: true [2020-07-10 20:22:01,879 INFO L271 CegarLoopResult]: At program point L4-2(lines 3 8) the Hoare annotation is: true [2020-07-10 20:22:01,901 INFO L163 areAnnotationChecker]: CFG has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 20:22:01,909 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 20:22:01,914 INFO L168 Benchmark]: Toolchain (without parser) took 4007.04 ms. Allocated memory was 137.9 MB in the beginning and 249.0 MB in the end (delta: 111.1 MB). Free memory was 102.2 MB in the beginning and 154.9 MB in the end (delta: -52.7 MB). Peak memory consumption was 58.4 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:01,915 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 137.9 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-10 20:22:01,916 INFO L168 Benchmark]: CACSL2BoogieTranslator took 283.40 ms. Allocated memory is still 137.9 MB. Free memory was 102.0 MB in the beginning and 91.5 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:01,917 INFO L168 Benchmark]: Boogie Preprocessor took 151.76 ms. Allocated memory was 137.9 MB in the beginning and 203.4 MB in the end (delta: 65.5 MB). Free memory was 91.5 MB in the beginning and 180.9 MB in the end (delta: -89.4 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:01,918 INFO L168 Benchmark]: RCFGBuilder took 415.02 ms. Allocated memory is still 203.4 MB. Free memory was 180.9 MB in the beginning and 158.2 MB in the end (delta: 22.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:01,919 INFO L168 Benchmark]: TraceAbstraction took 3150.82 ms. Allocated memory was 203.4 MB in the beginning and 249.0 MB in the end (delta: 45.6 MB). Free memory was 157.5 MB in the beginning and 154.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 48.3 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:01,922 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.24 ms. Allocated memory is still 137.9 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 283.40 ms. Allocated memory is still 137.9 MB. Free memory was 102.0 MB in the beginning and 91.5 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 151.76 ms. Allocated memory was 137.9 MB in the beginning and 203.4 MB in the end (delta: 65.5 MB). Free memory was 91.5 MB in the beginning and 180.9 MB in the end (delta: -89.4 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 415.02 ms. Allocated memory is still 203.4 MB. Free memory was 180.9 MB in the beginning and 158.2 MB in the end (delta: 22.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3150.82 ms. Allocated memory was 203.4 MB in the beginning and 249.0 MB in the end (delta: 45.6 MB). Free memory was 157.5 MB in the beginning and 154.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 48.3 MB. 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...