/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/loop-acceleration/array_3-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:22:31,340 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:22:31,343 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:22:31,364 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:22:31,364 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:22:31,367 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:22:31,369 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:22:31,380 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:22:31,384 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:22:31,386 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:22:31,387 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:22:31,390 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:22:31,391 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:22:31,393 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:22:31,395 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:22:31,397 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:22:31,397 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:22:31,398 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:22:31,400 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:22:31,402 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:22:31,404 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:22:31,406 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:22:31,407 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:22:31,407 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:22:31,410 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:22:31,410 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:22:31,410 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:22:31,411 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:22:31,412 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:22:31,413 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:22:31,413 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:22:31,414 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:22:31,415 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:22:31,416 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:22:31,418 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:22:31,418 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:22:31,419 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:22:31,419 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:22:31,419 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:22:31,420 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:22:31,421 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:22:31,422 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 20:22:31,432 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:22:31,433 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:22:31,434 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:22:31,435 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:22:31,435 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:22:31,435 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:22:31,435 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:22:31,435 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:22:31,436 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:22:31,436 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:22:31,436 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:22:31,436 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:22:31,436 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:22:31,437 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:22:31,437 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:22:31,437 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:22:31,437 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:22:31,437 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:22:31,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:22:31,438 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:22:31,438 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:22:31,438 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:22:31,439 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:22:31,739 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:22:31,755 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:22:31,759 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:22:31,761 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:22:31,762 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:22:31,763 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_3-1.i [2020-07-10 20:22:31,857 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26a289ba2/e14ce457e434431f86ceff0ea685d557/FLAG688b11ca0 [2020-07-10 20:22:32,406 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:22:32,407 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_3-1.i [2020-07-10 20:22:32,413 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26a289ba2/e14ce457e434431f86ceff0ea685d557/FLAG688b11ca0 [2020-07-10 20:22:32,753 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26a289ba2/e14ce457e434431f86ceff0ea685d557 [2020-07-10 20:22:32,768 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:22:32,773 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:22:32,774 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:22:32,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:22:32,778 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:22:32,780 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:22:32" (1/1) ... [2020-07-10 20:22:32,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7822e28f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:32, skipping insertion in model container [2020-07-10 20:22:32,783 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:22:32" (1/1) ... [2020-07-10 20:22:32,792 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:22:32,815 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:22:33,055 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:22:33,064 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:22:33,088 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:22:33,109 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:22:33,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:33 WrapperNode [2020-07-10 20:22:33,110 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:22:33,110 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:22:33,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:22:33,111 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:22:33,212 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:33" (1/1) ... [2020-07-10 20:22:33,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:33" (1/1) ... [2020-07-10 20:22:33,223 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:33" (1/1) ... [2020-07-10 20:22:33,224 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:33" (1/1) ... [2020-07-10 20:22:33,233 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:33" (1/1) ... [2020-07-10 20:22:33,240 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:33" (1/1) ... [2020-07-10 20:22:33,241 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:33" (1/1) ... [2020-07-10 20:22:33,244 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:22:33,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:22:33,245 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:22:33,245 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:22:33,246 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:22:33,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:22:33,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:22:33,314 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:22:33,315 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:22:33,315 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:22:33,315 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:22:33,315 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:22:33,315 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:22:33,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 20:22:33,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 20:22:33,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 20:22:33,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 20:22:33,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:22:33,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:22:33,710 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:22:33,710 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-10 20:22:33,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:22:33 BoogieIcfgContainer [2020-07-10 20:22:33,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:22:33,717 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:22:33,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:22:33,720 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:22:33,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:22:32" (1/3) ... [2020-07-10 20:22:33,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5abc9966 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:22:33, skipping insertion in model container [2020-07-10 20:22:33,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:33" (2/3) ... [2020-07-10 20:22:33,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5abc9966 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:22:33, skipping insertion in model container [2020-07-10 20:22:33,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:22:33" (3/3) ... [2020-07-10 20:22:33,725 INFO L109 eAbstractionObserver]: Analyzing ICFG array_3-1.i [2020-07-10 20:22:33,738 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:22:33,748 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:22:33,764 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:22:33,789 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:22:33,789 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:22:33,789 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:22:33,790 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:22:33,790 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:22:33,790 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:22:33,790 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:22:33,791 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:22:33,809 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2020-07-10 20:22:33,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-10 20:22:33,820 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:33,821 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:22:33,821 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:33,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:33,827 INFO L82 PathProgramCache]: Analyzing trace with hash -2145994368, now seen corresponding path program 1 times [2020-07-10 20:22:33,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:33,835 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2026537043] [2020-07-10 20:22:33,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:34,064 INFO L280 TraceCheckUtils]: 0: Hoare triple {49#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {42#true} is VALID [2020-07-10 20:22:34,065 INFO L280 TraceCheckUtils]: 1: Hoare triple {42#true} #valid := #valid[0 := 0]; {42#true} is VALID [2020-07-10 20:22:34,065 INFO L280 TraceCheckUtils]: 2: Hoare triple {42#true} assume 0 < #StackHeapBarrier; {42#true} is VALID [2020-07-10 20:22:34,066 INFO L280 TraceCheckUtils]: 3: Hoare triple {42#true} assume true; {42#true} is VALID [2020-07-10 20:22:34,070 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {42#true} {42#true} #68#return; {42#true} is VALID [2020-07-10 20:22:34,074 INFO L263 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {49#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 20:22:34,075 INFO L280 TraceCheckUtils]: 1: Hoare triple {49#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {42#true} is VALID [2020-07-10 20:22:34,076 INFO L280 TraceCheckUtils]: 2: Hoare triple {42#true} #valid := #valid[0 := 0]; {42#true} is VALID [2020-07-10 20:22:34,076 INFO L280 TraceCheckUtils]: 3: Hoare triple {42#true} assume 0 < #StackHeapBarrier; {42#true} is VALID [2020-07-10 20:22:34,077 INFO L280 TraceCheckUtils]: 4: Hoare triple {42#true} assume true; {42#true} is VALID [2020-07-10 20:22:34,077 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {42#true} {42#true} #68#return; {42#true} is VALID [2020-07-10 20:22:34,078 INFO L263 TraceCheckUtils]: 6: Hoare triple {42#true} call #t~ret4 := main(); {42#true} is VALID [2020-07-10 20:22:34,078 INFO L280 TraceCheckUtils]: 7: Hoare triple {42#true} SUMMARY for call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096); srcloc: mainENTRY {42#true} is VALID [2020-07-10 20:22:34,078 INFO L280 TraceCheckUtils]: 8: Hoare triple {42#true} havoc ~i~0; {42#true} is VALID [2020-07-10 20:22:34,079 INFO L280 TraceCheckUtils]: 9: Hoare triple {42#true} ~i~0 := 0; {42#true} is VALID [2020-07-10 20:22:34,080 INFO L280 TraceCheckUtils]: 10: Hoare triple {42#true} assume !true; {43#false} is VALID [2020-07-10 20:22:34,081 INFO L280 TraceCheckUtils]: 11: Hoare triple {43#false} ~i~0 := 0; {43#false} is VALID [2020-07-10 20:22:34,082 INFO L280 TraceCheckUtils]: 12: Hoare triple {43#false} assume !true; {43#false} is VALID [2020-07-10 20:22:34,082 INFO L263 TraceCheckUtils]: 13: Hoare triple {43#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {43#false} is VALID [2020-07-10 20:22:34,082 INFO L280 TraceCheckUtils]: 14: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2020-07-10 20:22:34,083 INFO L280 TraceCheckUtils]: 15: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2020-07-10 20:22:34,083 INFO L280 TraceCheckUtils]: 16: Hoare triple {43#false} assume !false; {43#false} is VALID [2020-07-10 20:22:34,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:22:34,086 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:34,089 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2026537043] [2020-07-10 20:22:34,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:34,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 20:22:34,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122895225] [2020-07-10 20:22:34,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-10 20:22:34,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:34,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 20:22:34,155 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:34,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 20:22:34,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:34,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 20:22:34,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:22:34,171 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. [2020-07-10 20:22:34,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:34,470 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2020-07-10 20:22:34,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 20:22:34,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-10 20:22:34,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:34,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:22:34,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2020-07-10 20:22:34,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:22:34,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2020-07-10 20:22:34,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2020-07-10 20:22:34,600 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:34,613 INFO L225 Difference]: With dead ends: 61 [2020-07-10 20:22:34,614 INFO L226 Difference]: Without dead ends: 31 [2020-07-10 20:22:34,619 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:22:34,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-10 20:22:34,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-10 20:22:34,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:34,704 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2020-07-10 20:22:34,705 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-10 20:22:34,706 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-10 20:22:34,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:34,711 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-10 20:22:34,712 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-10 20:22:34,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:34,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:34,713 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-10 20:22:34,713 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-10 20:22:34,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:34,719 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-10 20:22:34,719 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-10 20:22:34,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:34,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:34,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:34,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:34,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-10 20:22:34,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2020-07-10 20:22:34,741 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 17 [2020-07-10 20:22:34,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:34,741 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2020-07-10 20:22:34,741 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 20:22:34,742 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 33 transitions. [2020-07-10 20:22:34,793 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:34,793 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-10 20:22:34,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-10 20:22:34,794 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:34,795 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:22:34,795 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:22:34,795 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:34,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:34,796 INFO L82 PathProgramCache]: Analyzing trace with hash 2141881988, now seen corresponding path program 1 times [2020-07-10 20:22:34,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:34,797 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2120464784] [2020-07-10 20:22:34,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:34,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:34,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:34,900 INFO L280 TraceCheckUtils]: 0: Hoare triple {306#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {298#true} is VALID [2020-07-10 20:22:34,901 INFO L280 TraceCheckUtils]: 1: Hoare triple {298#true} #valid := #valid[0 := 0]; {298#true} is VALID [2020-07-10 20:22:34,901 INFO L280 TraceCheckUtils]: 2: Hoare triple {298#true} assume 0 < #StackHeapBarrier; {298#true} is VALID [2020-07-10 20:22:34,902 INFO L280 TraceCheckUtils]: 3: Hoare triple {298#true} assume true; {298#true} is VALID [2020-07-10 20:22:34,902 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {298#true} {298#true} #68#return; {298#true} is VALID [2020-07-10 20:22:34,904 INFO L263 TraceCheckUtils]: 0: Hoare triple {298#true} call ULTIMATE.init(); {306#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 20:22:34,904 INFO L280 TraceCheckUtils]: 1: Hoare triple {306#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {298#true} is VALID [2020-07-10 20:22:34,904 INFO L280 TraceCheckUtils]: 2: Hoare triple {298#true} #valid := #valid[0 := 0]; {298#true} is VALID [2020-07-10 20:22:34,905 INFO L280 TraceCheckUtils]: 3: Hoare triple {298#true} assume 0 < #StackHeapBarrier; {298#true} is VALID [2020-07-10 20:22:34,905 INFO L280 TraceCheckUtils]: 4: Hoare triple {298#true} assume true; {298#true} is VALID [2020-07-10 20:22:34,905 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {298#true} {298#true} #68#return; {298#true} is VALID [2020-07-10 20:22:34,906 INFO L263 TraceCheckUtils]: 6: Hoare triple {298#true} call #t~ret4 := main(); {298#true} is VALID [2020-07-10 20:22:34,906 INFO L280 TraceCheckUtils]: 7: Hoare triple {298#true} SUMMARY for call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096); srcloc: mainENTRY {298#true} is VALID [2020-07-10 20:22:34,906 INFO L280 TraceCheckUtils]: 8: Hoare triple {298#true} havoc ~i~0; {298#true} is VALID [2020-07-10 20:22:34,907 INFO L280 TraceCheckUtils]: 9: Hoare triple {298#true} ~i~0 := 0; {305#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:34,909 INFO L280 TraceCheckUtils]: 10: Hoare triple {305#(= 0 main_~i~0)} assume !(~i~0 < 1024); {299#false} is VALID [2020-07-10 20:22:34,909 INFO L280 TraceCheckUtils]: 11: Hoare triple {299#false} ~i~0 := 0; {299#false} is VALID [2020-07-10 20:22:34,910 INFO L280 TraceCheckUtils]: 12: Hoare triple {299#false} SUMMARY for call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); srcloc: L17-8 {299#false} is VALID [2020-07-10 20:22:34,910 INFO L280 TraceCheckUtils]: 13: Hoare triple {299#false} assume !(0 != #t~mem3); {299#false} is VALID [2020-07-10 20:22:34,911 INFO L280 TraceCheckUtils]: 14: Hoare triple {299#false} havoc #t~mem3; {299#false} is VALID [2020-07-10 20:22:34,911 INFO L263 TraceCheckUtils]: 15: Hoare triple {299#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {299#false} is VALID [2020-07-10 20:22:34,911 INFO L280 TraceCheckUtils]: 16: Hoare triple {299#false} ~cond := #in~cond; {299#false} is VALID [2020-07-10 20:22:34,912 INFO L280 TraceCheckUtils]: 17: Hoare triple {299#false} assume 0 == ~cond; {299#false} is VALID [2020-07-10 20:22:34,912 INFO L280 TraceCheckUtils]: 18: Hoare triple {299#false} assume !false; {299#false} is VALID [2020-07-10 20:22:34,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:22:34,915 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:34,915 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2120464784] [2020-07-10 20:22:34,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:34,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 20:22:34,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682849726] [2020-07-10 20:22:34,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-07-10 20:22:34,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:34,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 20:22:34,944 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:34,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 20:22:34,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:34,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 20:22:34,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 20:22:34,946 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 4 states. [2020-07-10 20:22:35,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:35,204 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2020-07-10 20:22:35,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 20:22:35,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-07-10 20:22:35,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:35,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 20:22:35,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2020-07-10 20:22:35,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 20:22:35,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2020-07-10 20:22:35,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 65 transitions. [2020-07-10 20:22:35,297 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:35,300 INFO L225 Difference]: With dead ends: 59 [2020-07-10 20:22:35,300 INFO L226 Difference]: Without dead ends: 45 [2020-07-10 20:22:35,302 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-10 20:22:35,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-10 20:22:35,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2020-07-10 20:22:35,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:35,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 36 states. [2020-07-10 20:22:35,346 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 36 states. [2020-07-10 20:22:35,347 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 36 states. [2020-07-10 20:22:35,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:35,351 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2020-07-10 20:22:35,351 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2020-07-10 20:22:35,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:35,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:35,353 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 45 states. [2020-07-10 20:22:35,353 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 45 states. [2020-07-10 20:22:35,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:35,358 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2020-07-10 20:22:35,359 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2020-07-10 20:22:35,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:35,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:35,360 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:35,360 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:35,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-10 20:22:35,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2020-07-10 20:22:35,363 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 19 [2020-07-10 20:22:35,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:35,364 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2020-07-10 20:22:35,364 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 20:22:35,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 39 transitions. [2020-07-10 20:22:35,423 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:35,423 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2020-07-10 20:22:35,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 20:22:35,424 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:35,424 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] [2020-07-10 20:22:35,425 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:22:35,425 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:35,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:35,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1000622251, now seen corresponding path program 1 times [2020-07-10 20:22:35,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:35,427 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1605821950] [2020-07-10 20:22:35,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:35,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:35,598 INFO L280 TraceCheckUtils]: 0: Hoare triple {599#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {589#true} is VALID [2020-07-10 20:22:35,599 INFO L280 TraceCheckUtils]: 1: Hoare triple {589#true} #valid := #valid[0 := 0]; {589#true} is VALID [2020-07-10 20:22:35,599 INFO L280 TraceCheckUtils]: 2: Hoare triple {589#true} assume 0 < #StackHeapBarrier; {589#true} is VALID [2020-07-10 20:22:35,600 INFO L280 TraceCheckUtils]: 3: Hoare triple {589#true} assume true; {589#true} is VALID [2020-07-10 20:22:35,600 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {589#true} {589#true} #68#return; {589#true} is VALID [2020-07-10 20:22:35,605 INFO L263 TraceCheckUtils]: 0: Hoare triple {589#true} call ULTIMATE.init(); {599#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 20:22:35,606 INFO L280 TraceCheckUtils]: 1: Hoare triple {599#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {589#true} is VALID [2020-07-10 20:22:35,606 INFO L280 TraceCheckUtils]: 2: Hoare triple {589#true} #valid := #valid[0 := 0]; {589#true} is VALID [2020-07-10 20:22:35,606 INFO L280 TraceCheckUtils]: 3: Hoare triple {589#true} assume 0 < #StackHeapBarrier; {589#true} is VALID [2020-07-10 20:22:35,607 INFO L280 TraceCheckUtils]: 4: Hoare triple {589#true} assume true; {589#true} is VALID [2020-07-10 20:22:35,607 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {589#true} {589#true} #68#return; {589#true} is VALID [2020-07-10 20:22:35,607 INFO L263 TraceCheckUtils]: 6: Hoare triple {589#true} call #t~ret4 := main(); {589#true} is VALID [2020-07-10 20:22:35,608 INFO L280 TraceCheckUtils]: 7: Hoare triple {589#true} SUMMARY for call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096); srcloc: mainENTRY {589#true} is VALID [2020-07-10 20:22:35,608 INFO L280 TraceCheckUtils]: 8: Hoare triple {589#true} havoc ~i~0; {589#true} is VALID [2020-07-10 20:22:35,609 INFO L280 TraceCheckUtils]: 9: Hoare triple {589#true} ~i~0 := 0; {596#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:35,611 INFO L280 TraceCheckUtils]: 10: Hoare triple {596#(= 0 main_~i~0)} assume !!(~i~0 < 1024); {596#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:35,613 INFO L280 TraceCheckUtils]: 11: Hoare triple {596#(= 0 main_~i~0)} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {596#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:35,615 INFO L280 TraceCheckUtils]: 12: Hoare triple {596#(= 0 main_~i~0)} SUMMARY for call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); srcloc: L14-1 {596#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:35,617 INFO L280 TraceCheckUtils]: 13: Hoare triple {596#(= 0 main_~i~0)} havoc #t~nondet1; {596#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:35,618 INFO L280 TraceCheckUtils]: 14: Hoare triple {596#(= 0 main_~i~0)} #t~post0 := ~i~0; {597#(= |main_#t~post0| 0)} is VALID [2020-07-10 20:22:35,620 INFO L280 TraceCheckUtils]: 15: Hoare triple {597#(= |main_#t~post0| 0)} ~i~0 := 1 + #t~post0; {598#(<= main_~i~0 1)} is VALID [2020-07-10 20:22:35,620 INFO L280 TraceCheckUtils]: 16: Hoare triple {598#(<= main_~i~0 1)} havoc #t~post0; {598#(<= main_~i~0 1)} is VALID [2020-07-10 20:22:35,622 INFO L280 TraceCheckUtils]: 17: Hoare triple {598#(<= main_~i~0 1)} assume !(~i~0 < 1024); {590#false} is VALID [2020-07-10 20:22:35,622 INFO L280 TraceCheckUtils]: 18: Hoare triple {590#false} ~i~0 := 0; {590#false} is VALID [2020-07-10 20:22:35,622 INFO L280 TraceCheckUtils]: 19: Hoare triple {590#false} SUMMARY for call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); srcloc: L17-8 {590#false} is VALID [2020-07-10 20:22:35,623 INFO L280 TraceCheckUtils]: 20: Hoare triple {590#false} assume !(0 != #t~mem3); {590#false} is VALID [2020-07-10 20:22:35,623 INFO L280 TraceCheckUtils]: 21: Hoare triple {590#false} havoc #t~mem3; {590#false} is VALID [2020-07-10 20:22:35,624 INFO L263 TraceCheckUtils]: 22: Hoare triple {590#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {590#false} is VALID [2020-07-10 20:22:35,624 INFO L280 TraceCheckUtils]: 23: Hoare triple {590#false} ~cond := #in~cond; {590#false} is VALID [2020-07-10 20:22:35,625 INFO L280 TraceCheckUtils]: 24: Hoare triple {590#false} assume 0 == ~cond; {590#false} is VALID [2020-07-10 20:22:35,626 INFO L280 TraceCheckUtils]: 25: Hoare triple {590#false} assume !false; {590#false} is VALID [2020-07-10 20:22:35,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:22:35,629 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:35,630 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1605821950] [2020-07-10 20:22:35,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:35,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 20:22:35,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173562005] [2020-07-10 20:22:35,635 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-07-10 20:22:35,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:35,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 20:22:35,690 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:35,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 20:22:35,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:35,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 20:22:35,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-10 20:22:35,694 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 6 states. [2020-07-10 20:22:36,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:36,118 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2020-07-10 20:22:36,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 20:22:36,118 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-07-10 20:22:36,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:36,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 20:22:36,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 71 transitions. [2020-07-10 20:22:36,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 20:22:36,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 71 transitions. [2020-07-10 20:22:36,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 71 transitions. [2020-07-10 20:22:36,208 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:36,210 INFO L225 Difference]: With dead ends: 70 [2020-07-10 20:22:36,210 INFO L226 Difference]: Without dead ends: 52 [2020-07-10 20:22:36,211 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-10 20:22:36,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-10 20:22:36,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2020-07-10 20:22:36,260 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:36,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 43 states. [2020-07-10 20:22:36,260 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 43 states. [2020-07-10 20:22:36,260 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 43 states. [2020-07-10 20:22:36,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:36,264 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2020-07-10 20:22:36,264 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2020-07-10 20:22:36,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:36,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:36,266 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 52 states. [2020-07-10 20:22:36,266 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 52 states. [2020-07-10 20:22:36,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:36,270 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2020-07-10 20:22:36,270 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2020-07-10 20:22:36,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:36,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:36,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:36,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:36,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-10 20:22:36,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2020-07-10 20:22:36,274 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 26 [2020-07-10 20:22:36,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:36,274 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2020-07-10 20:22:36,275 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 20:22:36,275 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 46 transitions. [2020-07-10 20:22:36,327 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:36,327 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2020-07-10 20:22:36,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-10 20:22:36,329 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:36,329 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:22:36,330 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:22:36,330 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:36,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:36,331 INFO L82 PathProgramCache]: Analyzing trace with hash 231352676, now seen corresponding path program 2 times [2020-07-10 20:22:36,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:36,332 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1936664146] [2020-07-10 20:22:36,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:36,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:36,489 INFO L280 TraceCheckUtils]: 0: Hoare triple {948#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {936#true} is VALID [2020-07-10 20:22:36,489 INFO L280 TraceCheckUtils]: 1: Hoare triple {936#true} #valid := #valid[0 := 0]; {936#true} is VALID [2020-07-10 20:22:36,489 INFO L280 TraceCheckUtils]: 2: Hoare triple {936#true} assume 0 < #StackHeapBarrier; {936#true} is VALID [2020-07-10 20:22:36,490 INFO L280 TraceCheckUtils]: 3: Hoare triple {936#true} assume true; {936#true} is VALID [2020-07-10 20:22:36,490 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {936#true} {936#true} #68#return; {936#true} is VALID [2020-07-10 20:22:36,492 INFO L263 TraceCheckUtils]: 0: Hoare triple {936#true} call ULTIMATE.init(); {948#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 20:22:36,492 INFO L280 TraceCheckUtils]: 1: Hoare triple {948#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {936#true} is VALID [2020-07-10 20:22:36,493 INFO L280 TraceCheckUtils]: 2: Hoare triple {936#true} #valid := #valid[0 := 0]; {936#true} is VALID [2020-07-10 20:22:36,493 INFO L280 TraceCheckUtils]: 3: Hoare triple {936#true} assume 0 < #StackHeapBarrier; {936#true} is VALID [2020-07-10 20:22:36,493 INFO L280 TraceCheckUtils]: 4: Hoare triple {936#true} assume true; {936#true} is VALID [2020-07-10 20:22:36,494 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {936#true} {936#true} #68#return; {936#true} is VALID [2020-07-10 20:22:36,494 INFO L263 TraceCheckUtils]: 6: Hoare triple {936#true} call #t~ret4 := main(); {936#true} is VALID [2020-07-10 20:22:36,494 INFO L280 TraceCheckUtils]: 7: Hoare triple {936#true} SUMMARY for call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096); srcloc: mainENTRY {936#true} is VALID [2020-07-10 20:22:36,495 INFO L280 TraceCheckUtils]: 8: Hoare triple {936#true} havoc ~i~0; {936#true} is VALID [2020-07-10 20:22:36,497 INFO L280 TraceCheckUtils]: 9: Hoare triple {936#true} ~i~0 := 0; {943#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:36,498 INFO L280 TraceCheckUtils]: 10: Hoare triple {943#(= 0 main_~i~0)} assume !!(~i~0 < 1024); {943#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:36,499 INFO L280 TraceCheckUtils]: 11: Hoare triple {943#(= 0 main_~i~0)} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {943#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:36,500 INFO L280 TraceCheckUtils]: 12: Hoare triple {943#(= 0 main_~i~0)} SUMMARY for call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); srcloc: L14-1 {943#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:36,500 INFO L280 TraceCheckUtils]: 13: Hoare triple {943#(= 0 main_~i~0)} havoc #t~nondet1; {943#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:36,501 INFO L280 TraceCheckUtils]: 14: Hoare triple {943#(= 0 main_~i~0)} #t~post0 := ~i~0; {944#(= |main_#t~post0| 0)} is VALID [2020-07-10 20:22:36,501 INFO L280 TraceCheckUtils]: 15: Hoare triple {944#(= |main_#t~post0| 0)} ~i~0 := 1 + #t~post0; {945#(<= main_~i~0 1)} is VALID [2020-07-10 20:22:36,502 INFO L280 TraceCheckUtils]: 16: Hoare triple {945#(<= main_~i~0 1)} havoc #t~post0; {945#(<= main_~i~0 1)} is VALID [2020-07-10 20:22:36,503 INFO L280 TraceCheckUtils]: 17: Hoare triple {945#(<= main_~i~0 1)} assume !!(~i~0 < 1024); {945#(<= main_~i~0 1)} is VALID [2020-07-10 20:22:36,504 INFO L280 TraceCheckUtils]: 18: Hoare triple {945#(<= main_~i~0 1)} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {945#(<= main_~i~0 1)} is VALID [2020-07-10 20:22:36,505 INFO L280 TraceCheckUtils]: 19: Hoare triple {945#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); srcloc: L14-1 {945#(<= main_~i~0 1)} is VALID [2020-07-10 20:22:36,506 INFO L280 TraceCheckUtils]: 20: Hoare triple {945#(<= main_~i~0 1)} havoc #t~nondet1; {945#(<= main_~i~0 1)} is VALID [2020-07-10 20:22:36,507 INFO L280 TraceCheckUtils]: 21: Hoare triple {945#(<= main_~i~0 1)} #t~post0 := ~i~0; {946#(<= |main_#t~post0| 1)} is VALID [2020-07-10 20:22:36,508 INFO L280 TraceCheckUtils]: 22: Hoare triple {946#(<= |main_#t~post0| 1)} ~i~0 := 1 + #t~post0; {947#(<= main_~i~0 2)} is VALID [2020-07-10 20:22:36,510 INFO L280 TraceCheckUtils]: 23: Hoare triple {947#(<= main_~i~0 2)} havoc #t~post0; {947#(<= main_~i~0 2)} is VALID [2020-07-10 20:22:36,511 INFO L280 TraceCheckUtils]: 24: Hoare triple {947#(<= main_~i~0 2)} assume !(~i~0 < 1024); {937#false} is VALID [2020-07-10 20:22:36,512 INFO L280 TraceCheckUtils]: 25: Hoare triple {937#false} ~i~0 := 0; {937#false} is VALID [2020-07-10 20:22:36,512 INFO L280 TraceCheckUtils]: 26: Hoare triple {937#false} SUMMARY for call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); srcloc: L17-8 {937#false} is VALID [2020-07-10 20:22:36,512 INFO L280 TraceCheckUtils]: 27: Hoare triple {937#false} assume !(0 != #t~mem3); {937#false} is VALID [2020-07-10 20:22:36,513 INFO L280 TraceCheckUtils]: 28: Hoare triple {937#false} havoc #t~mem3; {937#false} is VALID [2020-07-10 20:22:36,513 INFO L263 TraceCheckUtils]: 29: Hoare triple {937#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {937#false} is VALID [2020-07-10 20:22:36,513 INFO L280 TraceCheckUtils]: 30: Hoare triple {937#false} ~cond := #in~cond; {937#false} is VALID [2020-07-10 20:22:36,514 INFO L280 TraceCheckUtils]: 31: Hoare triple {937#false} assume 0 == ~cond; {937#false} is VALID [2020-07-10 20:22:36,514 INFO L280 TraceCheckUtils]: 32: Hoare triple {937#false} assume !false; {937#false} is VALID [2020-07-10 20:22:36,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:22:36,516 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:36,516 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1936664146] [2020-07-10 20:22:36,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:36,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 20:22:36,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649478673] [2020-07-10 20:22:36,517 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2020-07-10 20:22:36,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:36,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 20:22:36,561 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:36,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 20:22:36,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:36,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 20:22:36,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-10 20:22:36,563 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 8 states. [2020-07-10 20:22:37,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:37,053 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2020-07-10 20:22:37,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 20:22:37,054 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2020-07-10 20:22:37,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:37,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 20:22:37,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 78 transitions. [2020-07-10 20:22:37,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 20:22:37,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 78 transitions. [2020-07-10 20:22:37,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 78 transitions. [2020-07-10 20:22:37,154 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:37,157 INFO L225 Difference]: With dead ends: 77 [2020-07-10 20:22:37,157 INFO L226 Difference]: Without dead ends: 59 [2020-07-10 20:22:37,158 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-07-10 20:22:37,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-10 20:22:37,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. [2020-07-10 20:22:37,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:37,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 50 states. [2020-07-10 20:22:37,215 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 50 states. [2020-07-10 20:22:37,215 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 50 states. [2020-07-10 20:22:37,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:37,219 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2020-07-10 20:22:37,220 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2020-07-10 20:22:37,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:37,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:37,221 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 59 states. [2020-07-10 20:22:37,221 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 59 states. [2020-07-10 20:22:37,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:37,224 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2020-07-10 20:22:37,224 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2020-07-10 20:22:37,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:37,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:37,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:37,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:37,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-10 20:22:37,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2020-07-10 20:22:37,228 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 33 [2020-07-10 20:22:37,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:37,229 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2020-07-10 20:22:37,229 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 20:22:37,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states and 53 transitions. [2020-07-10 20:22:37,296 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:37,296 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2020-07-10 20:22:37,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-10 20:22:37,297 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:37,297 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:22:37,297 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 20:22:37,298 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:37,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:37,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1221138549, now seen corresponding path program 3 times [2020-07-10 20:22:37,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:37,298 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1802002073] [2020-07-10 20:22:37,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:37,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:37,466 INFO L280 TraceCheckUtils]: 0: Hoare triple {1341#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1331#true} is VALID [2020-07-10 20:22:37,467 INFO L280 TraceCheckUtils]: 1: Hoare triple {1331#true} #valid := #valid[0 := 0]; {1331#true} is VALID [2020-07-10 20:22:37,467 INFO L280 TraceCheckUtils]: 2: Hoare triple {1331#true} assume 0 < #StackHeapBarrier; {1331#true} is VALID [2020-07-10 20:22:37,467 INFO L280 TraceCheckUtils]: 3: Hoare triple {1331#true} assume true; {1331#true} is VALID [2020-07-10 20:22:37,468 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1331#true} {1331#true} #68#return; {1331#true} is VALID [2020-07-10 20:22:37,469 INFO L263 TraceCheckUtils]: 0: Hoare triple {1331#true} call ULTIMATE.init(); {1341#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 20:22:37,469 INFO L280 TraceCheckUtils]: 1: Hoare triple {1341#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1331#true} is VALID [2020-07-10 20:22:37,470 INFO L280 TraceCheckUtils]: 2: Hoare triple {1331#true} #valid := #valid[0 := 0]; {1331#true} is VALID [2020-07-10 20:22:37,470 INFO L280 TraceCheckUtils]: 3: Hoare triple {1331#true} assume 0 < #StackHeapBarrier; {1331#true} is VALID [2020-07-10 20:22:37,470 INFO L280 TraceCheckUtils]: 4: Hoare triple {1331#true} assume true; {1331#true} is VALID [2020-07-10 20:22:37,471 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1331#true} {1331#true} #68#return; {1331#true} is VALID [2020-07-10 20:22:37,471 INFO L263 TraceCheckUtils]: 6: Hoare triple {1331#true} call #t~ret4 := main(); {1331#true} is VALID [2020-07-10 20:22:37,471 INFO L280 TraceCheckUtils]: 7: Hoare triple {1331#true} SUMMARY for call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096); srcloc: mainENTRY {1331#true} is VALID [2020-07-10 20:22:37,472 INFO L280 TraceCheckUtils]: 8: Hoare triple {1331#true} havoc ~i~0; {1331#true} is VALID [2020-07-10 20:22:37,472 INFO L280 TraceCheckUtils]: 9: Hoare triple {1331#true} ~i~0 := 0; {1331#true} is VALID [2020-07-10 20:22:37,472 INFO L280 TraceCheckUtils]: 10: Hoare triple {1331#true} assume !!(~i~0 < 1024); {1331#true} is VALID [2020-07-10 20:22:37,472 INFO L280 TraceCheckUtils]: 11: Hoare triple {1331#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1331#true} is VALID [2020-07-10 20:22:37,473 INFO L280 TraceCheckUtils]: 12: Hoare triple {1331#true} SUMMARY for call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); srcloc: L14-1 {1331#true} is VALID [2020-07-10 20:22:37,473 INFO L280 TraceCheckUtils]: 13: Hoare triple {1331#true} havoc #t~nondet1; {1331#true} is VALID [2020-07-10 20:22:37,473 INFO L280 TraceCheckUtils]: 14: Hoare triple {1331#true} #t~post0 := ~i~0; {1331#true} is VALID [2020-07-10 20:22:37,474 INFO L280 TraceCheckUtils]: 15: Hoare triple {1331#true} ~i~0 := 1 + #t~post0; {1331#true} is VALID [2020-07-10 20:22:37,474 INFO L280 TraceCheckUtils]: 16: Hoare triple {1331#true} havoc #t~post0; {1331#true} is VALID [2020-07-10 20:22:37,474 INFO L280 TraceCheckUtils]: 17: Hoare triple {1331#true} assume !!(~i~0 < 1024); {1331#true} is VALID [2020-07-10 20:22:37,474 INFO L280 TraceCheckUtils]: 18: Hoare triple {1331#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1331#true} is VALID [2020-07-10 20:22:37,475 INFO L280 TraceCheckUtils]: 19: Hoare triple {1331#true} SUMMARY for call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); srcloc: L14-1 {1331#true} is VALID [2020-07-10 20:22:37,475 INFO L280 TraceCheckUtils]: 20: Hoare triple {1331#true} havoc #t~nondet1; {1331#true} is VALID [2020-07-10 20:22:37,475 INFO L280 TraceCheckUtils]: 21: Hoare triple {1331#true} #t~post0 := ~i~0; {1331#true} is VALID [2020-07-10 20:22:37,475 INFO L280 TraceCheckUtils]: 22: Hoare triple {1331#true} ~i~0 := 1 + #t~post0; {1331#true} is VALID [2020-07-10 20:22:37,476 INFO L280 TraceCheckUtils]: 23: Hoare triple {1331#true} havoc #t~post0; {1331#true} is VALID [2020-07-10 20:22:37,476 INFO L280 TraceCheckUtils]: 24: Hoare triple {1331#true} assume !!(~i~0 < 1024); {1331#true} is VALID [2020-07-10 20:22:37,476 INFO L280 TraceCheckUtils]: 25: Hoare triple {1331#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1331#true} is VALID [2020-07-10 20:22:37,477 INFO L280 TraceCheckUtils]: 26: Hoare triple {1331#true} SUMMARY for call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); srcloc: L14-1 {1331#true} is VALID [2020-07-10 20:22:37,477 INFO L280 TraceCheckUtils]: 27: Hoare triple {1331#true} havoc #t~nondet1; {1331#true} is VALID [2020-07-10 20:22:37,477 INFO L280 TraceCheckUtils]: 28: Hoare triple {1331#true} #t~post0 := ~i~0; {1331#true} is VALID [2020-07-10 20:22:37,477 INFO L280 TraceCheckUtils]: 29: Hoare triple {1331#true} ~i~0 := 1 + #t~post0; {1331#true} is VALID [2020-07-10 20:22:37,478 INFO L280 TraceCheckUtils]: 30: Hoare triple {1331#true} havoc #t~post0; {1331#true} is VALID [2020-07-10 20:22:37,478 INFO L280 TraceCheckUtils]: 31: Hoare triple {1331#true} assume !(~i~0 < 1024); {1331#true} is VALID [2020-07-10 20:22:37,479 INFO L280 TraceCheckUtils]: 32: Hoare triple {1331#true} ~i~0 := 0; {1338#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:37,479 INFO L280 TraceCheckUtils]: 33: Hoare triple {1338#(= 0 main_~i~0)} SUMMARY for call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); srcloc: L17-8 {1338#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:37,480 INFO L280 TraceCheckUtils]: 34: Hoare triple {1338#(= 0 main_~i~0)} assume !(0 != #t~mem3); {1338#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:37,481 INFO L280 TraceCheckUtils]: 35: Hoare triple {1338#(= 0 main_~i~0)} havoc #t~mem3; {1338#(= 0 main_~i~0)} is VALID [2020-07-10 20:22:37,482 INFO L263 TraceCheckUtils]: 36: Hoare triple {1338#(= 0 main_~i~0)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {1339#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:22:37,483 INFO L280 TraceCheckUtils]: 37: Hoare triple {1339#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1340#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:22:37,484 INFO L280 TraceCheckUtils]: 38: Hoare triple {1340#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1332#false} is VALID [2020-07-10 20:22:37,485 INFO L280 TraceCheckUtils]: 39: Hoare triple {1332#false} assume !false; {1332#false} is VALID [2020-07-10 20:22:37,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:22:37,487 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:37,487 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1802002073] [2020-07-10 20:22:37,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:37,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 20:22:37,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966365076] [2020-07-10 20:22:37,489 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2020-07-10 20:22:37,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:37,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 20:22:37,521 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:37,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 20:22:37,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:37,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 20:22:37,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 20:22:37,523 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 6 states. [2020-07-10 20:22:37,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:37,866 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2020-07-10 20:22:37,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 20:22:37,867 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2020-07-10 20:22:37,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:37,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 20:22:37,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2020-07-10 20:22:37,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 20:22:37,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2020-07-10 20:22:37,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2020-07-10 20:22:37,941 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:37,943 INFO L225 Difference]: With dead ends: 58 [2020-07-10 20:22:37,943 INFO L226 Difference]: Without dead ends: 52 [2020-07-10 20:22:37,944 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-10 20:22:37,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-10 20:22:37,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2020-07-10 20:22:37,988 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:37,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 50 states. [2020-07-10 20:22:37,989 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 50 states. [2020-07-10 20:22:37,989 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 50 states. [2020-07-10 20:22:37,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:37,993 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2020-07-10 20:22:37,993 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2020-07-10 20:22:37,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:37,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:37,994 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 52 states. [2020-07-10 20:22:37,994 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 52 states. [2020-07-10 20:22:37,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:37,997 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2020-07-10 20:22:37,997 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2020-07-10 20:22:37,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:37,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:37,998 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:37,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:37,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-10 20:22:38,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2020-07-10 20:22:38,001 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 40 [2020-07-10 20:22:38,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:38,002 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2020-07-10 20:22:38,002 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 20:22:38,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states and 52 transitions. [2020-07-10 20:22:38,054 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:38,055 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2020-07-10 20:22:38,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-07-10 20:22:38,056 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:38,056 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:22:38,056 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 20:22:38,056 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:38,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:38,057 INFO L82 PathProgramCache]: Analyzing trace with hash -842063729, now seen corresponding path program 1 times [2020-07-10 20:22:38,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:38,058 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1710474873] [2020-07-10 20:22:38,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:38,078 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 20:22:38,079 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-10 20:22:38,086 INFO L168 Benchmark]: Toolchain (without parser) took 5313.04 ms. Allocated memory was 136.8 MB in the beginning and 286.3 MB in the end (delta: 149.4 MB). Free memory was 102.2 MB in the beginning and 234.3 MB in the end (delta: -132.1 MB). Peak memory consumption was 17.3 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:38,087 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 136.8 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 20:22:38,088 INFO L168 Benchmark]: CACSL2BoogieTranslator took 336.24 ms. Allocated memory is still 136.8 MB. Free memory was 101.8 MB in the beginning and 91.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:38,089 INFO L168 Benchmark]: Boogie Preprocessor took 133.49 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 91.8 MB in the beginning and 179.2 MB in the end (delta: -87.4 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:38,090 INFO L168 Benchmark]: RCFGBuilder took 471.05 ms. Allocated memory is still 201.3 MB. Free memory was 179.2 MB in the beginning and 158.4 MB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:38,091 INFO L168 Benchmark]: TraceAbstraction took 4366.03 ms. Allocated memory was 201.3 MB in the beginning and 286.3 MB in the end (delta: 84.9 MB). Free memory was 158.4 MB in the beginning and 234.3 MB in the end (delta: -75.9 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:38,095 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.37 ms. Allocated memory is still 136.8 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 336.24 ms. Allocated memory is still 136.8 MB. Free memory was 101.8 MB in the beginning and 91.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 133.49 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 91.8 MB in the beginning and 179.2 MB in the end (delta: -87.4 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 471.05 ms. Allocated memory is still 201.3 MB. Free memory was 179.2 MB in the beginning and 158.4 MB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4366.03 ms. Allocated memory was 201.3 MB in the beginning and 286.3 MB in the end (delta: 84.9 MB). Free memory was 158.4 MB in the beginning and 234.3 MB in the end (delta: -75.9 MB). Peak memory consumption was 9.0 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...