/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/string-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 17:37:11,570 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 17:37:11,572 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 17:37:11,587 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 17:37:11,587 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 17:37:11,590 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 17:37:11,591 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 17:37:11,596 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 17:37:11,604 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 17:37:11,605 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 17:37:11,608 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 17:37:11,609 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 17:37:11,610 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 17:37:11,612 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 17:37:11,613 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 17:37:11,614 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 17:37:11,616 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 17:37:11,620 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 17:37:11,622 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 17:37:11,629 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 17:37:11,631 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 17:37:11,635 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 17:37:11,636 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 17:37:11,637 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 17:37:11,640 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 17:37:11,640 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 17:37:11,641 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 17:37:11,644 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 17:37:11,645 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 17:37:11,646 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 17:37:11,646 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 17:37:11,647 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 17:37:11,649 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 17:37:11,650 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 17:37:11,654 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 17:37:11,654 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 17:37:11,657 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 17:37:11,657 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 17:37:11,657 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 17:37:11,658 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 17:37:11,660 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 17:37:11,661 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 17:37:11,674 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 17:37:11,674 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 17:37:11,677 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 17:37:11,677 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 17:37:11,677 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 17:37:11,677 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 17:37:11,678 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 17:37:11,678 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 17:37:11,678 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 17:37:11,678 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 17:37:11,679 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 17:37:11,680 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 17:37:11,680 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 17:37:11,680 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 17:37:11,681 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 17:37:11,681 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 17:37:11,681 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 17:37:11,681 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 17:37:11,681 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 17:37:11,682 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 17:37:11,682 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 17:37:11,682 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 17:37:11,682 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-08 17:37:11,980 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 17:37:12,007 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 17:37:12,012 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 17:37:12,014 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 17:37:12,014 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 17:37:12,015 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/string-2.i [2020-07-08 17:37:12,099 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63c7fa886/9726d9737129424f9eba709d446f29d1/FLAGc0d59ffff [2020-07-08 17:37:12,598 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 17:37:12,599 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/string-2.i [2020-07-08 17:37:12,607 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63c7fa886/9726d9737129424f9eba709d446f29d1/FLAGc0d59ffff [2020-07-08 17:37:12,945 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63c7fa886/9726d9737129424f9eba709d446f29d1 [2020-07-08 17:37:12,959 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 17:37:12,963 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 17:37:12,965 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 17:37:12,965 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 17:37:12,969 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 17:37:12,972 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 05:37:12" (1/1) ... [2020-07-08 17:37:12,977 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2690e049 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:12, skipping insertion in model container [2020-07-08 17:37:12,977 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 05:37:12" (1/1) ... [2020-07-08 17:37:12,985 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 17:37:13,011 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 17:37:13,239 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 17:37:13,245 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 17:37:13,280 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 17:37:13,305 INFO L208 MainTranslator]: Completed translation [2020-07-08 17:37:13,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:13 WrapperNode [2020-07-08 17:37:13,306 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 17:37:13,307 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 17:37:13,308 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 17:37:13,308 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 17:37:13,426 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:13" (1/1) ... [2020-07-08 17:37:13,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:13" (1/1) ... [2020-07-08 17:37:13,438 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:13" (1/1) ... [2020-07-08 17:37:13,439 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:13" (1/1) ... [2020-07-08 17:37:13,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:13" (1/1) ... [2020-07-08 17:37:13,466 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:13" (1/1) ... [2020-07-08 17:37:13,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:13" (1/1) ... [2020-07-08 17:37:13,472 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 17:37:13,472 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 17:37:13,473 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 17:37:13,473 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 17:37:13,474 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:13" (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-08 17:37:13,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 17:37:13,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 17:37:13,550 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 17:37:13,550 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 17:37:13,551 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 17:37:13,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 17:37:13,551 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 17:37:13,551 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 17:37:13,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 17:37:13,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-07-08 17:37:13,551 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 17:37:13,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 17:37:13,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 17:37:13,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 17:37:13,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 17:37:13,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 17:37:13,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 17:37:14,278 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 17:37:14,279 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-08 17:37:14,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 05:37:14 BoogieIcfgContainer [2020-07-08 17:37:14,285 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 17:37:14,289 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 17:37:14,289 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 17:37:14,295 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 17:37:14,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 05:37:12" (1/3) ... [2020-07-08 17:37:14,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8a81446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 05:37:14, skipping insertion in model container [2020-07-08 17:37:14,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:13" (2/3) ... [2020-07-08 17:37:14,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8a81446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 05:37:14, skipping insertion in model container [2020-07-08 17:37:14,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 05:37:14" (3/3) ... [2020-07-08 17:37:14,299 INFO L109 eAbstractionObserver]: Analyzing ICFG string-2.i [2020-07-08 17:37:14,310 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 17:37:14,319 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 17:37:14,335 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 17:37:14,360 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 17:37:14,360 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 17:37:14,361 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-08 17:37:14,361 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 17:37:14,361 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 17:37:14,362 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 17:37:14,362 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 17:37:14,362 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 17:37:14,381 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states. [2020-07-08 17:37:14,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-08 17:37:14,393 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:37:14,395 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, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:37:14,395 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:37:14,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:37:14,401 INFO L82 PathProgramCache]: Analyzing trace with hash -768807104, now seen corresponding path program 1 times [2020-07-08 17:37:14,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:37:14,412 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1736100959] [2020-07-08 17:37:14,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:37:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:14,669 INFO L280 TraceCheckUtils]: 0: Hoare triple {115#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {108#true} is VALID [2020-07-08 17:37:14,670 INFO L280 TraceCheckUtils]: 1: Hoare triple {108#true} #valid := #valid[0 := 0]; {108#true} is VALID [2020-07-08 17:37:14,670 INFO L280 TraceCheckUtils]: 2: Hoare triple {108#true} assume 0 < #StackHeapBarrier; {108#true} is VALID [2020-07-08 17:37:14,671 INFO L280 TraceCheckUtils]: 3: Hoare triple {108#true} assume true; {108#true} is VALID [2020-07-08 17:37:14,672 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {108#true} {108#true} #186#return; {108#true} is VALID [2020-07-08 17:37:14,677 INFO L263 TraceCheckUtils]: 0: Hoare triple {108#true} call ULTIMATE.init(); {115#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 17:37:14,678 INFO L280 TraceCheckUtils]: 1: Hoare triple {115#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {108#true} is VALID [2020-07-08 17:37:14,678 INFO L280 TraceCheckUtils]: 2: Hoare triple {108#true} #valid := #valid[0 := 0]; {108#true} is VALID [2020-07-08 17:37:14,679 INFO L280 TraceCheckUtils]: 3: Hoare triple {108#true} assume 0 < #StackHeapBarrier; {108#true} is VALID [2020-07-08 17:37:14,679 INFO L280 TraceCheckUtils]: 4: Hoare triple {108#true} assume true; {108#true} is VALID [2020-07-08 17:37:14,680 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {108#true} {108#true} #186#return; {108#true} is VALID [2020-07-08 17:37:14,680 INFO L263 TraceCheckUtils]: 6: Hoare triple {108#true} call #t~ret14 := main(); {108#true} is VALID [2020-07-08 17:37:14,681 INFO L280 TraceCheckUtils]: 7: Hoare triple {108#true} SUMMARY for call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5); srcloc: mainENTRY {108#true} is VALID [2020-07-08 17:37:14,681 INFO L280 TraceCheckUtils]: 8: Hoare triple {108#true} SUMMARY for call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5); srcloc: L20 {108#true} is VALID [2020-07-08 17:37:14,682 INFO L280 TraceCheckUtils]: 9: Hoare triple {108#true} havoc ~i~0; {108#true} is VALID [2020-07-08 17:37:14,682 INFO L280 TraceCheckUtils]: 10: Hoare triple {108#true} havoc ~j~0; {108#true} is VALID [2020-07-08 17:37:14,682 INFO L280 TraceCheckUtils]: 11: Hoare triple {108#true} havoc ~nc_A~0; {108#true} is VALID [2020-07-08 17:37:14,683 INFO L280 TraceCheckUtils]: 12: Hoare triple {108#true} havoc ~nc_B~0; {108#true} is VALID [2020-07-08 17:37:14,683 INFO L280 TraceCheckUtils]: 13: Hoare triple {108#true} ~found~0 := 0; {108#true} is VALID [2020-07-08 17:37:14,684 INFO L280 TraceCheckUtils]: 14: Hoare triple {108#true} ~i~0 := 0; {108#true} is VALID [2020-07-08 17:37:14,685 INFO L280 TraceCheckUtils]: 15: Hoare triple {108#true} assume !true; {109#false} is VALID [2020-07-08 17:37:14,686 INFO L280 TraceCheckUtils]: 16: Hoare triple {109#false} SUMMARY for call #t~mem2 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); srcloc: L24-7 {109#false} is VALID [2020-07-08 17:37:14,686 INFO L280 TraceCheckUtils]: 17: Hoare triple {109#false} assume !!(0 == #t~mem2); {109#false} is VALID [2020-07-08 17:37:14,687 INFO L280 TraceCheckUtils]: 18: Hoare triple {109#false} havoc #t~mem2; {109#false} is VALID [2020-07-08 17:37:14,687 INFO L280 TraceCheckUtils]: 19: Hoare triple {109#false} ~i~0 := 0; {109#false} is VALID [2020-07-08 17:37:14,688 INFO L280 TraceCheckUtils]: 20: Hoare triple {109#false} assume !true; {109#false} is VALID [2020-07-08 17:37:14,688 INFO L280 TraceCheckUtils]: 21: Hoare triple {109#false} SUMMARY for call #t~mem5 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); srcloc: L28-7 {109#false} is VALID [2020-07-08 17:37:14,688 INFO L280 TraceCheckUtils]: 22: Hoare triple {109#false} assume !!(0 == #t~mem5); {109#false} is VALID [2020-07-08 17:37:14,689 INFO L280 TraceCheckUtils]: 23: Hoare triple {109#false} havoc #t~mem5; {109#false} is VALID [2020-07-08 17:37:14,689 INFO L280 TraceCheckUtils]: 24: Hoare triple {109#false} ~nc_A~0 := 0; {109#false} is VALID [2020-07-08 17:37:14,690 INFO L280 TraceCheckUtils]: 25: Hoare triple {109#false} assume !true; {109#false} is VALID [2020-07-08 17:37:14,690 INFO L280 TraceCheckUtils]: 26: Hoare triple {109#false} ~nc_B~0 := 0; {109#false} is VALID [2020-07-08 17:37:14,690 INFO L280 TraceCheckUtils]: 27: Hoare triple {109#false} assume !true; {109#false} is VALID [2020-07-08 17:37:14,691 INFO L280 TraceCheckUtils]: 28: Hoare triple {109#false} assume !!(~nc_B~0 >= ~nc_A~0); {109#false} is VALID [2020-07-08 17:37:14,691 INFO L280 TraceCheckUtils]: 29: Hoare triple {109#false} ~j~0 := 0; {109#false} is VALID [2020-07-08 17:37:14,692 INFO L280 TraceCheckUtils]: 30: Hoare triple {109#false} ~i~0 := ~j~0; {109#false} is VALID [2020-07-08 17:37:14,692 INFO L280 TraceCheckUtils]: 31: Hoare triple {109#false} assume !true; {109#false} is VALID [2020-07-08 17:37:14,693 INFO L280 TraceCheckUtils]: 32: Hoare triple {109#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {109#false} is VALID [2020-07-08 17:37:14,693 INFO L263 TraceCheckUtils]: 33: Hoare triple {109#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {109#false} is VALID [2020-07-08 17:37:14,693 INFO L280 TraceCheckUtils]: 34: Hoare triple {109#false} ~cond := #in~cond; {109#false} is VALID [2020-07-08 17:37:14,694 INFO L280 TraceCheckUtils]: 35: Hoare triple {109#false} assume 0 == ~cond; {109#false} is VALID [2020-07-08 17:37:14,694 INFO L280 TraceCheckUtils]: 36: Hoare triple {109#false} assume !false; {109#false} is VALID [2020-07-08 17:37:14,699 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-08 17:37:14,700 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:37:14,703 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1736100959] [2020-07-08 17:37:14,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:37:14,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 17:37:14,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060079808] [2020-07-08 17:37:14,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-07-08 17:37:14,719 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:37:14,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 17:37:14,803 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:14,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 17:37:14,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:37:14,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 17:37:14,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 17:37:14,817 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 3 states. [2020-07-08 17:37:15,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:15,576 INFO L93 Difference]: Finished difference Result 188 states and 215 transitions. [2020-07-08 17:37:15,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 17:37:15,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-07-08 17:37:15,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:37:15,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 17:37:15,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 215 transitions. [2020-07-08 17:37:15,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 17:37:15,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 215 transitions. [2020-07-08 17:37:15,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 215 transitions. [2020-07-08 17:37:15,887 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 215 edges. 215 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:15,903 INFO L225 Difference]: With dead ends: 188 [2020-07-08 17:37:15,903 INFO L226 Difference]: Without dead ends: 77 [2020-07-08 17:37:15,909 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-08 17:37:15,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-07-08 17:37:16,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-07-08 17:37:16,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:37:16,001 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 77 states. [2020-07-08 17:37:16,002 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 77 states. [2020-07-08 17:37:16,002 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 77 states. [2020-07-08 17:37:16,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:16,010 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2020-07-08 17:37:16,010 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2020-07-08 17:37:16,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:16,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:16,012 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 77 states. [2020-07-08 17:37:16,013 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 77 states. [2020-07-08 17:37:16,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:16,021 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2020-07-08 17:37:16,021 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2020-07-08 17:37:16,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:16,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:16,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:37:16,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:37:16,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-07-08 17:37:16,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2020-07-08 17:37:16,031 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 37 [2020-07-08 17:37:16,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:37:16,032 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2020-07-08 17:37:16,032 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 17:37:16,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 77 states and 82 transitions. [2020-07-08 17:37:16,143 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:16,143 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2020-07-08 17:37:16,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-08 17:37:16,145 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:37:16,145 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:37:16,146 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 17:37:16,146 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:37:16,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:37:16,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1309055982, now seen corresponding path program 1 times [2020-07-08 17:37:16,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:37:16,148 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1027893168] [2020-07-08 17:37:16,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:37:16,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:16,277 INFO L280 TraceCheckUtils]: 0: Hoare triple {810#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {802#true} is VALID [2020-07-08 17:37:16,278 INFO L280 TraceCheckUtils]: 1: Hoare triple {802#true} #valid := #valid[0 := 0]; {802#true} is VALID [2020-07-08 17:37:16,279 INFO L280 TraceCheckUtils]: 2: Hoare triple {802#true} assume 0 < #StackHeapBarrier; {802#true} is VALID [2020-07-08 17:37:16,279 INFO L280 TraceCheckUtils]: 3: Hoare triple {802#true} assume true; {802#true} is VALID [2020-07-08 17:37:16,280 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {802#true} {802#true} #186#return; {802#true} is VALID [2020-07-08 17:37:16,281 INFO L263 TraceCheckUtils]: 0: Hoare triple {802#true} call ULTIMATE.init(); {810#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 17:37:16,282 INFO L280 TraceCheckUtils]: 1: Hoare triple {810#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {802#true} is VALID [2020-07-08 17:37:16,282 INFO L280 TraceCheckUtils]: 2: Hoare triple {802#true} #valid := #valid[0 := 0]; {802#true} is VALID [2020-07-08 17:37:16,283 INFO L280 TraceCheckUtils]: 3: Hoare triple {802#true} assume 0 < #StackHeapBarrier; {802#true} is VALID [2020-07-08 17:37:16,283 INFO L280 TraceCheckUtils]: 4: Hoare triple {802#true} assume true; {802#true} is VALID [2020-07-08 17:37:16,284 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {802#true} {802#true} #186#return; {802#true} is VALID [2020-07-08 17:37:16,284 INFO L263 TraceCheckUtils]: 6: Hoare triple {802#true} call #t~ret14 := main(); {802#true} is VALID [2020-07-08 17:37:16,286 INFO L280 TraceCheckUtils]: 7: Hoare triple {802#true} SUMMARY for call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5); srcloc: mainENTRY {802#true} is VALID [2020-07-08 17:37:16,286 INFO L280 TraceCheckUtils]: 8: Hoare triple {802#true} SUMMARY for call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5); srcloc: L20 {802#true} is VALID [2020-07-08 17:37:16,287 INFO L280 TraceCheckUtils]: 9: Hoare triple {802#true} havoc ~i~0; {802#true} is VALID [2020-07-08 17:37:16,287 INFO L280 TraceCheckUtils]: 10: Hoare triple {802#true} havoc ~j~0; {802#true} is VALID [2020-07-08 17:37:16,287 INFO L280 TraceCheckUtils]: 11: Hoare triple {802#true} havoc ~nc_A~0; {802#true} is VALID [2020-07-08 17:37:16,288 INFO L280 TraceCheckUtils]: 12: Hoare triple {802#true} havoc ~nc_B~0; {802#true} is VALID [2020-07-08 17:37:16,288 INFO L280 TraceCheckUtils]: 13: Hoare triple {802#true} ~found~0 := 0; {802#true} is VALID [2020-07-08 17:37:16,290 INFO L280 TraceCheckUtils]: 14: Hoare triple {802#true} ~i~0 := 0; {809#(= 0 main_~i~0)} is VALID [2020-07-08 17:37:16,293 INFO L280 TraceCheckUtils]: 15: Hoare triple {809#(= 0 main_~i~0)} assume !(~i~0 < 5); {803#false} is VALID [2020-07-08 17:37:16,293 INFO L280 TraceCheckUtils]: 16: Hoare triple {803#false} SUMMARY for call #t~mem2 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); srcloc: L24-7 {803#false} is VALID [2020-07-08 17:37:16,294 INFO L280 TraceCheckUtils]: 17: Hoare triple {803#false} assume !!(0 == #t~mem2); {803#false} is VALID [2020-07-08 17:37:16,295 INFO L280 TraceCheckUtils]: 18: Hoare triple {803#false} havoc #t~mem2; {803#false} is VALID [2020-07-08 17:37:16,295 INFO L280 TraceCheckUtils]: 19: Hoare triple {803#false} ~i~0 := 0; {803#false} is VALID [2020-07-08 17:37:16,296 INFO L280 TraceCheckUtils]: 20: Hoare triple {803#false} assume !(~i~0 < 5); {803#false} is VALID [2020-07-08 17:37:16,309 INFO L280 TraceCheckUtils]: 21: Hoare triple {803#false} SUMMARY for call #t~mem5 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); srcloc: L28-7 {803#false} is VALID [2020-07-08 17:37:16,310 INFO L280 TraceCheckUtils]: 22: Hoare triple {803#false} assume !!(0 == #t~mem5); {803#false} is VALID [2020-07-08 17:37:16,310 INFO L280 TraceCheckUtils]: 23: Hoare triple {803#false} havoc #t~mem5; {803#false} is VALID [2020-07-08 17:37:16,311 INFO L280 TraceCheckUtils]: 24: Hoare triple {803#false} ~nc_A~0 := 0; {803#false} is VALID [2020-07-08 17:37:16,311 INFO L280 TraceCheckUtils]: 25: Hoare triple {803#false} SUMMARY for call #t~mem6 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); srcloc: L33-5 {803#false} is VALID [2020-07-08 17:37:16,312 INFO L280 TraceCheckUtils]: 26: Hoare triple {803#false} assume !(0 != #t~mem6); {803#false} is VALID [2020-07-08 17:37:16,312 INFO L280 TraceCheckUtils]: 27: Hoare triple {803#false} havoc #t~mem6; {803#false} is VALID [2020-07-08 17:37:16,317 INFO L280 TraceCheckUtils]: 28: Hoare triple {803#false} ~nc_B~0 := 0; {803#false} is VALID [2020-07-08 17:37:16,317 INFO L280 TraceCheckUtils]: 29: Hoare triple {803#false} SUMMARY for call #t~mem8 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); srcloc: L37-5 {803#false} is VALID [2020-07-08 17:37:16,317 INFO L280 TraceCheckUtils]: 30: Hoare triple {803#false} assume !(0 != #t~mem8); {803#false} is VALID [2020-07-08 17:37:16,318 INFO L280 TraceCheckUtils]: 31: Hoare triple {803#false} havoc #t~mem8; {803#false} is VALID [2020-07-08 17:37:16,318 INFO L280 TraceCheckUtils]: 32: Hoare triple {803#false} assume !!(~nc_B~0 >= ~nc_A~0); {803#false} is VALID [2020-07-08 17:37:16,318 INFO L280 TraceCheckUtils]: 33: Hoare triple {803#false} ~j~0 := 0; {803#false} is VALID [2020-07-08 17:37:16,318 INFO L280 TraceCheckUtils]: 34: Hoare triple {803#false} ~i~0 := ~j~0; {803#false} is VALID [2020-07-08 17:37:16,319 INFO L280 TraceCheckUtils]: 35: Hoare triple {803#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {803#false} is VALID [2020-07-08 17:37:16,319 INFO L280 TraceCheckUtils]: 36: Hoare triple {803#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {803#false} is VALID [2020-07-08 17:37:16,319 INFO L263 TraceCheckUtils]: 37: Hoare triple {803#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {803#false} is VALID [2020-07-08 17:37:16,319 INFO L280 TraceCheckUtils]: 38: Hoare triple {803#false} ~cond := #in~cond; {803#false} is VALID [2020-07-08 17:37:16,320 INFO L280 TraceCheckUtils]: 39: Hoare triple {803#false} assume 0 == ~cond; {803#false} is VALID [2020-07-08 17:37:16,320 INFO L280 TraceCheckUtils]: 40: Hoare triple {803#false} assume !false; {803#false} is VALID [2020-07-08 17:37:16,322 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-08 17:37:16,322 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:37:16,322 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1027893168] [2020-07-08 17:37:16,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:37:16,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 17:37:16,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738359337] [2020-07-08 17:37:16,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2020-07-08 17:37:16,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:37:16,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 17:37:16,373 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:16,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 17:37:16,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:37:16,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 17:37:16,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 17:37:16,375 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 4 states. [2020-07-08 17:37:16,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:16,844 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2020-07-08 17:37:16,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 17:37:16,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2020-07-08 17:37:16,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:37:16,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 17:37:16,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2020-07-08 17:37:16,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 17:37:16,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2020-07-08 17:37:16,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 155 transitions. [2020-07-08 17:37:17,028 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:17,033 INFO L225 Difference]: With dead ends: 144 [2020-07-08 17:37:17,033 INFO L226 Difference]: Without dead ends: 89 [2020-07-08 17:37:17,035 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 17:37:17,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-07-08 17:37:17,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2020-07-08 17:37:17,086 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:37:17,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 79 states. [2020-07-08 17:37:17,086 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 79 states. [2020-07-08 17:37:17,087 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 79 states. [2020-07-08 17:37:17,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:17,092 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2020-07-08 17:37:17,092 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2020-07-08 17:37:17,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:17,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:17,093 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 89 states. [2020-07-08 17:37:17,094 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 89 states. [2020-07-08 17:37:17,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:17,098 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2020-07-08 17:37:17,099 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2020-07-08 17:37:17,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:17,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:17,100 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:37:17,100 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:37:17,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-07-08 17:37:17,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2020-07-08 17:37:17,104 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 41 [2020-07-08 17:37:17,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:37:17,104 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2020-07-08 17:37:17,105 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 17:37:17,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 79 states and 84 transitions. [2020-07-08 17:37:17,186 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:17,186 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2020-07-08 17:37:17,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-08 17:37:17,188 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:37:17,188 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, 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-08 17:37:17,188 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 17:37:17,189 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:37:17,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:37:17,189 INFO L82 PathProgramCache]: Analyzing trace with hash 512896601, now seen corresponding path program 1 times [2020-07-08 17:37:17,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:37:17,190 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1382066442] [2020-07-08 17:37:17,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:37:17,235 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 17:37:17,235 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:277) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) 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-08 17:37:17,242 INFO L168 Benchmark]: Toolchain (without parser) took 4278.63 ms. Allocated memory was 144.7 MB in the beginning and 249.0 MB in the end (delta: 104.3 MB). Free memory was 102.1 MB in the beginning and 220.3 MB in the end (delta: -118.1 MB). Peak memory consumption was 112.4 MB. Max. memory is 7.1 GB. [2020-07-08 17:37:17,243 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 144.7 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 17:37:17,244 INFO L168 Benchmark]: CACSL2BoogieTranslator took 341.62 ms. Allocated memory is still 144.7 MB. Free memory was 101.9 MB in the beginning and 90.5 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. [2020-07-08 17:37:17,245 INFO L168 Benchmark]: Boogie Preprocessor took 164.42 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 90.5 MB in the beginning and 179.8 MB in the end (delta: -89.2 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-08 17:37:17,246 INFO L168 Benchmark]: RCFGBuilder took 813.08 ms. Allocated memory is still 202.4 MB. Free memory was 179.8 MB in the beginning and 139.8 MB in the end (delta: 40.0 MB). Peak memory consumption was 40.0 MB. Max. memory is 7.1 GB. [2020-07-08 17:37:17,247 INFO L168 Benchmark]: TraceAbstraction took 2950.09 ms. Allocated memory was 202.4 MB in the beginning and 249.0 MB in the end (delta: 46.7 MB). Free memory was 139.1 MB in the beginning and 220.3 MB in the end (delta: -81.2 MB). Peak memory consumption was 91.6 MB. Max. memory is 7.1 GB. [2020-07-08 17:37:17,251 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.28 ms. Allocated memory is still 144.7 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 341.62 ms. Allocated memory is still 144.7 MB. Free memory was 101.9 MB in the beginning and 90.5 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 164.42 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 90.5 MB in the beginning and 179.8 MB in the end (delta: -89.2 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 813.08 ms. Allocated memory is still 202.4 MB. Free memory was 179.8 MB in the beginning and 139.8 MB in the end (delta: 40.0 MB). Peak memory consumption was 40.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2950.09 ms. Allocated memory was 202.4 MB in the beginning and 249.0 MB in the end (delta: 46.7 MB). Free memory was 139.1 MB in the beginning and 220.3 MB in the end (delta: -81.2 MB). Peak memory consumption was 91.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...