/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/array_3-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:50:55,419 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:50:55,422 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:50:55,435 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:50:55,435 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:50:55,436 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:50:55,438 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:50:55,440 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:50:55,442 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:50:55,442 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:50:55,444 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:50:55,445 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:50:55,445 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:50:55,446 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:50:55,447 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:50:55,448 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:50:55,449 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:50:55,450 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:50:55,452 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:50:55,454 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:50:55,455 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:50:55,457 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:50:55,458 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:50:55,458 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:50:55,461 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:50:55,461 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:50:55,461 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:50:55,462 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:50:55,463 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:50:55,463 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:50:55,464 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:50:55,464 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:50:55,465 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:50:55,466 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:50:55,467 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:50:55,467 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:50:55,468 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:50:55,468 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:50:55,468 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:50:55,469 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:50:55,470 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:50:55,471 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:50:55,488 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:50:55,488 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:50:55,490 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:50:55,490 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:50:55,490 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:50:55,490 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:50:55,491 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:50:55,491 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:50:55,491 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:50:55,491 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:50:55,491 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:50:55,491 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:50:55,492 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:50:55,492 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:50:55,492 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:50:55,492 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:50:55,492 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:50:55,493 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:50:55,493 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:50:55,493 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:50:55,493 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:50:55,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:50:55,494 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:50:55,494 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:50:55,494 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:50:55,494 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:50:55,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:50:55,495 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:50:55,495 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:50:55,495 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:50:55,789 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:50:55,805 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:50:55,809 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:50:55,810 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:50:55,811 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:50:55,811 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-17 22:50:55,912 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fbdbc861/c2894e13498b426681ff091aca7143cb/FLAG03e068dc2 [2020-07-17 22:50:56,412 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:50:56,412 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_3-1.i [2020-07-17 22:50:56,419 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fbdbc861/c2894e13498b426681ff091aca7143cb/FLAG03e068dc2 [2020-07-17 22:50:56,769 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fbdbc861/c2894e13498b426681ff091aca7143cb [2020-07-17 22:50:56,782 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:50:56,785 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:50:56,786 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:50:56,786 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:50:56,790 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:50:56,792 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:50:56" (1/1) ... [2020-07-17 22:50:56,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44e77683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:56, skipping insertion in model container [2020-07-17 22:50:56,795 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:50:56" (1/1) ... [2020-07-17 22:50:56,803 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:50:56,818 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:50:56,992 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:50:56,998 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:50:57,022 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:50:57,045 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:50:57,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:57 WrapperNode [2020-07-17 22:50:57,046 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:50:57,047 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:50:57,047 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:50:57,047 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:50:57,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:57" (1/1) ... [2020-07-17 22:50:57,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:57" (1/1) ... [2020-07-17 22:50:57,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:57" (1/1) ... [2020-07-17 22:50:57,159 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:57" (1/1) ... [2020-07-17 22:50:57,167 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:57" (1/1) ... [2020-07-17 22:50:57,173 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:57" (1/1) ... [2020-07-17 22:50:57,174 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:57" (1/1) ... [2020-07-17 22:50:57,177 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:50:57,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:50:57,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:50:57,177 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:50:57,178 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:50:57,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:50:57,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:50:57,255 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:50:57,255 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:50:57,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:50:57,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:50:57,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:50:57,256 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:50:57,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-17 22:50:57,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:50:57,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:50:57,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:50:57,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:50:57,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:50:57,596 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:50:57,597 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-17 22:50:57,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:50:57 BoogieIcfgContainer [2020-07-17 22:50:57,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:50:57,601 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:50:57,602 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:50:57,605 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:50:57,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:50:56" (1/3) ... [2020-07-17 22:50:57,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c74568a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:50:57, skipping insertion in model container [2020-07-17 22:50:57,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:57" (2/3) ... [2020-07-17 22:50:57,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c74568a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:50:57, skipping insertion in model container [2020-07-17 22:50:57,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:50:57" (3/3) ... [2020-07-17 22:50:57,608 INFO L109 eAbstractionObserver]: Analyzing ICFG array_3-1.i [2020-07-17 22:50:57,619 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:50:57,627 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:50:57,641 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:50:57,670 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:50:57,670 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:50:57,670 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:50:57,670 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:50:57,671 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:50:57,671 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:50:57,671 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:50:57,671 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:50:57,695 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-07-17 22:50:57,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-17 22:50:57,703 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:57,704 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:57,704 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:57,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:57,711 INFO L82 PathProgramCache]: Analyzing trace with hash -413900697, now seen corresponding path program 1 times [2020-07-17 22:50:57,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:57,722 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260124510] [2020-07-17 22:50:57,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:57,938 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {28#true} is VALID [2020-07-17 22:50:57,939 INFO L280 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2020-07-17 22:50:57,939 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #54#return; {28#true} is VALID [2020-07-17 22:50:57,944 INFO L263 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {33#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:50:57,944 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {28#true} is VALID [2020-07-17 22:50:57,945 INFO L280 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2020-07-17 22:50:57,945 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #54#return; {28#true} is VALID [2020-07-17 22:50:57,946 INFO L263 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret4 := main(); {28#true} is VALID [2020-07-17 22:50:57,946 INFO L280 TraceCheckUtils]: 5: Hoare triple {28#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {28#true} is VALID [2020-07-17 22:50:57,948 INFO L280 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2020-07-17 22:50:57,948 INFO L280 TraceCheckUtils]: 7: Hoare triple {29#false} ~i~0 := 0; {29#false} is VALID [2020-07-17 22:50:57,949 INFO L280 TraceCheckUtils]: 8: Hoare triple {29#false} assume !true; {29#false} is VALID [2020-07-17 22:50:57,949 INFO L263 TraceCheckUtils]: 9: Hoare triple {29#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {29#false} is VALID [2020-07-17 22:50:57,949 INFO L280 TraceCheckUtils]: 10: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2020-07-17 22:50:57,950 INFO L280 TraceCheckUtils]: 11: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2020-07-17 22:50:57,950 INFO L280 TraceCheckUtils]: 12: Hoare triple {29#false} assume !false; {29#false} is VALID [2020-07-17 22:50:57,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:57,953 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260124510] [2020-07-17 22:50:57,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:57,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:50:57,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391259890] [2020-07-17 22:50:57,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-07-17 22:50:57,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:57,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:50:58,013 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:58,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:50:58,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:58,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:50:58,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:50:58,026 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2020-07-17 22:50:58,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:58,199 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2020-07-17 22:50:58,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:50:58,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-07-17 22:50:58,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:58,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:50:58,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2020-07-17 22:50:58,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:50:58,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2020-07-17 22:50:58,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 51 transitions. [2020-07-17 22:50:58,325 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-17 22:50:58,338 INFO L225 Difference]: With dead ends: 42 [2020-07-17 22:50:58,338 INFO L226 Difference]: Without dead ends: 18 [2020-07-17 22:50:58,343 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:50:58,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-17 22:50:58,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-17 22:50:58,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:58,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2020-07-17 22:50:58,398 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-17 22:50:58,398 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-17 22:50:58,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:58,402 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2020-07-17 22:50:58,403 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2020-07-17 22:50:58,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:58,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:58,404 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-17 22:50:58,404 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-17 22:50:58,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:58,408 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2020-07-17 22:50:58,408 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2020-07-17 22:50:58,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:58,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:58,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:58,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:58,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-17 22:50:58,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2020-07-17 22:50:58,414 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2020-07-17 22:50:58,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:58,415 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-07-17 22:50:58,415 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:50:58,416 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2020-07-17 22:50:58,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-17 22:50:58,417 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:58,417 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:58,417 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:50:58,418 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:58,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:58,418 INFO L82 PathProgramCache]: Analyzing trace with hash 2053026861, now seen corresponding path program 1 times [2020-07-17 22:50:58,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:58,419 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247200496] [2020-07-17 22:50:58,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:58,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:58,527 INFO L280 TraceCheckUtils]: 0: Hoare triple {157#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {151#true} is VALID [2020-07-17 22:50:58,528 INFO L280 TraceCheckUtils]: 1: Hoare triple {151#true} assume true; {151#true} is VALID [2020-07-17 22:50:58,528 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {151#true} {151#true} #54#return; {151#true} is VALID [2020-07-17 22:50:58,530 INFO L263 TraceCheckUtils]: 0: Hoare triple {151#true} call ULTIMATE.init(); {157#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:50:58,530 INFO L280 TraceCheckUtils]: 1: Hoare triple {157#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {151#true} is VALID [2020-07-17 22:50:58,531 INFO L280 TraceCheckUtils]: 2: Hoare triple {151#true} assume true; {151#true} is VALID [2020-07-17 22:50:58,531 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {151#true} {151#true} #54#return; {151#true} is VALID [2020-07-17 22:50:58,532 INFO L263 TraceCheckUtils]: 4: Hoare triple {151#true} call #t~ret4 := main(); {151#true} is VALID [2020-07-17 22:50:58,533 INFO L280 TraceCheckUtils]: 5: Hoare triple {151#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {156#(= 0 main_~i~0)} is VALID [2020-07-17 22:50:58,535 INFO L280 TraceCheckUtils]: 6: Hoare triple {156#(= 0 main_~i~0)} assume !(~i~0 < 1024); {152#false} is VALID [2020-07-17 22:50:58,535 INFO L280 TraceCheckUtils]: 7: Hoare triple {152#false} ~i~0 := 0; {152#false} is VALID [2020-07-17 22:50:58,536 INFO L280 TraceCheckUtils]: 8: Hoare triple {152#false} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {152#false} is VALID [2020-07-17 22:50:58,536 INFO L280 TraceCheckUtils]: 9: Hoare triple {152#false} assume !(0 != #t~mem3);havoc #t~mem3; {152#false} is VALID [2020-07-17 22:50:58,537 INFO L263 TraceCheckUtils]: 10: Hoare triple {152#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {152#false} is VALID [2020-07-17 22:50:58,537 INFO L280 TraceCheckUtils]: 11: Hoare triple {152#false} ~cond := #in~cond; {152#false} is VALID [2020-07-17 22:50:58,537 INFO L280 TraceCheckUtils]: 12: Hoare triple {152#false} assume 0 == ~cond; {152#false} is VALID [2020-07-17 22:50:58,538 INFO L280 TraceCheckUtils]: 13: Hoare triple {152#false} assume !false; {152#false} is VALID [2020-07-17 22:50:58,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:58,540 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247200496] [2020-07-17 22:50:58,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:58,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:50:58,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525143522] [2020-07-17 22:50:58,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-17 22:50:58,543 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:58,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:50:58,570 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:58,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:50:58,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:58,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:50:58,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:50:58,572 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 4 states. [2020-07-17 22:50:58,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:58,741 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-07-17 22:50:58,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:50:58,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-17 22:50:58,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:58,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:50:58,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2020-07-17 22:50:58,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:50:58,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2020-07-17 22:50:58,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 41 transitions. [2020-07-17 22:50:58,796 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-17 22:50:58,798 INFO L225 Difference]: With dead ends: 35 [2020-07-17 22:50:58,798 INFO L226 Difference]: Without dead ends: 25 [2020-07-17 22:50:58,800 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-17 22:50:58,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-17 22:50:58,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2020-07-17 22:50:58,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:58,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 22 states. [2020-07-17 22:50:58,817 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 22 states. [2020-07-17 22:50:58,817 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 22 states. [2020-07-17 22:50:58,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:58,820 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2020-07-17 22:50:58,820 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2020-07-17 22:50:58,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:58,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:58,821 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 25 states. [2020-07-17 22:50:58,821 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 25 states. [2020-07-17 22:50:58,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:58,824 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2020-07-17 22:50:58,824 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2020-07-17 22:50:58,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:58,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:58,825 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:58,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:58,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-17 22:50:58,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2020-07-17 22:50:58,827 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 14 [2020-07-17 22:50:58,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:58,828 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2020-07-17 22:50:58,828 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:50:58,828 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2020-07-17 22:50:58,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-17 22:50:58,829 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:58,829 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:58,829 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:50:58,830 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:58,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:58,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1766388751, now seen corresponding path program 1 times [2020-07-17 22:50:58,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:58,831 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910454203] [2020-07-17 22:50:58,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:58,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:58,918 INFO L280 TraceCheckUtils]: 0: Hoare triple {298#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {291#true} is VALID [2020-07-17 22:50:58,918 INFO L280 TraceCheckUtils]: 1: Hoare triple {291#true} assume true; {291#true} is VALID [2020-07-17 22:50:58,919 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {291#true} {291#true} #54#return; {291#true} is VALID [2020-07-17 22:50:58,920 INFO L263 TraceCheckUtils]: 0: Hoare triple {291#true} call ULTIMATE.init(); {298#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:50:58,921 INFO L280 TraceCheckUtils]: 1: Hoare triple {298#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {291#true} is VALID [2020-07-17 22:50:58,921 INFO L280 TraceCheckUtils]: 2: Hoare triple {291#true} assume true; {291#true} is VALID [2020-07-17 22:50:58,921 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {291#true} {291#true} #54#return; {291#true} is VALID [2020-07-17 22:50:58,922 INFO L263 TraceCheckUtils]: 4: Hoare triple {291#true} call #t~ret4 := main(); {291#true} is VALID [2020-07-17 22:50:58,923 INFO L280 TraceCheckUtils]: 5: Hoare triple {291#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {296#(= 0 main_~i~0)} is VALID [2020-07-17 22:50:58,924 INFO L280 TraceCheckUtils]: 6: Hoare triple {296#(= 0 main_~i~0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {296#(= 0 main_~i~0)} is VALID [2020-07-17 22:50:58,925 INFO L280 TraceCheckUtils]: 7: Hoare triple {296#(= 0 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {297#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:58,926 INFO L280 TraceCheckUtils]: 8: Hoare triple {297#(<= main_~i~0 1)} assume !(~i~0 < 1024); {292#false} is VALID [2020-07-17 22:50:58,926 INFO L280 TraceCheckUtils]: 9: Hoare triple {292#false} ~i~0 := 0; {292#false} is VALID [2020-07-17 22:50:58,927 INFO L280 TraceCheckUtils]: 10: Hoare triple {292#false} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {292#false} is VALID [2020-07-17 22:50:58,927 INFO L280 TraceCheckUtils]: 11: Hoare triple {292#false} assume !(0 != #t~mem3);havoc #t~mem3; {292#false} is VALID [2020-07-17 22:50:58,927 INFO L263 TraceCheckUtils]: 12: Hoare triple {292#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {292#false} is VALID [2020-07-17 22:50:58,928 INFO L280 TraceCheckUtils]: 13: Hoare triple {292#false} ~cond := #in~cond; {292#false} is VALID [2020-07-17 22:50:58,928 INFO L280 TraceCheckUtils]: 14: Hoare triple {292#false} assume 0 == ~cond; {292#false} is VALID [2020-07-17 22:50:58,928 INFO L280 TraceCheckUtils]: 15: Hoare triple {292#false} assume !false; {292#false} is VALID [2020-07-17 22:50:58,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:58,930 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910454203] [2020-07-17 22:50:58,930 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285411596] [2020-07-17 22:50:58,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:58,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:58,974 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-17 22:50:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:58,993 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:59,057 INFO L263 TraceCheckUtils]: 0: Hoare triple {291#true} call ULTIMATE.init(); {291#true} is VALID [2020-07-17 22:50:59,058 INFO L280 TraceCheckUtils]: 1: Hoare triple {291#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {291#true} is VALID [2020-07-17 22:50:59,058 INFO L280 TraceCheckUtils]: 2: Hoare triple {291#true} assume true; {291#true} is VALID [2020-07-17 22:50:59,058 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {291#true} {291#true} #54#return; {291#true} is VALID [2020-07-17 22:50:59,059 INFO L263 TraceCheckUtils]: 4: Hoare triple {291#true} call #t~ret4 := main(); {291#true} is VALID [2020-07-17 22:50:59,060 INFO L280 TraceCheckUtils]: 5: Hoare triple {291#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {317#(<= main_~i~0 0)} is VALID [2020-07-17 22:50:59,060 INFO L280 TraceCheckUtils]: 6: Hoare triple {317#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {317#(<= main_~i~0 0)} is VALID [2020-07-17 22:50:59,061 INFO L280 TraceCheckUtils]: 7: Hoare triple {317#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {297#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:59,062 INFO L280 TraceCheckUtils]: 8: Hoare triple {297#(<= main_~i~0 1)} assume !(~i~0 < 1024); {292#false} is VALID [2020-07-17 22:50:59,063 INFO L280 TraceCheckUtils]: 9: Hoare triple {292#false} ~i~0 := 0; {292#false} is VALID [2020-07-17 22:50:59,063 INFO L280 TraceCheckUtils]: 10: Hoare triple {292#false} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {292#false} is VALID [2020-07-17 22:50:59,063 INFO L280 TraceCheckUtils]: 11: Hoare triple {292#false} assume !(0 != #t~mem3);havoc #t~mem3; {292#false} is VALID [2020-07-17 22:50:59,064 INFO L263 TraceCheckUtils]: 12: Hoare triple {292#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {292#false} is VALID [2020-07-17 22:50:59,064 INFO L280 TraceCheckUtils]: 13: Hoare triple {292#false} ~cond := #in~cond; {292#false} is VALID [2020-07-17 22:50:59,064 INFO L280 TraceCheckUtils]: 14: Hoare triple {292#false} assume 0 == ~cond; {292#false} is VALID [2020-07-17 22:50:59,064 INFO L280 TraceCheckUtils]: 15: Hoare triple {292#false} assume !false; {292#false} is VALID [2020-07-17 22:50:59,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:59,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:59,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2020-07-17 22:50:59,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143241153] [2020-07-17 22:50:59,067 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-17 22:50:59,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:59,068 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:50:59,093 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:59,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:50:59,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:59,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:50:59,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:50:59,095 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 6 states. [2020-07-17 22:50:59,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:59,286 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2020-07-17 22:50:59,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:50:59,286 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-17 22:50:59,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:59,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:50:59,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2020-07-17 22:50:59,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:50:59,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2020-07-17 22:50:59,293 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 49 transitions. [2020-07-17 22:50:59,365 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:59,367 INFO L225 Difference]: With dead ends: 45 [2020-07-17 22:50:59,367 INFO L226 Difference]: Without dead ends: 32 [2020-07-17 22:50:59,368 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:50:59,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-17 22:50:59,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2020-07-17 22:50:59,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:59,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 28 states. [2020-07-17 22:50:59,388 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 28 states. [2020-07-17 22:50:59,388 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 28 states. [2020-07-17 22:50:59,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:59,391 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-07-17 22:50:59,391 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-17 22:50:59,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:59,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:59,392 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 32 states. [2020-07-17 22:50:59,392 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 32 states. [2020-07-17 22:50:59,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:59,395 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-07-17 22:50:59,395 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-17 22:50:59,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:59,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:59,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:59,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:59,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-17 22:50:59,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-07-17 22:50:59,399 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 16 [2020-07-17 22:50:59,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:59,399 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-07-17 22:50:59,400 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:50:59,400 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-07-17 22:50:59,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-17 22:50:59,401 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:59,401 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:59,615 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-17 22:50:59,616 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:59,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:59,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1185071985, now seen corresponding path program 2 times [2020-07-17 22:50:59,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:59,617 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966856503] [2020-07-17 22:50:59,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:59,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:59,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:59,762 INFO L280 TraceCheckUtils]: 0: Hoare triple {522#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {514#true} is VALID [2020-07-17 22:50:59,763 INFO L280 TraceCheckUtils]: 1: Hoare triple {514#true} assume true; {514#true} is VALID [2020-07-17 22:50:59,763 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {514#true} {514#true} #54#return; {514#true} is VALID [2020-07-17 22:50:59,765 INFO L263 TraceCheckUtils]: 0: Hoare triple {514#true} call ULTIMATE.init(); {522#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:50:59,765 INFO L280 TraceCheckUtils]: 1: Hoare triple {522#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {514#true} is VALID [2020-07-17 22:50:59,765 INFO L280 TraceCheckUtils]: 2: Hoare triple {514#true} assume true; {514#true} is VALID [2020-07-17 22:50:59,766 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {514#true} {514#true} #54#return; {514#true} is VALID [2020-07-17 22:50:59,766 INFO L263 TraceCheckUtils]: 4: Hoare triple {514#true} call #t~ret4 := main(); {514#true} is VALID [2020-07-17 22:50:59,767 INFO L280 TraceCheckUtils]: 5: Hoare triple {514#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {519#(= 0 main_~i~0)} is VALID [2020-07-17 22:50:59,768 INFO L280 TraceCheckUtils]: 6: Hoare triple {519#(= 0 main_~i~0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {519#(= 0 main_~i~0)} is VALID [2020-07-17 22:50:59,769 INFO L280 TraceCheckUtils]: 7: Hoare triple {519#(= 0 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {520#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:59,770 INFO L280 TraceCheckUtils]: 8: Hoare triple {520#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {520#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:59,771 INFO L280 TraceCheckUtils]: 9: Hoare triple {520#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {521#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:59,772 INFO L280 TraceCheckUtils]: 10: Hoare triple {521#(<= main_~i~0 2)} assume !(~i~0 < 1024); {515#false} is VALID [2020-07-17 22:50:59,773 INFO L280 TraceCheckUtils]: 11: Hoare triple {515#false} ~i~0 := 0; {515#false} is VALID [2020-07-17 22:50:59,773 INFO L280 TraceCheckUtils]: 12: Hoare triple {515#false} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {515#false} is VALID [2020-07-17 22:50:59,774 INFO L280 TraceCheckUtils]: 13: Hoare triple {515#false} assume !(0 != #t~mem3);havoc #t~mem3; {515#false} is VALID [2020-07-17 22:50:59,774 INFO L263 TraceCheckUtils]: 14: Hoare triple {515#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {515#false} is VALID [2020-07-17 22:50:59,774 INFO L280 TraceCheckUtils]: 15: Hoare triple {515#false} ~cond := #in~cond; {515#false} is VALID [2020-07-17 22:50:59,775 INFO L280 TraceCheckUtils]: 16: Hoare triple {515#false} assume 0 == ~cond; {515#false} is VALID [2020-07-17 22:50:59,775 INFO L280 TraceCheckUtils]: 17: Hoare triple {515#false} assume !false; {515#false} is VALID [2020-07-17 22:50:59,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:59,777 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966856503] [2020-07-17 22:50:59,778 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400198352] [2020-07-17 22:50:59,778 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:59,823 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-17 22:50:59,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:50:59,825 INFO L264 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-17 22:50:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:59,838 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:59,892 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:59,959 INFO L263 TraceCheckUtils]: 0: Hoare triple {514#true} call ULTIMATE.init(); {514#true} is VALID [2020-07-17 22:50:59,959 INFO L280 TraceCheckUtils]: 1: Hoare triple {514#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {514#true} is VALID [2020-07-17 22:50:59,960 INFO L280 TraceCheckUtils]: 2: Hoare triple {514#true} assume true; {514#true} is VALID [2020-07-17 22:50:59,960 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {514#true} {514#true} #54#return; {514#true} is VALID [2020-07-17 22:50:59,960 INFO L263 TraceCheckUtils]: 4: Hoare triple {514#true} call #t~ret4 := main(); {514#true} is VALID [2020-07-17 22:50:59,961 INFO L280 TraceCheckUtils]: 5: Hoare triple {514#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {514#true} is VALID [2020-07-17 22:50:59,961 INFO L280 TraceCheckUtils]: 6: Hoare triple {514#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {514#true} is VALID [2020-07-17 22:50:59,961 INFO L280 TraceCheckUtils]: 7: Hoare triple {514#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {514#true} is VALID [2020-07-17 22:50:59,962 INFO L280 TraceCheckUtils]: 8: Hoare triple {514#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {514#true} is VALID [2020-07-17 22:50:59,962 INFO L280 TraceCheckUtils]: 9: Hoare triple {514#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {514#true} is VALID [2020-07-17 22:50:59,962 INFO L280 TraceCheckUtils]: 10: Hoare triple {514#true} assume !(~i~0 < 1024); {514#true} is VALID [2020-07-17 22:50:59,963 INFO L280 TraceCheckUtils]: 11: Hoare triple {514#true} ~i~0 := 0; {559#(<= main_~i~0 0)} is VALID [2020-07-17 22:50:59,964 INFO L280 TraceCheckUtils]: 12: Hoare triple {559#(<= main_~i~0 0)} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {559#(<= main_~i~0 0)} is VALID [2020-07-17 22:50:59,965 INFO L280 TraceCheckUtils]: 13: Hoare triple {559#(<= main_~i~0 0)} assume !(0 != #t~mem3);havoc #t~mem3; {559#(<= main_~i~0 0)} is VALID [2020-07-17 22:50:59,967 INFO L263 TraceCheckUtils]: 14: Hoare triple {559#(<= main_~i~0 0)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {569#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:50:59,968 INFO L280 TraceCheckUtils]: 15: Hoare triple {569#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {573#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:50:59,969 INFO L280 TraceCheckUtils]: 16: Hoare triple {573#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {515#false} is VALID [2020-07-17 22:50:59,969 INFO L280 TraceCheckUtils]: 17: Hoare triple {515#false} assume !false; {515#false} is VALID [2020-07-17 22:50:59,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-17 22:50:59,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:50:59,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2020-07-17 22:50:59,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012135613] [2020-07-17 22:50:59,971 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-17 22:50:59,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:59,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:50:59,992 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:59,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:50:59,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:59,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:50:59,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:50:59,993 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2020-07-17 22:51:00,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:00,121 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2020-07-17 22:51:00,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:51:00,121 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-17 22:51:00,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:00,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:51:00,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2020-07-17 22:51:00,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:51:00,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2020-07-17 22:51:00,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2020-07-17 22:51:00,161 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:00,163 INFO L225 Difference]: With dead ends: 33 [2020-07-17 22:51:00,163 INFO L226 Difference]: Without dead ends: 28 [2020-07-17 22:51:00,164 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:51:00,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-17 22:51:00,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-17 22:51:00,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:00,181 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-17 22:51:00,181 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-17 22:51:00,182 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-17 22:51:00,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:00,184 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2020-07-17 22:51:00,184 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-17 22:51:00,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:00,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:00,185 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-17 22:51:00,185 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-17 22:51:00,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:00,188 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2020-07-17 22:51:00,188 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-17 22:51:00,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:00,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:00,189 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:00,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:00,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-17 22:51:00,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2020-07-17 22:51:00,191 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 18 [2020-07-17 22:51:00,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:00,191 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2020-07-17 22:51:00,191 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:51:00,191 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-17 22:51:00,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:51:00,192 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:00,193 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:51:00,405 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:51:00,406 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:00,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:00,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1169510792, now seen corresponding path program 1 times [2020-07-17 22:51:00,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:00,408 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239060208] [2020-07-17 22:51:00,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:00,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:00,517 INFO L280 TraceCheckUtils]: 0: Hoare triple {732#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {724#true} is VALID [2020-07-17 22:51:00,518 INFO L280 TraceCheckUtils]: 1: Hoare triple {724#true} assume true; {724#true} is VALID [2020-07-17 22:51:00,518 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {724#true} {724#true} #54#return; {724#true} is VALID [2020-07-17 22:51:00,520 INFO L263 TraceCheckUtils]: 0: Hoare triple {724#true} call ULTIMATE.init(); {732#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:51:00,520 INFO L280 TraceCheckUtils]: 1: Hoare triple {732#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {724#true} is VALID [2020-07-17 22:51:00,520 INFO L280 TraceCheckUtils]: 2: Hoare triple {724#true} assume true; {724#true} is VALID [2020-07-17 22:51:00,521 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {724#true} {724#true} #54#return; {724#true} is VALID [2020-07-17 22:51:00,521 INFO L263 TraceCheckUtils]: 4: Hoare triple {724#true} call #t~ret4 := main(); {724#true} is VALID [2020-07-17 22:51:00,522 INFO L280 TraceCheckUtils]: 5: Hoare triple {724#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {729#(= 0 main_~i~0)} is VALID [2020-07-17 22:51:00,523 INFO L280 TraceCheckUtils]: 6: Hoare triple {729#(= 0 main_~i~0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {729#(= 0 main_~i~0)} is VALID [2020-07-17 22:51:00,523 INFO L280 TraceCheckUtils]: 7: Hoare triple {729#(= 0 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {730#(<= main_~i~0 1)} is VALID [2020-07-17 22:51:00,524 INFO L280 TraceCheckUtils]: 8: Hoare triple {730#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {730#(<= main_~i~0 1)} is VALID [2020-07-17 22:51:00,525 INFO L280 TraceCheckUtils]: 9: Hoare triple {730#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {731#(<= main_~i~0 2)} is VALID [2020-07-17 22:51:00,526 INFO L280 TraceCheckUtils]: 10: Hoare triple {731#(<= main_~i~0 2)} assume !(~i~0 < 1024); {725#false} is VALID [2020-07-17 22:51:00,526 INFO L280 TraceCheckUtils]: 11: Hoare triple {725#false} ~i~0 := 0; {725#false} is VALID [2020-07-17 22:51:00,527 INFO L280 TraceCheckUtils]: 12: Hoare triple {725#false} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {725#false} is VALID [2020-07-17 22:51:00,527 INFO L280 TraceCheckUtils]: 13: Hoare triple {725#false} assume !!(0 != #t~mem3);havoc #t~mem3; {725#false} is VALID [2020-07-17 22:51:00,527 INFO L280 TraceCheckUtils]: 14: Hoare triple {725#false} assume !(~i~0 >= 1023); {725#false} is VALID [2020-07-17 22:51:00,528 INFO L280 TraceCheckUtils]: 15: Hoare triple {725#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {725#false} is VALID [2020-07-17 22:51:00,528 INFO L280 TraceCheckUtils]: 16: Hoare triple {725#false} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {725#false} is VALID [2020-07-17 22:51:00,528 INFO L280 TraceCheckUtils]: 17: Hoare triple {725#false} assume !(0 != #t~mem3);havoc #t~mem3; {725#false} is VALID [2020-07-17 22:51:00,528 INFO L263 TraceCheckUtils]: 18: Hoare triple {725#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {725#false} is VALID [2020-07-17 22:51:00,529 INFO L280 TraceCheckUtils]: 19: Hoare triple {725#false} ~cond := #in~cond; {725#false} is VALID [2020-07-17 22:51:00,529 INFO L280 TraceCheckUtils]: 20: Hoare triple {725#false} assume 0 == ~cond; {725#false} is VALID [2020-07-17 22:51:00,529 INFO L280 TraceCheckUtils]: 21: Hoare triple {725#false} assume !false; {725#false} is VALID [2020-07-17 22:51:00,530 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-17 22:51:00,530 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239060208] [2020-07-17 22:51:00,531 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268168958] [2020-07-17 22:51:00,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:51:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:00,573 INFO L264 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-17 22:51:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:00,584 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:51:00,637 INFO L263 TraceCheckUtils]: 0: Hoare triple {724#true} call ULTIMATE.init(); {724#true} is VALID [2020-07-17 22:51:00,637 INFO L280 TraceCheckUtils]: 1: Hoare triple {724#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {724#true} is VALID [2020-07-17 22:51:00,638 INFO L280 TraceCheckUtils]: 2: Hoare triple {724#true} assume true; {724#true} is VALID [2020-07-17 22:51:00,638 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {724#true} {724#true} #54#return; {724#true} is VALID [2020-07-17 22:51:00,638 INFO L263 TraceCheckUtils]: 4: Hoare triple {724#true} call #t~ret4 := main(); {724#true} is VALID [2020-07-17 22:51:00,639 INFO L280 TraceCheckUtils]: 5: Hoare triple {724#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {751#(<= main_~i~0 0)} is VALID [2020-07-17 22:51:00,640 INFO L280 TraceCheckUtils]: 6: Hoare triple {751#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {751#(<= main_~i~0 0)} is VALID [2020-07-17 22:51:00,641 INFO L280 TraceCheckUtils]: 7: Hoare triple {751#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {730#(<= main_~i~0 1)} is VALID [2020-07-17 22:51:00,642 INFO L280 TraceCheckUtils]: 8: Hoare triple {730#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {730#(<= main_~i~0 1)} is VALID [2020-07-17 22:51:00,643 INFO L280 TraceCheckUtils]: 9: Hoare triple {730#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {731#(<= main_~i~0 2)} is VALID [2020-07-17 22:51:00,644 INFO L280 TraceCheckUtils]: 10: Hoare triple {731#(<= main_~i~0 2)} assume !(~i~0 < 1024); {725#false} is VALID [2020-07-17 22:51:00,644 INFO L280 TraceCheckUtils]: 11: Hoare triple {725#false} ~i~0 := 0; {725#false} is VALID [2020-07-17 22:51:00,645 INFO L280 TraceCheckUtils]: 12: Hoare triple {725#false} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {725#false} is VALID [2020-07-17 22:51:00,645 INFO L280 TraceCheckUtils]: 13: Hoare triple {725#false} assume !!(0 != #t~mem3);havoc #t~mem3; {725#false} is VALID [2020-07-17 22:51:00,645 INFO L280 TraceCheckUtils]: 14: Hoare triple {725#false} assume !(~i~0 >= 1023); {725#false} is VALID [2020-07-17 22:51:00,645 INFO L280 TraceCheckUtils]: 15: Hoare triple {725#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {725#false} is VALID [2020-07-17 22:51:00,646 INFO L280 TraceCheckUtils]: 16: Hoare triple {725#false} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {725#false} is VALID [2020-07-17 22:51:00,646 INFO L280 TraceCheckUtils]: 17: Hoare triple {725#false} assume !(0 != #t~mem3);havoc #t~mem3; {725#false} is VALID [2020-07-17 22:51:00,646 INFO L263 TraceCheckUtils]: 18: Hoare triple {725#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {725#false} is VALID [2020-07-17 22:51:00,647 INFO L280 TraceCheckUtils]: 19: Hoare triple {725#false} ~cond := #in~cond; {725#false} is VALID [2020-07-17 22:51:00,647 INFO L280 TraceCheckUtils]: 20: Hoare triple {725#false} assume 0 == ~cond; {725#false} is VALID [2020-07-17 22:51:00,647 INFO L280 TraceCheckUtils]: 21: Hoare triple {725#false} assume !false; {725#false} is VALID [2020-07-17 22:51:00,648 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-17 22:51:00,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:51:00,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2020-07-17 22:51:00,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409714115] [2020-07-17 22:51:00,649 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-17 22:51:00,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:00,650 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:51:00,680 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:00,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:51:00,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:00,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:51:00,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:51:00,681 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 7 states. [2020-07-17 22:51:00,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:00,913 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2020-07-17 22:51:00,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:51:00,914 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-17 22:51:00,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:00,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:51:00,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2020-07-17 22:51:00,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:51:00,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2020-07-17 22:51:00,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2020-07-17 22:51:01,005 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:01,007 INFO L225 Difference]: With dead ends: 55 [2020-07-17 22:51:01,007 INFO L226 Difference]: Without dead ends: 38 [2020-07-17 22:51:01,008 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:51:01,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-17 22:51:01,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2020-07-17 22:51:01,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:01,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 34 states. [2020-07-17 22:51:01,033 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 34 states. [2020-07-17 22:51:01,033 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 34 states. [2020-07-17 22:51:01,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:01,036 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2020-07-17 22:51:01,036 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2020-07-17 22:51:01,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:01,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:01,037 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 38 states. [2020-07-17 22:51:01,037 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 38 states. [2020-07-17 22:51:01,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:01,040 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2020-07-17 22:51:01,040 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2020-07-17 22:51:01,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:01,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:01,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:01,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:01,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-17 22:51:01,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2020-07-17 22:51:01,043 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 22 [2020-07-17 22:51:01,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:01,044 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2020-07-17 22:51:01,044 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:51:01,044 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2020-07-17 22:51:01,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:51:01,045 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:01,045 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:51:01,254 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:51:01,254 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:01,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:01,255 INFO L82 PathProgramCache]: Analyzing trace with hash -621810598, now seen corresponding path program 2 times [2020-07-17 22:51:01,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:01,256 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314091727] [2020-07-17 22:51:01,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:01,364 INFO L280 TraceCheckUtils]: 0: Hoare triple {1008#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {999#true} is VALID [2020-07-17 22:51:01,365 INFO L280 TraceCheckUtils]: 1: Hoare triple {999#true} assume true; {999#true} is VALID [2020-07-17 22:51:01,365 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {999#true} {999#true} #54#return; {999#true} is VALID [2020-07-17 22:51:01,367 INFO L263 TraceCheckUtils]: 0: Hoare triple {999#true} call ULTIMATE.init(); {1008#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:51:01,367 INFO L280 TraceCheckUtils]: 1: Hoare triple {1008#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {999#true} is VALID [2020-07-17 22:51:01,367 INFO L280 TraceCheckUtils]: 2: Hoare triple {999#true} assume true; {999#true} is VALID [2020-07-17 22:51:01,367 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {999#true} {999#true} #54#return; {999#true} is VALID [2020-07-17 22:51:01,368 INFO L263 TraceCheckUtils]: 4: Hoare triple {999#true} call #t~ret4 := main(); {999#true} is VALID [2020-07-17 22:51:01,368 INFO L280 TraceCheckUtils]: 5: Hoare triple {999#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1004#(= 0 main_~i~0)} is VALID [2020-07-17 22:51:01,369 INFO L280 TraceCheckUtils]: 6: Hoare triple {1004#(= 0 main_~i~0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1004#(= 0 main_~i~0)} is VALID [2020-07-17 22:51:01,369 INFO L280 TraceCheckUtils]: 7: Hoare triple {1004#(= 0 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1005#(<= main_~i~0 1)} is VALID [2020-07-17 22:51:01,370 INFO L280 TraceCheckUtils]: 8: Hoare triple {1005#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1005#(<= main_~i~0 1)} is VALID [2020-07-17 22:51:01,371 INFO L280 TraceCheckUtils]: 9: Hoare triple {1005#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1006#(<= main_~i~0 2)} is VALID [2020-07-17 22:51:01,372 INFO L280 TraceCheckUtils]: 10: Hoare triple {1006#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1006#(<= main_~i~0 2)} is VALID [2020-07-17 22:51:01,373 INFO L280 TraceCheckUtils]: 11: Hoare triple {1006#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1007#(<= main_~i~0 3)} is VALID [2020-07-17 22:51:01,375 INFO L280 TraceCheckUtils]: 12: Hoare triple {1007#(<= main_~i~0 3)} assume !(~i~0 < 1024); {1000#false} is VALID [2020-07-17 22:51:01,375 INFO L280 TraceCheckUtils]: 13: Hoare triple {1000#false} ~i~0 := 0; {1000#false} is VALID [2020-07-17 22:51:01,375 INFO L280 TraceCheckUtils]: 14: Hoare triple {1000#false} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1000#false} is VALID [2020-07-17 22:51:01,376 INFO L280 TraceCheckUtils]: 15: Hoare triple {1000#false} assume !!(0 != #t~mem3);havoc #t~mem3; {1000#false} is VALID [2020-07-17 22:51:01,376 INFO L280 TraceCheckUtils]: 16: Hoare triple {1000#false} assume !(~i~0 >= 1023); {1000#false} is VALID [2020-07-17 22:51:01,376 INFO L280 TraceCheckUtils]: 17: Hoare triple {1000#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1000#false} is VALID [2020-07-17 22:51:01,376 INFO L280 TraceCheckUtils]: 18: Hoare triple {1000#false} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1000#false} is VALID [2020-07-17 22:51:01,377 INFO L280 TraceCheckUtils]: 19: Hoare triple {1000#false} assume !(0 != #t~mem3);havoc #t~mem3; {1000#false} is VALID [2020-07-17 22:51:01,377 INFO L263 TraceCheckUtils]: 20: Hoare triple {1000#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {1000#false} is VALID [2020-07-17 22:51:01,377 INFO L280 TraceCheckUtils]: 21: Hoare triple {1000#false} ~cond := #in~cond; {1000#false} is VALID [2020-07-17 22:51:01,377 INFO L280 TraceCheckUtils]: 22: Hoare triple {1000#false} assume 0 == ~cond; {1000#false} is VALID [2020-07-17 22:51:01,378 INFO L280 TraceCheckUtils]: 23: Hoare triple {1000#false} assume !false; {1000#false} is VALID [2020-07-17 22:51:01,378 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-17 22:51:01,379 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314091727] [2020-07-17 22:51:01,379 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761112163] [2020-07-17 22:51:01,379 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:51:01,412 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:51:01,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:51:01,414 INFO L264 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-17 22:51:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:01,436 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:51:01,512 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:51:01,565 INFO L263 TraceCheckUtils]: 0: Hoare triple {999#true} call ULTIMATE.init(); {999#true} is VALID [2020-07-17 22:51:01,566 INFO L280 TraceCheckUtils]: 1: Hoare triple {999#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {999#true} is VALID [2020-07-17 22:51:01,566 INFO L280 TraceCheckUtils]: 2: Hoare triple {999#true} assume true; {999#true} is VALID [2020-07-17 22:51:01,567 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {999#true} {999#true} #54#return; {999#true} is VALID [2020-07-17 22:51:01,567 INFO L263 TraceCheckUtils]: 4: Hoare triple {999#true} call #t~ret4 := main(); {999#true} is VALID [2020-07-17 22:51:01,567 INFO L280 TraceCheckUtils]: 5: Hoare triple {999#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {999#true} is VALID [2020-07-17 22:51:01,568 INFO L280 TraceCheckUtils]: 6: Hoare triple {999#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {999#true} is VALID [2020-07-17 22:51:01,568 INFO L280 TraceCheckUtils]: 7: Hoare triple {999#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {999#true} is VALID [2020-07-17 22:51:01,568 INFO L280 TraceCheckUtils]: 8: Hoare triple {999#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {999#true} is VALID [2020-07-17 22:51:01,568 INFO L280 TraceCheckUtils]: 9: Hoare triple {999#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {999#true} is VALID [2020-07-17 22:51:01,569 INFO L280 TraceCheckUtils]: 10: Hoare triple {999#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {999#true} is VALID [2020-07-17 22:51:01,569 INFO L280 TraceCheckUtils]: 11: Hoare triple {999#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {999#true} is VALID [2020-07-17 22:51:01,569 INFO L280 TraceCheckUtils]: 12: Hoare triple {999#true} assume !(~i~0 < 1024); {999#true} is VALID [2020-07-17 22:51:01,571 INFO L280 TraceCheckUtils]: 13: Hoare triple {999#true} ~i~0 := 0; {1051#(<= main_~i~0 0)} is VALID [2020-07-17 22:51:01,573 INFO L280 TraceCheckUtils]: 14: Hoare triple {1051#(<= main_~i~0 0)} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1051#(<= main_~i~0 0)} is VALID [2020-07-17 22:51:01,574 INFO L280 TraceCheckUtils]: 15: Hoare triple {1051#(<= main_~i~0 0)} assume !!(0 != #t~mem3);havoc #t~mem3; {1051#(<= main_~i~0 0)} is VALID [2020-07-17 22:51:01,574 INFO L280 TraceCheckUtils]: 16: Hoare triple {1051#(<= main_~i~0 0)} assume !(~i~0 >= 1023); {1051#(<= main_~i~0 0)} is VALID [2020-07-17 22:51:01,575 INFO L280 TraceCheckUtils]: 17: Hoare triple {1051#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1005#(<= main_~i~0 1)} is VALID [2020-07-17 22:51:01,575 INFO L280 TraceCheckUtils]: 18: Hoare triple {1005#(<= main_~i~0 1)} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1005#(<= main_~i~0 1)} is VALID [2020-07-17 22:51:01,576 INFO L280 TraceCheckUtils]: 19: Hoare triple {1005#(<= main_~i~0 1)} assume !(0 != #t~mem3);havoc #t~mem3; {1005#(<= main_~i~0 1)} is VALID [2020-07-17 22:51:01,577 INFO L263 TraceCheckUtils]: 20: Hoare triple {1005#(<= main_~i~0 1)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {1073#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:51:01,579 INFO L280 TraceCheckUtils]: 21: Hoare triple {1073#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1077#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:51:01,580 INFO L280 TraceCheckUtils]: 22: Hoare triple {1077#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1000#false} is VALID [2020-07-17 22:51:01,581 INFO L280 TraceCheckUtils]: 23: Hoare triple {1000#false} assume !false; {1000#false} is VALID [2020-07-17 22:51:01,582 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-17 22:51:01,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:51:01,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2020-07-17 22:51:01,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261314804] [2020-07-17 22:51:01,583 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-07-17 22:51:01,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:01,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-17 22:51:01,644 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-17 22:51:01,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 22:51:01,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:01,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 22:51:01,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:51:01,646 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 10 states. [2020-07-17 22:51:02,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:02,031 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2020-07-17 22:51:02,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 22:51:02,031 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-07-17 22:51:02,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:02,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:51:02,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2020-07-17 22:51:02,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:51:02,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2020-07-17 22:51:02,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 65 transitions. [2020-07-17 22:51:02,124 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-17 22:51:02,126 INFO L225 Difference]: With dead ends: 68 [2020-07-17 22:51:02,126 INFO L226 Difference]: Without dead ends: 42 [2020-07-17 22:51:02,127 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-07-17 22:51:02,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-17 22:51:02,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2020-07-17 22:51:02,151 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:02,151 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 40 states. [2020-07-17 22:51:02,151 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 40 states. [2020-07-17 22:51:02,151 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 40 states. [2020-07-17 22:51:02,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:02,154 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2020-07-17 22:51:02,154 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2020-07-17 22:51:02,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:02,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:02,155 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 42 states. [2020-07-17 22:51:02,155 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 42 states. [2020-07-17 22:51:02,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:02,161 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2020-07-17 22:51:02,161 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2020-07-17 22:51:02,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:02,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:02,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:02,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:02,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-17 22:51:02,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2020-07-17 22:51:02,169 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 24 [2020-07-17 22:51:02,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:02,169 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2020-07-17 22:51:02,170 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 22:51:02,170 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2020-07-17 22:51:02,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-17 22:51:02,171 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:02,171 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:51:02,371 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:51:02,372 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:02,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:02,373 INFO L82 PathProgramCache]: Analyzing trace with hash -36696111, now seen corresponding path program 3 times [2020-07-17 22:51:02,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:02,374 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804360075] [2020-07-17 22:51:02,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:02,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:02,507 INFO L280 TraceCheckUtils]: 0: Hoare triple {1331#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1321#true} is VALID [2020-07-17 22:51:02,507 INFO L280 TraceCheckUtils]: 1: Hoare triple {1321#true} assume true; {1321#true} is VALID [2020-07-17 22:51:02,508 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1321#true} {1321#true} #54#return; {1321#true} is VALID [2020-07-17 22:51:02,509 INFO L263 TraceCheckUtils]: 0: Hoare triple {1321#true} call ULTIMATE.init(); {1331#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:51:02,509 INFO L280 TraceCheckUtils]: 1: Hoare triple {1331#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1321#true} is VALID [2020-07-17 22:51:02,509 INFO L280 TraceCheckUtils]: 2: Hoare triple {1321#true} assume true; {1321#true} is VALID [2020-07-17 22:51:02,509 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1321#true} {1321#true} #54#return; {1321#true} is VALID [2020-07-17 22:51:02,510 INFO L263 TraceCheckUtils]: 4: Hoare triple {1321#true} call #t~ret4 := main(); {1321#true} is VALID [2020-07-17 22:51:02,510 INFO L280 TraceCheckUtils]: 5: Hoare triple {1321#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1326#(= 0 main_~i~0)} is VALID [2020-07-17 22:51:02,511 INFO L280 TraceCheckUtils]: 6: Hoare triple {1326#(= 0 main_~i~0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1326#(= 0 main_~i~0)} is VALID [2020-07-17 22:51:02,512 INFO L280 TraceCheckUtils]: 7: Hoare triple {1326#(= 0 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1327#(<= main_~i~0 1)} is VALID [2020-07-17 22:51:02,513 INFO L280 TraceCheckUtils]: 8: Hoare triple {1327#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1327#(<= main_~i~0 1)} is VALID [2020-07-17 22:51:02,514 INFO L280 TraceCheckUtils]: 9: Hoare triple {1327#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1328#(<= main_~i~0 2)} is VALID [2020-07-17 22:51:02,514 INFO L280 TraceCheckUtils]: 10: Hoare triple {1328#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1328#(<= main_~i~0 2)} is VALID [2020-07-17 22:51:02,515 INFO L280 TraceCheckUtils]: 11: Hoare triple {1328#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1329#(<= main_~i~0 3)} is VALID [2020-07-17 22:51:02,516 INFO L280 TraceCheckUtils]: 12: Hoare triple {1329#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1329#(<= main_~i~0 3)} is VALID [2020-07-17 22:51:02,517 INFO L280 TraceCheckUtils]: 13: Hoare triple {1329#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1330#(<= main_~i~0 4)} is VALID [2020-07-17 22:51:02,518 INFO L280 TraceCheckUtils]: 14: Hoare triple {1330#(<= main_~i~0 4)} assume !(~i~0 < 1024); {1322#false} is VALID [2020-07-17 22:51:02,518 INFO L280 TraceCheckUtils]: 15: Hoare triple {1322#false} ~i~0 := 0; {1322#false} is VALID [2020-07-17 22:51:02,518 INFO L280 TraceCheckUtils]: 16: Hoare triple {1322#false} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1322#false} is VALID [2020-07-17 22:51:02,518 INFO L280 TraceCheckUtils]: 17: Hoare triple {1322#false} assume !!(0 != #t~mem3);havoc #t~mem3; {1322#false} is VALID [2020-07-17 22:51:02,519 INFO L280 TraceCheckUtils]: 18: Hoare triple {1322#false} assume !(~i~0 >= 1023); {1322#false} is VALID [2020-07-17 22:51:02,519 INFO L280 TraceCheckUtils]: 19: Hoare triple {1322#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1322#false} is VALID [2020-07-17 22:51:02,519 INFO L280 TraceCheckUtils]: 20: Hoare triple {1322#false} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1322#false} is VALID [2020-07-17 22:51:02,519 INFO L280 TraceCheckUtils]: 21: Hoare triple {1322#false} assume !!(0 != #t~mem3);havoc #t~mem3; {1322#false} is VALID [2020-07-17 22:51:02,519 INFO L280 TraceCheckUtils]: 22: Hoare triple {1322#false} assume !(~i~0 >= 1023); {1322#false} is VALID [2020-07-17 22:51:02,520 INFO L280 TraceCheckUtils]: 23: Hoare triple {1322#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1322#false} is VALID [2020-07-17 22:51:02,520 INFO L280 TraceCheckUtils]: 24: Hoare triple {1322#false} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1322#false} is VALID [2020-07-17 22:51:02,520 INFO L280 TraceCheckUtils]: 25: Hoare triple {1322#false} assume !!(0 != #t~mem3);havoc #t~mem3; {1322#false} is VALID [2020-07-17 22:51:02,521 INFO L280 TraceCheckUtils]: 26: Hoare triple {1322#false} assume !(~i~0 >= 1023); {1322#false} is VALID [2020-07-17 22:51:02,521 INFO L280 TraceCheckUtils]: 27: Hoare triple {1322#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1322#false} is VALID [2020-07-17 22:51:02,521 INFO L280 TraceCheckUtils]: 28: Hoare triple {1322#false} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1322#false} is VALID [2020-07-17 22:51:02,521 INFO L280 TraceCheckUtils]: 29: Hoare triple {1322#false} assume !!(0 != #t~mem3);havoc #t~mem3; {1322#false} is VALID [2020-07-17 22:51:02,522 INFO L280 TraceCheckUtils]: 30: Hoare triple {1322#false} assume !(~i~0 >= 1023); {1322#false} is VALID [2020-07-17 22:51:02,522 INFO L280 TraceCheckUtils]: 31: Hoare triple {1322#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1322#false} is VALID [2020-07-17 22:51:02,522 INFO L280 TraceCheckUtils]: 32: Hoare triple {1322#false} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1322#false} is VALID [2020-07-17 22:51:02,522 INFO L280 TraceCheckUtils]: 33: Hoare triple {1322#false} assume !(0 != #t~mem3);havoc #t~mem3; {1322#false} is VALID [2020-07-17 22:51:02,523 INFO L263 TraceCheckUtils]: 34: Hoare triple {1322#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {1322#false} is VALID [2020-07-17 22:51:02,523 INFO L280 TraceCheckUtils]: 35: Hoare triple {1322#false} ~cond := #in~cond; {1322#false} is VALID [2020-07-17 22:51:02,523 INFO L280 TraceCheckUtils]: 36: Hoare triple {1322#false} assume 0 == ~cond; {1322#false} is VALID [2020-07-17 22:51:02,524 INFO L280 TraceCheckUtils]: 37: Hoare triple {1322#false} assume !false; {1322#false} is VALID [2020-07-17 22:51:02,525 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-07-17 22:51:02,526 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804360075] [2020-07-17 22:51:02,526 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525934969] [2020-07-17 22:51:02,526 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:51:02,571 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-07-17 22:51:02,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:51:02,572 INFO L264 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-17 22:51:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:02,586 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:51:02,664 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:51:02,710 INFO L263 TraceCheckUtils]: 0: Hoare triple {1321#true} call ULTIMATE.init(); {1321#true} is VALID [2020-07-17 22:51:02,711 INFO L280 TraceCheckUtils]: 1: Hoare triple {1321#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1321#true} is VALID [2020-07-17 22:51:02,711 INFO L280 TraceCheckUtils]: 2: Hoare triple {1321#true} assume true; {1321#true} is VALID [2020-07-17 22:51:02,711 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1321#true} {1321#true} #54#return; {1321#true} is VALID [2020-07-17 22:51:02,712 INFO L263 TraceCheckUtils]: 4: Hoare triple {1321#true} call #t~ret4 := main(); {1321#true} is VALID [2020-07-17 22:51:02,712 INFO L280 TraceCheckUtils]: 5: Hoare triple {1321#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1321#true} is VALID [2020-07-17 22:51:02,712 INFO L280 TraceCheckUtils]: 6: Hoare triple {1321#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1321#true} is VALID [2020-07-17 22:51:02,712 INFO L280 TraceCheckUtils]: 7: Hoare triple {1321#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1321#true} is VALID [2020-07-17 22:51:02,713 INFO L280 TraceCheckUtils]: 8: Hoare triple {1321#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1321#true} is VALID [2020-07-17 22:51:02,713 INFO L280 TraceCheckUtils]: 9: Hoare triple {1321#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1321#true} is VALID [2020-07-17 22:51:02,713 INFO L280 TraceCheckUtils]: 10: Hoare triple {1321#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1321#true} is VALID [2020-07-17 22:51:02,714 INFO L280 TraceCheckUtils]: 11: Hoare triple {1321#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1321#true} is VALID [2020-07-17 22:51:02,714 INFO L280 TraceCheckUtils]: 12: Hoare triple {1321#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1321#true} is VALID [2020-07-17 22:51:02,714 INFO L280 TraceCheckUtils]: 13: Hoare triple {1321#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1321#true} is VALID [2020-07-17 22:51:02,714 INFO L280 TraceCheckUtils]: 14: Hoare triple {1321#true} assume !(~i~0 < 1024); {1321#true} is VALID [2020-07-17 22:51:02,715 INFO L280 TraceCheckUtils]: 15: Hoare triple {1321#true} ~i~0 := 0; {1321#true} is VALID [2020-07-17 22:51:02,715 INFO L280 TraceCheckUtils]: 16: Hoare triple {1321#true} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1321#true} is VALID [2020-07-17 22:51:02,715 INFO L280 TraceCheckUtils]: 17: Hoare triple {1321#true} assume !!(0 != #t~mem3);havoc #t~mem3; {1321#true} is VALID [2020-07-17 22:51:02,715 INFO L280 TraceCheckUtils]: 18: Hoare triple {1321#true} assume !(~i~0 >= 1023); {1321#true} is VALID [2020-07-17 22:51:02,715 INFO L280 TraceCheckUtils]: 19: Hoare triple {1321#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1321#true} is VALID [2020-07-17 22:51:02,716 INFO L280 TraceCheckUtils]: 20: Hoare triple {1321#true} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1321#true} is VALID [2020-07-17 22:51:02,716 INFO L280 TraceCheckUtils]: 21: Hoare triple {1321#true} assume !!(0 != #t~mem3);havoc #t~mem3; {1321#true} is VALID [2020-07-17 22:51:02,716 INFO L280 TraceCheckUtils]: 22: Hoare triple {1321#true} assume !(~i~0 >= 1023); {1321#true} is VALID [2020-07-17 22:51:02,716 INFO L280 TraceCheckUtils]: 23: Hoare triple {1321#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1321#true} is VALID [2020-07-17 22:51:02,717 INFO L280 TraceCheckUtils]: 24: Hoare triple {1321#true} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1321#true} is VALID [2020-07-17 22:51:02,717 INFO L280 TraceCheckUtils]: 25: Hoare triple {1321#true} assume !!(0 != #t~mem3);havoc #t~mem3; {1321#true} is VALID [2020-07-17 22:51:02,717 INFO L280 TraceCheckUtils]: 26: Hoare triple {1321#true} assume !(~i~0 >= 1023); {1321#true} is VALID [2020-07-17 22:51:02,718 INFO L280 TraceCheckUtils]: 27: Hoare triple {1321#true} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1321#true} is VALID [2020-07-17 22:51:02,718 INFO L280 TraceCheckUtils]: 28: Hoare triple {1321#true} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1321#true} is VALID [2020-07-17 22:51:02,718 INFO L280 TraceCheckUtils]: 29: Hoare triple {1321#true} assume !!(0 != #t~mem3);havoc #t~mem3; {1321#true} is VALID [2020-07-17 22:51:02,719 INFO L280 TraceCheckUtils]: 30: Hoare triple {1321#true} assume !(~i~0 >= 1023); {1425#(< main_~i~0 1023)} is VALID [2020-07-17 22:51:02,720 INFO L280 TraceCheckUtils]: 31: Hoare triple {1425#(< main_~i~0 1023)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1429#(<= main_~i~0 1023)} is VALID [2020-07-17 22:51:02,721 INFO L280 TraceCheckUtils]: 32: Hoare triple {1429#(<= main_~i~0 1023)} call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1429#(<= main_~i~0 1023)} is VALID [2020-07-17 22:51:02,722 INFO L280 TraceCheckUtils]: 33: Hoare triple {1429#(<= main_~i~0 1023)} assume !(0 != #t~mem3);havoc #t~mem3; {1429#(<= main_~i~0 1023)} is VALID [2020-07-17 22:51:02,723 INFO L263 TraceCheckUtils]: 34: Hoare triple {1429#(<= main_~i~0 1023)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {1439#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:51:02,724 INFO L280 TraceCheckUtils]: 35: Hoare triple {1439#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1443#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:51:02,725 INFO L280 TraceCheckUtils]: 36: Hoare triple {1443#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1322#false} is VALID [2020-07-17 22:51:02,725 INFO L280 TraceCheckUtils]: 37: Hoare triple {1322#false} assume !false; {1322#false} is VALID [2020-07-17 22:51:02,727 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2020-07-17 22:51:02,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:51:02,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2020-07-17 22:51:02,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631979086] [2020-07-17 22:51:02,728 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2020-07-17 22:51:02,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:02,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:51:02,755 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:02,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:51:02,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:02,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:51:02,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-07-17 22:51:02,756 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 6 states. [2020-07-17 22:51:02,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:02,898 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2020-07-17 22:51:02,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:51:02,898 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2020-07-17 22:51:02,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:02,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:51:02,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2020-07-17 22:51:02,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:51:02,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2020-07-17 22:51:02,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2020-07-17 22:51:02,936 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:02,936 INFO L225 Difference]: With dead ends: 40 [2020-07-17 22:51:02,936 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:51:02,937 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-07-17 22:51:02,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:51:02,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:51:02,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:02,938 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:02,938 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:02,938 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:02,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:02,939 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:51:02,939 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:51:02,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:02,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:02,939 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:02,940 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:02,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:02,940 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:51:02,940 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:51:02,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:02,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:02,941 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:02,941 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:02,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:51:02,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:51:02,941 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2020-07-17 22:51:02,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:02,941 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:51:02,942 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:51:02,942 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:51:02,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:03,149 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-17 22:51:03,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:51:03,265 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:51:03,265 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-07-17 22:51:03,265 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:51:03,266 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:51:03,266 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:51:03,266 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:51:03,266 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:51:03,266 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 9 23) no Hoare annotation was computed. [2020-07-17 22:51:03,266 INFO L268 CegarLoopResult]: For program point L17-1(lines 17 21) no Hoare annotation was computed. [2020-07-17 22:51:03,266 INFO L268 CegarLoopResult]: For program point L17-3(lines 17 21) no Hoare annotation was computed. [2020-07-17 22:51:03,266 INFO L264 CegarLoopResult]: At program point L17-4(lines 17 21) the Hoare annotation is: (<= main_~i~0 1023) [2020-07-17 22:51:03,266 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 9 23) no Hoare annotation was computed. [2020-07-17 22:51:03,266 INFO L264 CegarLoopResult]: At program point L17-5(lines 17 21) the Hoare annotation is: (<= main_~i~0 1023) [2020-07-17 22:51:03,266 INFO L268 CegarLoopResult]: For program point L13-2(lines 13 15) no Hoare annotation was computed. [2020-07-17 22:51:03,266 INFO L271 CegarLoopResult]: At program point L13-3(lines 13 15) the Hoare annotation is: true [2020-07-17 22:51:03,267 INFO L268 CegarLoopResult]: For program point L13-4(lines 13 15) no Hoare annotation was computed. [2020-07-17 22:51:03,267 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 9 23) the Hoare annotation is: (= |#valid| |old(#valid)|) [2020-07-17 22:51:03,267 INFO L268 CegarLoopResult]: For program point L22(line 22) no Hoare annotation was computed. [2020-07-17 22:51:03,267 INFO L268 CegarLoopResult]: For program point L18(lines 18 20) no Hoare annotation was computed. [2020-07-17 22:51:03,267 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2020-07-17 22:51:03,267 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2020-07-17 22:51:03,267 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-17 22:51:03,267 INFO L268 CegarLoopResult]: For program point L4(lines 4 6) no Hoare annotation was computed. [2020-07-17 22:51:03,267 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2020-07-17 22:51:03,268 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2020-07-17 22:51:03,271 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:51:03,272 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:51:03,273 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:51:03,273 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:51:03,273 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2020-07-17 22:51:03,273 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2020-07-17 22:51:03,273 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2020-07-17 22:51:03,273 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:51:03,273 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:51:03,273 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:51:03,274 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:51:03,274 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2020-07-17 22:51:03,274 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2020-07-17 22:51:03,274 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:51:03,274 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:51:03,274 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-17 22:51:03,274 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2020-07-17 22:51:03,278 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:03,278 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2020-07-17 22:51:03,279 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2020-07-17 22:51:03,279 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:51:03,279 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:51:03,279 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-17 22:51:03,279 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-17 22:51:03,279 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:51:03,279 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2020-07-17 22:51:03,279 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:51:03,280 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:51:03,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:51:03 BoogieIcfgContainer [2020-07-17 22:51:03,293 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:51:03,297 INFO L168 Benchmark]: Toolchain (without parser) took 6512.81 ms. Allocated memory was 136.3 MB in the beginning and 286.8 MB in the end (delta: 150.5 MB). Free memory was 101.6 MB in the beginning and 176.0 MB in the end (delta: -74.4 MB). Peak memory consumption was 76.1 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:03,298 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 136.3 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 22:51:03,299 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.71 ms. Allocated memory is still 136.3 MB. Free memory was 101.1 MB in the beginning and 91.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:03,300 INFO L168 Benchmark]: Boogie Preprocessor took 129.60 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 91.0 MB in the beginning and 178.4 MB in the end (delta: -87.3 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:03,306 INFO L168 Benchmark]: RCFGBuilder took 423.46 ms. Allocated memory is still 200.3 MB. Free memory was 178.4 MB in the beginning and 159.4 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:03,307 INFO L168 Benchmark]: TraceAbstraction took 5691.88 ms. Allocated memory was 200.3 MB in the beginning and 286.8 MB in the end (delta: 86.5 MB). Free memory was 158.7 MB in the beginning and 176.0 MB in the end (delta: -17.3 MB). Peak memory consumption was 69.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:03,315 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 136.3 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 260.71 ms. Allocated memory is still 136.3 MB. Free memory was 101.1 MB in the beginning and 91.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 129.60 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 91.0 MB in the beginning and 178.4 MB in the end (delta: -87.3 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 423.46 ms. Allocated memory is still 200.3 MB. Free memory was 178.4 MB in the beginning and 159.4 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5691.88 ms. Allocated memory was 200.3 MB in the beginning and 286.8 MB in the end (delta: 86.5 MB). Free memory was 158.7 MB in the beginning and 176.0 MB in the end (delta: -17.3 MB). Peak memory consumption was 69.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: i <= 1023 - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.4s, OverallIterations: 7, TraceHistogramMax: 5, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 101 SDtfs, 80 SDslu, 176 SDs, 0 SdLazy, 292 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 17 PreInvPairs, 31 NumberOfFragments, 23 HoareAnnotationTreeSize, 17 FomulaSimplifications, 21 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 48 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 263 NumberOfCodeBlocks, 241 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 251 ConstructedInterpolants, 0 QuantifiedInterpolants, 10073 SizeOfPredicates, 8 NumberOfNonLiveVariables, 330 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 99/140 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...