/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-267fbe0 [2020-07-17 22:50:21,227 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:50:21,230 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:50:21,245 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:50:21,245 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:50:21,246 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:50:21,247 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:50:21,249 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:50:21,251 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:50:21,252 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:50:21,253 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:50:21,254 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:50:21,254 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:50:21,255 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:50:21,256 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:50:21,257 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:50:21,258 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:50:21,259 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:50:21,261 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:50:21,263 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:50:21,265 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:50:21,267 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:50:21,270 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:50:21,271 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:50:21,274 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:50:21,275 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:50:21,280 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:50:21,283 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:50:21,283 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:50:21,284 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:50:21,287 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:50:21,288 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:50:21,289 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:50:21,290 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:50:21,294 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:50:21,295 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:50:21,296 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:50:21,296 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:50:21,296 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:50:21,297 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:50:21,298 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:50:21,302 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-17 22:50:21,325 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:50:21,326 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:50:21,328 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:50:21,328 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:50:21,328 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:50:21,328 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:50:21,329 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:50:21,329 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:50:21,329 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:50:21,329 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:50:21,329 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:50:21,329 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:50:21,330 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:50:21,330 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:50:21,330 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:50:21,330 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:50:21,330 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:50:21,331 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:50:21,331 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:50:21,331 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:50:21,331 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:50:21,332 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:50:21,332 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:50:21,332 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:50:21,332 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:50:21,332 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:50:21,333 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:50:21,333 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:50:21,333 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:50:21,333 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:50:21,591 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:50:21,602 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:50:21,605 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:50:21,606 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:50:21,607 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:50:21,607 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/nec40.c [2020-07-17 22:50:21,682 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcee9a813/1b567b826285430295527c624c37bc86/FLAGd90199a6f [2020-07-17 22:50:22,198 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:50:22,199 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/nec40.c [2020-07-17 22:50:22,206 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcee9a813/1b567b826285430295527c624c37bc86/FLAGd90199a6f [2020-07-17 22:50:22,567 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcee9a813/1b567b826285430295527c624c37bc86 [2020-07-17 22:50:22,575 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:50:22,579 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:50:22,580 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:50:22,580 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:50:22,583 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:50:22,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:50:22" (1/1) ... [2020-07-17 22:50:22,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ca0f12e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:22, skipping insertion in model container [2020-07-17 22:50:22,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:50:22" (1/1) ... [2020-07-17 22:50:22,596 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:50:22,613 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:50:22,798 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:50:22,809 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:50:22,830 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:50:22,939 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:50:22,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:22 WrapperNode [2020-07-17 22:50:22,940 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:50:22,941 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:50:22,941 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:50:22,941 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:50:22,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:22" (1/1) ... [2020-07-17 22:50:22,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:22" (1/1) ... [2020-07-17 22:50:22,962 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:22" (1/1) ... [2020-07-17 22:50:22,963 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:22" (1/1) ... [2020-07-17 22:50:22,972 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:22" (1/1) ... [2020-07-17 22:50:22,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:22" (1/1) ... [2020-07-17 22:50:22,979 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:22" (1/1) ... [2020-07-17 22:50:22,982 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:50:22,982 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:50:22,982 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:50:22,982 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:50:22,983 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:22" (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-17 22:50:23,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:50:23,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:50:23,045 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:50:23,045 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:50:23,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:50:23,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:50:23,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:50:23,046 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:50:23,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:50:23,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:50:23,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:50:23,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-17 22:50:23,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:50:23,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:50:23,326 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:50:23,327 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-17 22:50:23,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:50:23 BoogieIcfgContainer [2020-07-17 22:50:23,330 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:50:23,332 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:50:23,332 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:50:23,335 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:50:23,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:50:22" (1/3) ... [2020-07-17 22:50:23,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c67ee3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:50:23, skipping insertion in model container [2020-07-17 22:50:23,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:22" (2/3) ... [2020-07-17 22:50:23,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c67ee3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:50:23, skipping insertion in model container [2020-07-17 22:50:23,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:50:23" (3/3) ... [2020-07-17 22:50:23,338 INFO L109 eAbstractionObserver]: Analyzing ICFG nec40.c [2020-07-17 22:50:23,354 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:50:23,364 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:50:23,380 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:50:23,407 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:50:23,407 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:50:23,407 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:50:23,407 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:50:23,408 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:50:23,408 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:50:23,408 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:50:23,408 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:50:23,426 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-07-17 22:50:23,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-17 22:50:23,433 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:23,434 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:23,434 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:23,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:23,441 INFO L82 PathProgramCache]: Analyzing trace with hash -91485938, now seen corresponding path program 1 times [2020-07-17 22:50:23,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:23,451 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555053806] [2020-07-17 22:50:23,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:23,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:23,746 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-17 22:50:23,746 INFO L280 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2020-07-17 22:50:23,747 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #47#return; {26#true} is VALID [2020-07-17 22:50:23,753 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-17 22:50:23,753 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-17 22:50:23,754 INFO L280 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2020-07-17 22:50:23,754 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #47#return; {26#true} is VALID [2020-07-17 22:50:23,755 INFO L263 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret5 := main(); {26#true} is VALID [2020-07-17 22:50:23,755 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-17 22:50:23,757 INFO L280 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID [2020-07-17 22:50:23,757 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-17 22:50:23,758 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-17 22:50:23,758 INFO L280 TraceCheckUtils]: 9: Hoare triple {27#false} assume 0 != #t~mem4;havoc #t~mem4; {27#false} is VALID [2020-07-17 22:50:23,759 INFO L263 TraceCheckUtils]: 10: Hoare triple {27#false} call __VERIFIER_assert(0); {27#false} is VALID [2020-07-17 22:50:23,759 INFO L280 TraceCheckUtils]: 11: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2020-07-17 22:50:23,759 INFO L280 TraceCheckUtils]: 12: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2020-07-17 22:50:23,760 INFO L280 TraceCheckUtils]: 13: Hoare triple {27#false} assume !false; {27#false} is VALID [2020-07-17 22:50:23,763 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-17 22:50:23,764 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555053806] [2020-07-17 22:50:23,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:23,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:50:23,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735193380] [2020-07-17 22:50:23,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-07-17 22:50:23,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:23,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:50:23,816 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-17 22:50:23,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:50:23,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:23,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:50:23,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:50:23,829 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2020-07-17 22:50:24,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:24,017 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2020-07-17 22:50:24,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:50:24,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-07-17 22:50:24,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:24,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:50:24,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2020-07-17 22:50:24,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:50:24,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2020-07-17 22:50:24,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2020-07-17 22:50:24,119 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-17 22:50:24,130 INFO L225 Difference]: With dead ends: 38 [2020-07-17 22:50:24,131 INFO L226 Difference]: Without dead ends: 16 [2020-07-17 22:50:24,134 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-17 22:50:24,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-17 22:50:24,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-17 22:50:24,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:24,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2020-07-17 22:50:24,203 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-17 22:50:24,203 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-17 22:50:24,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:24,218 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-17 22:50:24,219 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-17 22:50:24,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:24,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:24,220 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-17 22:50:24,220 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-17 22:50:24,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:24,223 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-17 22:50:24,223 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-17 22:50:24,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:24,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:24,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:24,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:24,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-17 22:50:24,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2020-07-17 22:50:24,228 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2020-07-17 22:50:24,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:24,228 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2020-07-17 22:50:24,229 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:50:24,229 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-17 22:50:24,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-17 22:50:24,230 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:24,230 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:24,230 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:50:24,231 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:24,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:24,231 INFO L82 PathProgramCache]: Analyzing trace with hash 883179888, now seen corresponding path program 1 times [2020-07-17 22:50:24,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:24,232 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759491081] [2020-07-17 22:50:24,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:24,369 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-17 22:50:24,370 INFO L280 TraceCheckUtils]: 1: Hoare triple {136#true} assume true; {136#true} is VALID [2020-07-17 22:50:24,370 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {136#true} {136#true} #47#return; {136#true} is VALID [2020-07-17 22:50:24,373 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-17 22:50:24,373 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-17 22:50:24,374 INFO L280 TraceCheckUtils]: 2: Hoare triple {136#true} assume true; {136#true} is VALID [2020-07-17 22:50:24,374 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {136#true} {136#true} #47#return; {136#true} is VALID [2020-07-17 22:50:24,374 INFO L263 TraceCheckUtils]: 4: Hoare triple {136#true} call #t~ret5 := main(); {136#true} is VALID [2020-07-17 22:50:24,376 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-17 22:50:24,377 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-17 22:50:24,378 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-17 22:50:24,379 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-17 22:50:24,380 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-17 22:50:24,380 INFO L280 TraceCheckUtils]: 10: Hoare triple {137#false} assume 0 != #t~mem4;havoc #t~mem4; {137#false} is VALID [2020-07-17 22:50:24,381 INFO L263 TraceCheckUtils]: 11: Hoare triple {137#false} call __VERIFIER_assert(0); {137#false} is VALID [2020-07-17 22:50:24,381 INFO L280 TraceCheckUtils]: 12: Hoare triple {137#false} ~cond := #in~cond; {137#false} is VALID [2020-07-17 22:50:24,381 INFO L280 TraceCheckUtils]: 13: Hoare triple {137#false} assume 0 == ~cond; {137#false} is VALID [2020-07-17 22:50:24,382 INFO L280 TraceCheckUtils]: 14: Hoare triple {137#false} assume !false; {137#false} is VALID [2020-07-17 22:50:24,383 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-17 22:50:24,383 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759491081] [2020-07-17 22:50:24,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:24,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:50:24,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236274827] [2020-07-17 22:50:24,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-07-17 22:50:24,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:24,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:50:24,410 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-17 22:50:24,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:50:24,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:24,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:50:24,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:50:24,411 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 4 states. [2020-07-17 22:50:24,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:24,623 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2020-07-17 22:50:24,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:50:24,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-07-17 22:50:24,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:24,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:50:24,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2020-07-17 22:50:24,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:50:24,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2020-07-17 22:50:24,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2020-07-17 22:50:24,682 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-17 22:50:24,684 INFO L225 Difference]: With dead ends: 26 [2020-07-17 22:50:24,684 INFO L226 Difference]: Without dead ends: 18 [2020-07-17 22:50:24,685 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-17 22:50:24,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-17 22:50:24,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-17 22:50:24,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:24,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2020-07-17 22:50:24,723 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-17 22:50:24,723 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-17 22:50:24,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:24,726 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-17 22:50:24,726 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-07-17 22:50:24,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:24,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:24,727 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-17 22:50:24,727 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-17 22:50:24,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:24,729 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-17 22:50:24,729 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-07-17 22:50:24,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:24,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:24,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:24,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:24,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-17 22:50:24,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2020-07-17 22:50:24,732 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2020-07-17 22:50:24,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:24,733 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2020-07-17 22:50:24,733 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:50:24,733 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-07-17 22:50:24,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-17 22:50:24,734 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:24,734 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:24,734 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:50:24,734 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:24,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:24,735 INFO L82 PathProgramCache]: Analyzing trace with hash 975532875, now seen corresponding path program 1 times [2020-07-17 22:50:24,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:24,736 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297220852] [2020-07-17 22:50:24,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:24,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:24,896 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-17 22:50:24,897 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-17 22:50:24,898 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-17 22:50:24,901 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-17 22:50:24,903 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-17 22:50:24,904 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-17 22:50:24,905 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-17 22:50:24,906 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-17 22:50:24,907 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-17 22:50:24,908 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-17 22:50:24,909 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-17 22:50:24,910 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-17 22:50:24,910 INFO L280 TraceCheckUtils]: 9: Hoare triple {246#false} assume !(0 != #t~mem1);havoc #t~mem1; {246#false} is VALID [2020-07-17 22:50:24,910 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-17 22:50:24,911 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-17 22:50:24,911 INFO L280 TraceCheckUtils]: 12: Hoare triple {246#false} assume 0 != #t~mem4;havoc #t~mem4; {246#false} is VALID [2020-07-17 22:50:24,911 INFO L263 TraceCheckUtils]: 13: Hoare triple {246#false} call __VERIFIER_assert(0); {246#false} is VALID [2020-07-17 22:50:24,912 INFO L280 TraceCheckUtils]: 14: Hoare triple {246#false} ~cond := #in~cond; {246#false} is VALID [2020-07-17 22:50:24,912 INFO L280 TraceCheckUtils]: 15: Hoare triple {246#false} assume 0 == ~cond; {246#false} is VALID [2020-07-17 22:50:24,912 INFO L280 TraceCheckUtils]: 16: Hoare triple {246#false} assume !false; {246#false} is VALID [2020-07-17 22:50:24,913 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-17 22:50:24,914 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297220852] [2020-07-17 22:50:24,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:24,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:50:24,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595520057] [2020-07-17 22:50:24,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-17 22:50:24,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:24,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:50:24,943 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-17 22:50:24,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:50:24,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:24,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:50:24,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:50:24,944 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 5 states. [2020-07-17 22:50:25,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:25,079 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-17 22:50:25,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:50:25,080 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-17 22:50:25,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:25,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:50:25,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2020-07-17 22:50:25,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:50:25,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2020-07-17 22:50:25,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 18 transitions. [2020-07-17 22:50:25,112 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-17 22:50:25,112 INFO L225 Difference]: With dead ends: 18 [2020-07-17 22:50:25,112 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:50:25,113 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-17 22:50:25,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:50:25,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:50:25,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:25,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:50:25,114 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:50:25,114 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:50:25,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:25,115 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:50:25,115 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:50:25,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:25,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:25,116 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:50:25,116 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:50:25,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:25,117 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:50:25,117 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:50:25,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:25,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:25,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:25,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:25,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:50:25,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:50:25,118 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2020-07-17 22:50:25,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:25,119 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:50:25,119 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:50:25,119 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:50:25,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:25,119 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:50:25,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:50:25,292 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:50:25,293 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-17 22:50:25,293 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:50:25,294 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:50:25,294 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-17 22:50:25,294 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:50:25,294 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:50:25,294 INFO L268 CegarLoopResult]: For program point L25(lines 25 26) no Hoare annotation was computed. [2020-07-17 22:50:25,294 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 14 29) no Hoare annotation was computed. [2020-07-17 22:50:25,294 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 14 29) no Hoare annotation was computed. [2020-07-17 22:50:25,295 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-17 22:50:25,295 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-17 22:50:25,295 INFO L268 CegarLoopResult]: For program point L24(lines 24 26) no Hoare annotation was computed. [2020-07-17 22:50:25,295 INFO L268 CegarLoopResult]: For program point L24-1(lines 24 26) no Hoare annotation was computed. [2020-07-17 22:50:25,296 INFO L268 CegarLoopResult]: For program point L18-1(lines 18 21) no Hoare annotation was computed. [2020-07-17 22:50:25,296 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-17 22:50:25,297 INFO L268 CegarLoopResult]: For program point L18-4(lines 18 21) no Hoare annotation was computed. [2020-07-17 22:50:25,297 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2020-07-17 22:50:25,297 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2020-07-17 22:50:25,297 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-17 22:50:25,297 INFO L268 CegarLoopResult]: For program point L4(lines 4 6) no Hoare annotation was computed. [2020-07-17 22:50:25,297 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2020-07-17 22:50:25,298 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2020-07-17 22:50:25,302 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:50:25,309 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:50:25,309 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:50:25,309 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:50:25,310 WARN L170 areAnnotationChecker]: L18-4 has no Hoare annotation [2020-07-17 22:50:25,310 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2020-07-17 22:50:25,311 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:50:25,311 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:50:25,311 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:50:25,311 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:50:25,311 WARN L170 areAnnotationChecker]: L18-4 has no Hoare annotation [2020-07-17 22:50:25,311 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2020-07-17 22:50:25,311 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2020-07-17 22:50:25,312 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:50:25,312 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:50:25,312 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-17 22:50:25,312 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-17 22:50:25,312 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-17 22:50:25,312 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:50:25,312 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-17 22:50:25,313 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-17 22:50:25,313 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2020-07-17 22:50:25,313 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2020-07-17 22:50:25,313 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:50:25,313 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:50:25,313 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-17 22:50:25,321 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-17 22:50:25,328 INFO L168 Benchmark]: Toolchain (without parser) took 2749.00 ms. Allocated memory was 146.3 MB in the beginning and 245.4 MB in the end (delta: 99.1 MB). Free memory was 102.9 MB in the beginning and 199.5 MB in the end (delta: -96.6 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:25,329 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-17 22:50:25,332 INFO L168 Benchmark]: CACSL2BoogieTranslator took 360.55 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 102.5 MB in the beginning and 183.1 MB in the end (delta: -80.6 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:25,334 INFO L168 Benchmark]: Boogie Preprocessor took 41.26 ms. Allocated memory is still 203.9 MB. Free memory was 183.1 MB in the beginning and 180.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:25,336 INFO L168 Benchmark]: RCFGBuilder took 348.54 ms. Allocated memory is still 203.9 MB. Free memory was 180.9 MB in the beginning and 160.9 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:25,344 INFO L168 Benchmark]: TraceAbstraction took 1991.51 ms. Allocated memory was 203.9 MB in the beginning and 245.4 MB in the end (delta: 41.4 MB). Free memory was 160.3 MB in the beginning and 201.2 MB in the end (delta: -40.9 MB). Peak memory consumption was 519.3 kB. Max. memory is 7.1 GB. [2020-07-17 22:50:25,353 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.23 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 360.55 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 102.5 MB in the beginning and 183.1 MB in the end (delta: -80.6 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.26 ms. Allocated memory is still 203.9 MB. Free memory was 183.1 MB in the beginning and 180.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 348.54 ms. Allocated memory is still 203.9 MB. Free memory was 180.9 MB in the beginning and 160.9 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1991.51 ms. Allocated memory was 203.9 MB in the beginning and 245.4 MB in the end (delta: 41.4 MB). Free memory was 160.3 MB in the beginning and 201.2 MB in the end (delta: -40.9 MB). Peak memory consumption was 519.3 kB. 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...