java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loop-acceleration/array_true-unreach-call3_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:39:54,908 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:39:54,912 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:39:54,930 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:39:54,930 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:39:54,931 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:39:54,934 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:39:54,936 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:39:54,938 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:39:54,938 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:39:54,939 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:39:54,940 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:39:54,941 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:39:54,942 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:39:54,943 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:39:54,944 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:39:54,945 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:39:54,947 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:39:54,949 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:39:54,951 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:39:54,952 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:39:54,953 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:39:54,956 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:39:54,956 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:39:54,957 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:39:54,958 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:39:54,959 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:39:54,960 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:39:54,961 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:39:54,965 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:39:54,965 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:39:54,966 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:39:54,966 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:39:54,967 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:39:54,968 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:39:54,968 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:39:54,969 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-14 16:39:54,991 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:39:54,991 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:39:54,993 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:39:54,993 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:39:54,994 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:39:54,994 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:39:54,994 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:39:54,996 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:39:54,996 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:39:54,996 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:39:54,996 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:39:54,996 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:39:54,997 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:39:54,997 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:39:54,997 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:39:54,997 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:39:54,997 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:39:54,998 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:39:54,998 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:39:54,998 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:39:54,998 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:39:54,998 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:39:54,999 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:39:54,999 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:39:54,999 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:39:54,999 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:39:54,999 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:39:55,000 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:39:55,001 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:39:55,001 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:39:55,002 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:39:55,002 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:39:55,055 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:39:55,069 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:39:55,075 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:39:55,077 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:39:55,077 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:39:55,078 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_true-unreach-call3_true-termination.i [2018-11-14 16:39:55,148 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/739aab72e/910dd16507314074a7c63f6f7649d386/FLAGdb6410bbb [2018-11-14 16:39:55,593 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:39:55,594 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_true-unreach-call3_true-termination.i [2018-11-14 16:39:55,599 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/739aab72e/910dd16507314074a7c63f6f7649d386/FLAGdb6410bbb [2018-11-14 16:39:55,620 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/739aab72e/910dd16507314074a7c63f6f7649d386 [2018-11-14 16:39:55,632 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:39:55,633 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:39:55,634 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:39:55,635 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:39:55,638 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:39:55,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:39:55" (1/1) ... [2018-11-14 16:39:55,643 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c3c1854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:39:55, skipping insertion in model container [2018-11-14 16:39:55,644 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:39:55" (1/1) ... [2018-11-14 16:39:55,654 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:39:55,682 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:39:55,899 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:39:55,904 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:39:55,928 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:39:55,952 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:39:55,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:39:55 WrapperNode [2018-11-14 16:39:55,952 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:39:55,953 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:39:55,953 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:39:55,953 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:39:55,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:39:55" (1/1) ... [2018-11-14 16:39:55,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:39:55" (1/1) ... [2018-11-14 16:39:55,973 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:39:55" (1/1) ... [2018-11-14 16:39:55,974 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:39:55" (1/1) ... [2018-11-14 16:39:55,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:39:55" (1/1) ... [2018-11-14 16:39:55,990 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:39:55" (1/1) ... [2018-11-14 16:39:55,992 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:39:55" (1/1) ... [2018-11-14 16:39:55,994 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:39:55,995 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:39:55,995 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:39:55,995 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:39:55,996 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:39:55" (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 [2018-11-14 16:39:56,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:39:56,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:39:56,119 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 16:39:56,120 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:39:56,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:39:56,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 16:39:56,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 16:39:56,120 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:39:56,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:39:56,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 16:39:56,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 16:39:56,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:39:56,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:39:56,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:39:56,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 16:39:56,635 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:39:56,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:39:56 BoogieIcfgContainer [2018-11-14 16:39:56,636 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:39:56,637 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:39:56,637 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:39:56,640 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:39:56,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:39:55" (1/3) ... [2018-11-14 16:39:56,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43389093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:39:56, skipping insertion in model container [2018-11-14 16:39:56,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:39:55" (2/3) ... [2018-11-14 16:39:56,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43389093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:39:56, skipping insertion in model container [2018-11-14 16:39:56,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:39:56" (3/3) ... [2018-11-14 16:39:56,644 INFO L112 eAbstractionObserver]: Analyzing ICFG array_true-unreach-call3_true-termination.i [2018-11-14 16:39:56,654 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:39:56,661 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:39:56,676 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:39:56,711 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:39:56,711 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:39:56,712 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:39:56,712 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:39:56,712 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:39:56,712 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:39:56,712 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:39:56,713 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:39:56,713 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:39:56,730 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-11-14 16:39:56,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-14 16:39:56,737 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:39:56,738 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:39:56,741 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:39:56,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:39:56,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1794184535, now seen corresponding path program 1 times [2018-11-14 16:39:56,752 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:39:56,753 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:39:56,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:39:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:56,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:56,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:39:56,914 INFO L256 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {29#true} is VALID [2018-11-14 16:39:56,918 INFO L273 TraceCheckUtils]: 1: Hoare triple {29#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {29#true} is VALID [2018-11-14 16:39:56,918 INFO L273 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2018-11-14 16:39:56,919 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #55#return; {29#true} is VALID [2018-11-14 16:39:56,919 INFO L256 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret4 := main(); {29#true} is VALID [2018-11-14 16:39:56,919 INFO L273 TraceCheckUtils]: 5: Hoare triple {29#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4096bv32);havoc ~i~0;~i~0 := 0bv32; {29#true} is VALID [2018-11-14 16:39:56,920 INFO L273 TraceCheckUtils]: 6: Hoare triple {29#true} assume !true; {30#false} is VALID [2018-11-14 16:39:56,921 INFO L273 TraceCheckUtils]: 7: Hoare triple {30#false} ~i~0 := 0bv32; {30#false} is VALID [2018-11-14 16:39:56,921 INFO L273 TraceCheckUtils]: 8: Hoare triple {30#false} assume !true; {30#false} is VALID [2018-11-14 16:39:56,921 INFO L256 TraceCheckUtils]: 9: Hoare triple {30#false} call __VERIFIER_assert((if ~bvsle32(~i~0, 1024bv32) then 1bv32 else 0bv32)); {30#false} is VALID [2018-11-14 16:39:56,921 INFO L273 TraceCheckUtils]: 10: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2018-11-14 16:39:56,922 INFO L273 TraceCheckUtils]: 11: Hoare triple {30#false} assume ~cond == 0bv32; {30#false} is VALID [2018-11-14 16:39:56,922 INFO L273 TraceCheckUtils]: 12: Hoare triple {30#false} assume !false; {30#false} is VALID [2018-11-14 16:39:56,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:39:56,925 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:39:56,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:39:56,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:39:56,934 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-14 16:39:56,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:39:56,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:39:57,021 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:57,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:39:57,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:39:57,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:39:57,036 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2018-11-14 16:39:57,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:57,395 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2018-11-14 16:39:57,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:39:57,395 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-14 16:39:57,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:39:57,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:39:57,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2018-11-14 16:39:57,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:39:57,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2018-11-14 16:39:57,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 52 transitions. [2018-11-14 16:39:57,593 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:57,606 INFO L225 Difference]: With dead ends: 43 [2018-11-14 16:39:57,608 INFO L226 Difference]: Without dead ends: 19 [2018-11-14 16:39:57,612 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:39:57,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-14 16:39:57,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-14 16:39:57,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:39:57,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-14 16:39:57,715 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-14 16:39:57,715 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-14 16:39:57,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:57,719 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-14 16:39:57,719 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-14 16:39:57,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:57,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:57,720 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-14 16:39:57,721 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-14 16:39:57,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:57,724 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-14 16:39:57,725 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-14 16:39:57,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:57,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:57,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:39:57,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:39:57,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 16:39:57,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-11-14 16:39:57,731 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 13 [2018-11-14 16:39:57,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:39:57,731 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-14 16:39:57,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:39:57,732 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-14 16:39:57,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 16:39:57,732 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:39:57,733 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:39:57,733 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:39:57,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:39:57,734 INFO L82 PathProgramCache]: Analyzing trace with hash 612144665, now seen corresponding path program 1 times [2018-11-14 16:39:57,734 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:39:57,735 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:39:57,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:39:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:57,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:39:57,863 INFO L256 TraceCheckUtils]: 0: Hoare triple {188#true} call ULTIMATE.init(); {188#true} is VALID [2018-11-14 16:39:57,864 INFO L273 TraceCheckUtils]: 1: Hoare triple {188#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {188#true} is VALID [2018-11-14 16:39:57,864 INFO L273 TraceCheckUtils]: 2: Hoare triple {188#true} assume true; {188#true} is VALID [2018-11-14 16:39:57,864 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {188#true} {188#true} #55#return; {188#true} is VALID [2018-11-14 16:39:57,865 INFO L256 TraceCheckUtils]: 4: Hoare triple {188#true} call #t~ret4 := main(); {188#true} is VALID [2018-11-14 16:39:57,865 INFO L273 TraceCheckUtils]: 5: Hoare triple {188#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4096bv32);havoc ~i~0;~i~0 := 0bv32; {208#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:39:57,868 INFO L273 TraceCheckUtils]: 6: Hoare triple {208#(= main_~i~0 (_ bv0 32))} assume true; {208#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:39:57,886 INFO L273 TraceCheckUtils]: 7: Hoare triple {208#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 1024bv32); {189#false} is VALID [2018-11-14 16:39:57,886 INFO L273 TraceCheckUtils]: 8: Hoare triple {189#false} ~i~0 := 0bv32; {189#false} is VALID [2018-11-14 16:39:57,887 INFO L273 TraceCheckUtils]: 9: Hoare triple {189#false} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {189#false} is VALID [2018-11-14 16:39:57,887 INFO L273 TraceCheckUtils]: 10: Hoare triple {189#false} assume !(#t~mem3 != 0bv32);havoc #t~mem3; {189#false} is VALID [2018-11-14 16:39:57,889 INFO L256 TraceCheckUtils]: 11: Hoare triple {189#false} call __VERIFIER_assert((if ~bvsle32(~i~0, 1024bv32) then 1bv32 else 0bv32)); {189#false} is VALID [2018-11-14 16:39:57,889 INFO L273 TraceCheckUtils]: 12: Hoare triple {189#false} ~cond := #in~cond; {189#false} is VALID [2018-11-14 16:39:57,890 INFO L273 TraceCheckUtils]: 13: Hoare triple {189#false} assume ~cond == 0bv32; {189#false} is VALID [2018-11-14 16:39:57,890 INFO L273 TraceCheckUtils]: 14: Hoare triple {189#false} assume !false; {189#false} is VALID [2018-11-14 16:39:57,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:39:57,892 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:39:57,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:39:57,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:39:57,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-14 16:39:57,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:39:57,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:39:57,927 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:57,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:39:57,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:39:57,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:39:57,928 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 3 states. [2018-11-14 16:39:58,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:58,114 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2018-11-14 16:39:58,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:39:58,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-14 16:39:58,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:39:58,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:39:58,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2018-11-14 16:39:58,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:39:58,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2018-11-14 16:39:58,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 43 transitions. [2018-11-14 16:39:58,502 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:58,505 INFO L225 Difference]: With dead ends: 37 [2018-11-14 16:39:58,505 INFO L226 Difference]: Without dead ends: 27 [2018-11-14 16:39:58,506 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:39:58,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-14 16:39:58,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2018-11-14 16:39:58,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:39:58,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 24 states. [2018-11-14 16:39:58,538 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 24 states. [2018-11-14 16:39:58,538 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 24 states. [2018-11-14 16:39:58,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:58,541 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-14 16:39:58,541 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-14 16:39:58,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:58,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:58,542 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 27 states. [2018-11-14 16:39:58,543 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 27 states. [2018-11-14 16:39:58,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:58,546 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-14 16:39:58,546 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-14 16:39:58,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:58,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:58,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:39:58,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:39:58,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 16:39:58,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-14 16:39:58,550 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 15 [2018-11-14 16:39:58,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:39:58,550 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-14 16:39:58,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:39:58,550 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-14 16:39:58,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 16:39:58,551 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:39:58,552 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:39:58,552 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:39:58,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:39:58,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1794172150, now seen corresponding path program 1 times [2018-11-14 16:39:58,553 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:39:58,553 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:39:58,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:39:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:58,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:39:58,716 INFO L256 TraceCheckUtils]: 0: Hoare triple {374#true} call ULTIMATE.init(); {374#true} is VALID [2018-11-14 16:39:58,717 INFO L273 TraceCheckUtils]: 1: Hoare triple {374#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {374#true} is VALID [2018-11-14 16:39:58,717 INFO L273 TraceCheckUtils]: 2: Hoare triple {374#true} assume true; {374#true} is VALID [2018-11-14 16:39:58,718 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {374#true} {374#true} #55#return; {374#true} is VALID [2018-11-14 16:39:58,718 INFO L256 TraceCheckUtils]: 4: Hoare triple {374#true} call #t~ret4 := main(); {374#true} is VALID [2018-11-14 16:39:58,721 INFO L273 TraceCheckUtils]: 5: Hoare triple {374#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4096bv32);havoc ~i~0;~i~0 := 0bv32; {394#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:39:58,721 INFO L273 TraceCheckUtils]: 6: Hoare triple {394#(= main_~i~0 (_ bv0 32))} assume true; {394#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:39:58,723 INFO L273 TraceCheckUtils]: 7: Hoare triple {394#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {394#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:39:58,726 INFO L273 TraceCheckUtils]: 8: Hoare triple {394#(= main_~i~0 (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {404#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:58,727 INFO L273 TraceCheckUtils]: 9: Hoare triple {404#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {404#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:58,746 INFO L273 TraceCheckUtils]: 10: Hoare triple {404#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 1024bv32); {375#false} is VALID [2018-11-14 16:39:58,746 INFO L273 TraceCheckUtils]: 11: Hoare triple {375#false} ~i~0 := 0bv32; {375#false} is VALID [2018-11-14 16:39:58,747 INFO L273 TraceCheckUtils]: 12: Hoare triple {375#false} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {375#false} is VALID [2018-11-14 16:39:58,747 INFO L273 TraceCheckUtils]: 13: Hoare triple {375#false} assume !(#t~mem3 != 0bv32);havoc #t~mem3; {375#false} is VALID [2018-11-14 16:39:58,747 INFO L256 TraceCheckUtils]: 14: Hoare triple {375#false} call __VERIFIER_assert((if ~bvsle32(~i~0, 1024bv32) then 1bv32 else 0bv32)); {375#false} is VALID [2018-11-14 16:39:58,748 INFO L273 TraceCheckUtils]: 15: Hoare triple {375#false} ~cond := #in~cond; {375#false} is VALID [2018-11-14 16:39:58,748 INFO L273 TraceCheckUtils]: 16: Hoare triple {375#false} assume ~cond == 0bv32; {375#false} is VALID [2018-11-14 16:39:58,748 INFO L273 TraceCheckUtils]: 17: Hoare triple {375#false} assume !false; {375#false} is VALID [2018-11-14 16:39:58,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:39:58,750 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:39:58,893 INFO L273 TraceCheckUtils]: 17: Hoare triple {375#false} assume !false; {375#false} is VALID [2018-11-14 16:39:58,893 INFO L273 TraceCheckUtils]: 16: Hoare triple {375#false} assume ~cond == 0bv32; {375#false} is VALID [2018-11-14 16:39:58,894 INFO L273 TraceCheckUtils]: 15: Hoare triple {375#false} ~cond := #in~cond; {375#false} is VALID [2018-11-14 16:39:58,894 INFO L256 TraceCheckUtils]: 14: Hoare triple {375#false} call __VERIFIER_assert((if ~bvsle32(~i~0, 1024bv32) then 1bv32 else 0bv32)); {375#false} is VALID [2018-11-14 16:39:58,895 INFO L273 TraceCheckUtils]: 13: Hoare triple {375#false} assume !(#t~mem3 != 0bv32);havoc #t~mem3; {375#false} is VALID [2018-11-14 16:39:58,895 INFO L273 TraceCheckUtils]: 12: Hoare triple {375#false} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {375#false} is VALID [2018-11-14 16:39:58,895 INFO L273 TraceCheckUtils]: 11: Hoare triple {375#false} ~i~0 := 0bv32; {375#false} is VALID [2018-11-14 16:39:58,902 INFO L273 TraceCheckUtils]: 10: Hoare triple {453#(bvslt main_~i~0 (_ bv1024 32))} assume !~bvslt32(~i~0, 1024bv32); {375#false} is VALID [2018-11-14 16:39:58,906 INFO L273 TraceCheckUtils]: 9: Hoare triple {453#(bvslt main_~i~0 (_ bv1024 32))} assume true; {453#(bvslt main_~i~0 (_ bv1024 32))} is VALID [2018-11-14 16:39:58,911 INFO L273 TraceCheckUtils]: 8: Hoare triple {460#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {453#(bvslt main_~i~0 (_ bv1024 32))} is VALID [2018-11-14 16:39:58,912 INFO L273 TraceCheckUtils]: 7: Hoare triple {460#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {460#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:58,913 INFO L273 TraceCheckUtils]: 6: Hoare triple {460#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} assume true; {460#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:58,914 INFO L273 TraceCheckUtils]: 5: Hoare triple {374#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4096bv32);havoc ~i~0;~i~0 := 0bv32; {460#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:58,914 INFO L256 TraceCheckUtils]: 4: Hoare triple {374#true} call #t~ret4 := main(); {374#true} is VALID [2018-11-14 16:39:58,914 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {374#true} {374#true} #55#return; {374#true} is VALID [2018-11-14 16:39:58,914 INFO L273 TraceCheckUtils]: 2: Hoare triple {374#true} assume true; {374#true} is VALID [2018-11-14 16:39:58,915 INFO L273 TraceCheckUtils]: 1: Hoare triple {374#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {374#true} is VALID [2018-11-14 16:39:58,915 INFO L256 TraceCheckUtils]: 0: Hoare triple {374#true} call ULTIMATE.init(); {374#true} is VALID [2018-11-14 16:39:58,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:39:58,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:39:58,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-14 16:39:58,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-14 16:39:58,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:39:58,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 16:39:58,964 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:58,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 16:39:58,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 16:39:58,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:39:58,965 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 6 states. [2018-11-14 16:39:59,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:59,593 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-11-14 16:39:59,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:39:59,594 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-14 16:39:59,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:39:59,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:39:59,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2018-11-14 16:39:59,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:39:59,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2018-11-14 16:39:59,601 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 65 transitions. [2018-11-14 16:39:59,768 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:59,771 INFO L225 Difference]: With dead ends: 57 [2018-11-14 16:39:59,771 INFO L226 Difference]: Without dead ends: 44 [2018-11-14 16:39:59,772 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:39:59,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-14 16:39:59,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-11-14 16:39:59,800 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:39:59,800 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 41 states. [2018-11-14 16:39:59,800 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 41 states. [2018-11-14 16:39:59,801 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 41 states. [2018-11-14 16:39:59,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:59,804 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-14 16:39:59,804 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-14 16:39:59,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:59,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:59,805 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 44 states. [2018-11-14 16:39:59,805 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 44 states. [2018-11-14 16:39:59,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:59,808 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-14 16:39:59,809 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-14 16:39:59,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:59,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:59,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:39:59,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:39:59,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-14 16:39:59,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-11-14 16:39:59,812 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 18 [2018-11-14 16:39:59,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:39:59,813 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-11-14 16:39:59,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 16:39:59,813 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-14 16:39:59,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 16:39:59,814 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:39:59,814 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:39:59,815 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:39:59,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:39:59,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1764649689, now seen corresponding path program 2 times [2018-11-14 16:39:59,816 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:39:59,816 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:39:59,840 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 16:39:59,866 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 16:39:59,866 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:39:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:59,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:39:59,971 INFO L256 TraceCheckUtils]: 0: Hoare triple {712#true} call ULTIMATE.init(); {712#true} is VALID [2018-11-14 16:39:59,971 INFO L273 TraceCheckUtils]: 1: Hoare triple {712#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {712#true} is VALID [2018-11-14 16:39:59,972 INFO L273 TraceCheckUtils]: 2: Hoare triple {712#true} assume true; {712#true} is VALID [2018-11-14 16:39:59,972 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {712#true} {712#true} #55#return; {712#true} is VALID [2018-11-14 16:39:59,973 INFO L256 TraceCheckUtils]: 4: Hoare triple {712#true} call #t~ret4 := main(); {712#true} is VALID [2018-11-14 16:39:59,973 INFO L273 TraceCheckUtils]: 5: Hoare triple {712#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4096bv32);havoc ~i~0;~i~0 := 0bv32; {712#true} is VALID [2018-11-14 16:39:59,974 INFO L273 TraceCheckUtils]: 6: Hoare triple {712#true} assume true; {712#true} is VALID [2018-11-14 16:39:59,974 INFO L273 TraceCheckUtils]: 7: Hoare triple {712#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {712#true} is VALID [2018-11-14 16:39:59,974 INFO L273 TraceCheckUtils]: 8: Hoare triple {712#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {712#true} is VALID [2018-11-14 16:39:59,974 INFO L273 TraceCheckUtils]: 9: Hoare triple {712#true} assume true; {712#true} is VALID [2018-11-14 16:39:59,975 INFO L273 TraceCheckUtils]: 10: Hoare triple {712#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {712#true} is VALID [2018-11-14 16:39:59,975 INFO L273 TraceCheckUtils]: 11: Hoare triple {712#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {712#true} is VALID [2018-11-14 16:39:59,975 INFO L273 TraceCheckUtils]: 12: Hoare triple {712#true} assume true; {712#true} is VALID [2018-11-14 16:39:59,975 INFO L273 TraceCheckUtils]: 13: Hoare triple {712#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {712#true} is VALID [2018-11-14 16:39:59,975 INFO L273 TraceCheckUtils]: 14: Hoare triple {712#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {712#true} is VALID [2018-11-14 16:39:59,976 INFO L273 TraceCheckUtils]: 15: Hoare triple {712#true} assume true; {712#true} is VALID [2018-11-14 16:39:59,976 INFO L273 TraceCheckUtils]: 16: Hoare triple {712#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {712#true} is VALID [2018-11-14 16:39:59,976 INFO L273 TraceCheckUtils]: 17: Hoare triple {712#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {712#true} is VALID [2018-11-14 16:39:59,976 INFO L273 TraceCheckUtils]: 18: Hoare triple {712#true} assume true; {712#true} is VALID [2018-11-14 16:39:59,977 INFO L273 TraceCheckUtils]: 19: Hoare triple {712#true} assume !~bvslt32(~i~0, 1024bv32); {712#true} is VALID [2018-11-14 16:39:59,977 INFO L273 TraceCheckUtils]: 20: Hoare triple {712#true} ~i~0 := 0bv32; {777#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:39:59,978 INFO L273 TraceCheckUtils]: 21: Hoare triple {777#(= main_~i~0 (_ bv0 32))} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {777#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:39:59,978 INFO L273 TraceCheckUtils]: 22: Hoare triple {777#(= main_~i~0 (_ bv0 32))} assume !(#t~mem3 != 0bv32);havoc #t~mem3; {777#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:39:59,980 INFO L256 TraceCheckUtils]: 23: Hoare triple {777#(= main_~i~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsle32(~i~0, 1024bv32) then 1bv32 else 0bv32)); {787#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:59,980 INFO L273 TraceCheckUtils]: 24: Hoare triple {787#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {791#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:59,983 INFO L273 TraceCheckUtils]: 25: Hoare triple {791#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {713#false} is VALID [2018-11-14 16:39:59,983 INFO L273 TraceCheckUtils]: 26: Hoare triple {713#false} assume !false; {713#false} is VALID [2018-11-14 16:39:59,984 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-14 16:39:59,985 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:39:59,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:39:59,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:39:59,987 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-14 16:39:59,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:39:59,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:40:00,010 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:40:00,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:40:00,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:40:00,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:40:00,012 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 5 states. [2018-11-14 16:40:00,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:00,226 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-11-14 16:40:00,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:40:00,227 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-14 16:40:00,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:40:00,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:40:00,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2018-11-14 16:40:00,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:40:00,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2018-11-14 16:40:00,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2018-11-14 16:40:00,289 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:40:00,292 INFO L225 Difference]: With dead ends: 46 [2018-11-14 16:40:00,292 INFO L226 Difference]: Without dead ends: 41 [2018-11-14 16:40:00,292 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:40:00,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-14 16:40:00,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-14 16:40:00,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:40:00,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 41 states. [2018-11-14 16:40:00,324 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-14 16:40:00,325 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-14 16:40:00,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:00,328 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-11-14 16:40:00,328 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-14 16:40:00,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:40:00,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:40:00,329 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-14 16:40:00,329 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-14 16:40:00,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:00,332 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-11-14 16:40:00,332 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-14 16:40:00,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:40:00,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:40:00,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:40:00,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:40:00,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-14 16:40:00,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-14 16:40:00,336 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 27 [2018-11-14 16:40:00,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:40:00,337 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-14 16:40:00,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:40:00,337 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-14 16:40:00,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 16:40:00,338 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:40:00,338 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:40:00,339 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:40:00,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:40:00,339 INFO L82 PathProgramCache]: Analyzing trace with hash -698033632, now seen corresponding path program 1 times [2018-11-14 16:40:00,340 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:40:00,340 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:40:00,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:40:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:40:00,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:40:00,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:40:00,731 INFO L256 TraceCheckUtils]: 0: Hoare triple {1000#true} call ULTIMATE.init(); {1000#true} is VALID [2018-11-14 16:40:00,732 INFO L273 TraceCheckUtils]: 1: Hoare triple {1000#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1000#true} is VALID [2018-11-14 16:40:00,732 INFO L273 TraceCheckUtils]: 2: Hoare triple {1000#true} assume true; {1000#true} is VALID [2018-11-14 16:40:00,732 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1000#true} {1000#true} #55#return; {1000#true} is VALID [2018-11-14 16:40:00,733 INFO L256 TraceCheckUtils]: 4: Hoare triple {1000#true} call #t~ret4 := main(); {1000#true} is VALID [2018-11-14 16:40:00,733 INFO L273 TraceCheckUtils]: 5: Hoare triple {1000#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4096bv32);havoc ~i~0;~i~0 := 0bv32; {1020#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:40:00,734 INFO L273 TraceCheckUtils]: 6: Hoare triple {1020#(= main_~i~0 (_ bv0 32))} assume true; {1020#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:40:00,734 INFO L273 TraceCheckUtils]: 7: Hoare triple {1020#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1020#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:40:00,735 INFO L273 TraceCheckUtils]: 8: Hoare triple {1020#(= main_~i~0 (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1030#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:00,735 INFO L273 TraceCheckUtils]: 9: Hoare triple {1030#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {1030#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:00,736 INFO L273 TraceCheckUtils]: 10: Hoare triple {1030#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1030#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:00,736 INFO L273 TraceCheckUtils]: 11: Hoare triple {1030#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1040#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 16:40:00,737 INFO L273 TraceCheckUtils]: 12: Hoare triple {1040#(= (_ bv2 32) main_~i~0)} assume true; {1040#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 16:40:00,737 INFO L273 TraceCheckUtils]: 13: Hoare triple {1040#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1040#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 16:40:00,738 INFO L273 TraceCheckUtils]: 14: Hoare triple {1040#(= (_ bv2 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1050#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:00,745 INFO L273 TraceCheckUtils]: 15: Hoare triple {1050#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {1050#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:00,746 INFO L273 TraceCheckUtils]: 16: Hoare triple {1050#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1050#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:00,747 INFO L273 TraceCheckUtils]: 17: Hoare triple {1050#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1060#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 16:40:00,748 INFO L273 TraceCheckUtils]: 18: Hoare triple {1060#(= (_ bv4 32) main_~i~0)} assume true; {1060#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 16:40:00,749 INFO L273 TraceCheckUtils]: 19: Hoare triple {1060#(= (_ bv4 32) main_~i~0)} assume !~bvslt32(~i~0, 1024bv32); {1001#false} is VALID [2018-11-14 16:40:00,750 INFO L273 TraceCheckUtils]: 20: Hoare triple {1001#false} ~i~0 := 0bv32; {1001#false} is VALID [2018-11-14 16:40:00,750 INFO L273 TraceCheckUtils]: 21: Hoare triple {1001#false} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1001#false} is VALID [2018-11-14 16:40:00,750 INFO L273 TraceCheckUtils]: 22: Hoare triple {1001#false} assume !!(#t~mem3 != 0bv32);havoc #t~mem3; {1001#false} is VALID [2018-11-14 16:40:00,751 INFO L273 TraceCheckUtils]: 23: Hoare triple {1001#false} assume !~bvsge32(~i~0, 1023bv32); {1001#false} is VALID [2018-11-14 16:40:00,751 INFO L273 TraceCheckUtils]: 24: Hoare triple {1001#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1001#false} is VALID [2018-11-14 16:40:00,752 INFO L273 TraceCheckUtils]: 25: Hoare triple {1001#false} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1001#false} is VALID [2018-11-14 16:40:00,752 INFO L273 TraceCheckUtils]: 26: Hoare triple {1001#false} assume !(#t~mem3 != 0bv32);havoc #t~mem3; {1001#false} is VALID [2018-11-14 16:40:00,752 INFO L256 TraceCheckUtils]: 27: Hoare triple {1001#false} call __VERIFIER_assert((if ~bvsle32(~i~0, 1024bv32) then 1bv32 else 0bv32)); {1001#false} is VALID [2018-11-14 16:40:00,753 INFO L273 TraceCheckUtils]: 28: Hoare triple {1001#false} ~cond := #in~cond; {1001#false} is VALID [2018-11-14 16:40:00,753 INFO L273 TraceCheckUtils]: 29: Hoare triple {1001#false} assume ~cond == 0bv32; {1001#false} is VALID [2018-11-14 16:40:00,753 INFO L273 TraceCheckUtils]: 30: Hoare triple {1001#false} assume !false; {1001#false} is VALID [2018-11-14 16:40:00,755 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 16:40:00,756 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:40:01,033 INFO L273 TraceCheckUtils]: 30: Hoare triple {1001#false} assume !false; {1001#false} is VALID [2018-11-14 16:40:01,034 INFO L273 TraceCheckUtils]: 29: Hoare triple {1001#false} assume ~cond == 0bv32; {1001#false} is VALID [2018-11-14 16:40:01,034 INFO L273 TraceCheckUtils]: 28: Hoare triple {1001#false} ~cond := #in~cond; {1001#false} is VALID [2018-11-14 16:40:01,034 INFO L256 TraceCheckUtils]: 27: Hoare triple {1001#false} call __VERIFIER_assert((if ~bvsle32(~i~0, 1024bv32) then 1bv32 else 0bv32)); {1001#false} is VALID [2018-11-14 16:40:01,034 INFO L273 TraceCheckUtils]: 26: Hoare triple {1001#false} assume !(#t~mem3 != 0bv32);havoc #t~mem3; {1001#false} is VALID [2018-11-14 16:40:01,035 INFO L273 TraceCheckUtils]: 25: Hoare triple {1001#false} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1001#false} is VALID [2018-11-14 16:40:01,035 INFO L273 TraceCheckUtils]: 24: Hoare triple {1001#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1001#false} is VALID [2018-11-14 16:40:01,035 INFO L273 TraceCheckUtils]: 23: Hoare triple {1001#false} assume !~bvsge32(~i~0, 1023bv32); {1001#false} is VALID [2018-11-14 16:40:01,036 INFO L273 TraceCheckUtils]: 22: Hoare triple {1001#false} assume !!(#t~mem3 != 0bv32);havoc #t~mem3; {1001#false} is VALID [2018-11-14 16:40:01,036 INFO L273 TraceCheckUtils]: 21: Hoare triple {1001#false} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1001#false} is VALID [2018-11-14 16:40:01,036 INFO L273 TraceCheckUtils]: 20: Hoare triple {1001#false} ~i~0 := 0bv32; {1001#false} is VALID [2018-11-14 16:40:01,046 INFO L273 TraceCheckUtils]: 19: Hoare triple {1133#(bvslt main_~i~0 (_ bv1024 32))} assume !~bvslt32(~i~0, 1024bv32); {1001#false} is VALID [2018-11-14 16:40:01,048 INFO L273 TraceCheckUtils]: 18: Hoare triple {1133#(bvslt main_~i~0 (_ bv1024 32))} assume true; {1133#(bvslt main_~i~0 (_ bv1024 32))} is VALID [2018-11-14 16:40:01,050 INFO L273 TraceCheckUtils]: 17: Hoare triple {1140#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1133#(bvslt main_~i~0 (_ bv1024 32))} is VALID [2018-11-14 16:40:01,052 INFO L273 TraceCheckUtils]: 16: Hoare triple {1140#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1140#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:01,053 INFO L273 TraceCheckUtils]: 15: Hoare triple {1140#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} assume true; {1140#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:01,058 INFO L273 TraceCheckUtils]: 14: Hoare triple {1150#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1140#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:01,058 INFO L273 TraceCheckUtils]: 13: Hoare triple {1150#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1150#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:01,060 INFO L273 TraceCheckUtils]: 12: Hoare triple {1150#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} assume true; {1150#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:01,063 INFO L273 TraceCheckUtils]: 11: Hoare triple {1160#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1150#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:01,064 INFO L273 TraceCheckUtils]: 10: Hoare triple {1160#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1160#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:01,064 INFO L273 TraceCheckUtils]: 9: Hoare triple {1160#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} assume true; {1160#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:01,068 INFO L273 TraceCheckUtils]: 8: Hoare triple {1170#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1160#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:01,069 INFO L273 TraceCheckUtils]: 7: Hoare triple {1170#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1170#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:01,073 INFO L273 TraceCheckUtils]: 6: Hoare triple {1170#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} assume true; {1170#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:01,074 INFO L273 TraceCheckUtils]: 5: Hoare triple {1000#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4096bv32);havoc ~i~0;~i~0 := 0bv32; {1170#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:01,074 INFO L256 TraceCheckUtils]: 4: Hoare triple {1000#true} call #t~ret4 := main(); {1000#true} is VALID [2018-11-14 16:40:01,074 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1000#true} {1000#true} #55#return; {1000#true} is VALID [2018-11-14 16:40:01,075 INFO L273 TraceCheckUtils]: 2: Hoare triple {1000#true} assume true; {1000#true} is VALID [2018-11-14 16:40:01,075 INFO L273 TraceCheckUtils]: 1: Hoare triple {1000#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1000#true} is VALID [2018-11-14 16:40:01,075 INFO L256 TraceCheckUtils]: 0: Hoare triple {1000#true} call ULTIMATE.init(); {1000#true} is VALID [2018-11-14 16:40:01,078 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 16:40:01,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:40:01,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-14 16:40:01,089 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-14 16:40:01,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:40:01,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 16:40:01,275 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:40:01,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 16:40:01,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 16:40:01,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:40:01,276 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 12 states. [2018-11-14 16:40:02,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:02,793 INFO L93 Difference]: Finished difference Result 112 states and 137 transitions. [2018-11-14 16:40:02,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 16:40:02,793 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-14 16:40:02,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:40:02,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:40:02,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 124 transitions. [2018-11-14 16:40:02,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:40:02,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 124 transitions. [2018-11-14 16:40:02,802 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 124 transitions. [2018-11-14 16:40:03,108 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:40:03,110 INFO L225 Difference]: With dead ends: 112 [2018-11-14 16:40:03,111 INFO L226 Difference]: Without dead ends: 91 [2018-11-14 16:40:03,112 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-14 16:40:03,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-14 16:40:03,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 83. [2018-11-14 16:40:03,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:40:03,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 83 states. [2018-11-14 16:40:03,167 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 83 states. [2018-11-14 16:40:03,167 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 83 states. [2018-11-14 16:40:03,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:03,172 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2018-11-14 16:40:03,172 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2018-11-14 16:40:03,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:40:03,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:40:03,173 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 91 states. [2018-11-14 16:40:03,174 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 91 states. [2018-11-14 16:40:03,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:03,178 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2018-11-14 16:40:03,178 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2018-11-14 16:40:03,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:40:03,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:40:03,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:40:03,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:40:03,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-14 16:40:03,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2018-11-14 16:40:03,184 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 31 [2018-11-14 16:40:03,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:40:03,184 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2018-11-14 16:40:03,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 16:40:03,185 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2018-11-14 16:40:03,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-14 16:40:03,186 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:40:03,186 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:40:03,187 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:40:03,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:40:03,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1351029440, now seen corresponding path program 2 times [2018-11-14 16:40:03,188 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:40:03,188 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:40:03,210 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 16:40:03,275 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:40:03,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:40:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:40:03,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:40:03,516 INFO L256 TraceCheckUtils]: 0: Hoare triple {1650#true} call ULTIMATE.init(); {1650#true} is VALID [2018-11-14 16:40:03,516 INFO L273 TraceCheckUtils]: 1: Hoare triple {1650#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1650#true} is VALID [2018-11-14 16:40:03,517 INFO L273 TraceCheckUtils]: 2: Hoare triple {1650#true} assume true; {1650#true} is VALID [2018-11-14 16:40:03,517 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1650#true} {1650#true} #55#return; {1650#true} is VALID [2018-11-14 16:40:03,517 INFO L256 TraceCheckUtils]: 4: Hoare triple {1650#true} call #t~ret4 := main(); {1650#true} is VALID [2018-11-14 16:40:03,517 INFO L273 TraceCheckUtils]: 5: Hoare triple {1650#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4096bv32);havoc ~i~0;~i~0 := 0bv32; {1670#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:40:03,518 INFO L273 TraceCheckUtils]: 6: Hoare triple {1670#(= main_~i~0 (_ bv0 32))} assume true; {1670#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:40:03,518 INFO L273 TraceCheckUtils]: 7: Hoare triple {1670#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1670#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:40:03,519 INFO L273 TraceCheckUtils]: 8: Hoare triple {1670#(= main_~i~0 (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1680#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:03,519 INFO L273 TraceCheckUtils]: 9: Hoare triple {1680#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {1680#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:03,538 INFO L273 TraceCheckUtils]: 10: Hoare triple {1680#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1680#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:03,540 INFO L273 TraceCheckUtils]: 11: Hoare triple {1680#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1690#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 16:40:03,541 INFO L273 TraceCheckUtils]: 12: Hoare triple {1690#(= (_ bv2 32) main_~i~0)} assume true; {1690#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 16:40:03,541 INFO L273 TraceCheckUtils]: 13: Hoare triple {1690#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1690#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 16:40:03,542 INFO L273 TraceCheckUtils]: 14: Hoare triple {1690#(= (_ bv2 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1700#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:03,542 INFO L273 TraceCheckUtils]: 15: Hoare triple {1700#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {1700#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:03,542 INFO L273 TraceCheckUtils]: 16: Hoare triple {1700#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1700#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:03,543 INFO L273 TraceCheckUtils]: 17: Hoare triple {1700#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1710#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 16:40:03,543 INFO L273 TraceCheckUtils]: 18: Hoare triple {1710#(= (_ bv4 32) main_~i~0)} assume true; {1710#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 16:40:03,544 INFO L273 TraceCheckUtils]: 19: Hoare triple {1710#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1710#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 16:40:03,545 INFO L273 TraceCheckUtils]: 20: Hoare triple {1710#(= (_ bv4 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1720#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:03,545 INFO L273 TraceCheckUtils]: 21: Hoare triple {1720#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {1720#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:03,547 INFO L273 TraceCheckUtils]: 22: Hoare triple {1720#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1720#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:03,548 INFO L273 TraceCheckUtils]: 23: Hoare triple {1720#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1730#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-14 16:40:03,548 INFO L273 TraceCheckUtils]: 24: Hoare triple {1730#(= (_ bv6 32) main_~i~0)} assume true; {1730#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-14 16:40:03,549 INFO L273 TraceCheckUtils]: 25: Hoare triple {1730#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1730#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-14 16:40:03,550 INFO L273 TraceCheckUtils]: 26: Hoare triple {1730#(= (_ bv6 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1740#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:03,554 INFO L273 TraceCheckUtils]: 27: Hoare triple {1740#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume true; {1740#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:03,555 INFO L273 TraceCheckUtils]: 28: Hoare triple {1740#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1740#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:03,556 INFO L273 TraceCheckUtils]: 29: Hoare triple {1740#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1750#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-14 16:40:03,556 INFO L273 TraceCheckUtils]: 30: Hoare triple {1750#(= (_ bv8 32) main_~i~0)} assume true; {1750#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-14 16:40:03,556 INFO L273 TraceCheckUtils]: 31: Hoare triple {1750#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1750#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-14 16:40:03,557 INFO L273 TraceCheckUtils]: 32: Hoare triple {1750#(= (_ bv8 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1760#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:03,557 INFO L273 TraceCheckUtils]: 33: Hoare triple {1760#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume true; {1760#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:03,558 INFO L273 TraceCheckUtils]: 34: Hoare triple {1760#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1760#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:03,559 INFO L273 TraceCheckUtils]: 35: Hoare triple {1760#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1770#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-14 16:40:03,560 INFO L273 TraceCheckUtils]: 36: Hoare triple {1770#(= (_ bv10 32) main_~i~0)} assume true; {1770#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-14 16:40:03,561 INFO L273 TraceCheckUtils]: 37: Hoare triple {1770#(= (_ bv10 32) main_~i~0)} assume !~bvslt32(~i~0, 1024bv32); {1651#false} is VALID [2018-11-14 16:40:03,561 INFO L273 TraceCheckUtils]: 38: Hoare triple {1651#false} ~i~0 := 0bv32; {1651#false} is VALID [2018-11-14 16:40:03,563 INFO L273 TraceCheckUtils]: 39: Hoare triple {1651#false} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1651#false} is VALID [2018-11-14 16:40:03,563 INFO L273 TraceCheckUtils]: 40: Hoare triple {1651#false} assume !!(#t~mem3 != 0bv32);havoc #t~mem3; {1651#false} is VALID [2018-11-14 16:40:03,564 INFO L273 TraceCheckUtils]: 41: Hoare triple {1651#false} assume !~bvsge32(~i~0, 1023bv32); {1651#false} is VALID [2018-11-14 16:40:03,564 INFO L273 TraceCheckUtils]: 42: Hoare triple {1651#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1651#false} is VALID [2018-11-14 16:40:03,565 INFO L273 TraceCheckUtils]: 43: Hoare triple {1651#false} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1651#false} is VALID [2018-11-14 16:40:03,565 INFO L273 TraceCheckUtils]: 44: Hoare triple {1651#false} assume !(#t~mem3 != 0bv32);havoc #t~mem3; {1651#false} is VALID [2018-11-14 16:40:03,565 INFO L256 TraceCheckUtils]: 45: Hoare triple {1651#false} call __VERIFIER_assert((if ~bvsle32(~i~0, 1024bv32) then 1bv32 else 0bv32)); {1651#false} is VALID [2018-11-14 16:40:03,566 INFO L273 TraceCheckUtils]: 46: Hoare triple {1651#false} ~cond := #in~cond; {1651#false} is VALID [2018-11-14 16:40:03,566 INFO L273 TraceCheckUtils]: 47: Hoare triple {1651#false} assume ~cond == 0bv32; {1651#false} is VALID [2018-11-14 16:40:03,566 INFO L273 TraceCheckUtils]: 48: Hoare triple {1651#false} assume !false; {1651#false} is VALID [2018-11-14 16:40:03,571 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 16:40:03,571 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:40:04,303 INFO L273 TraceCheckUtils]: 48: Hoare triple {1651#false} assume !false; {1651#false} is VALID [2018-11-14 16:40:04,304 INFO L273 TraceCheckUtils]: 47: Hoare triple {1651#false} assume ~cond == 0bv32; {1651#false} is VALID [2018-11-14 16:40:04,304 INFO L273 TraceCheckUtils]: 46: Hoare triple {1651#false} ~cond := #in~cond; {1651#false} is VALID [2018-11-14 16:40:04,305 INFO L256 TraceCheckUtils]: 45: Hoare triple {1651#false} call __VERIFIER_assert((if ~bvsle32(~i~0, 1024bv32) then 1bv32 else 0bv32)); {1651#false} is VALID [2018-11-14 16:40:04,305 INFO L273 TraceCheckUtils]: 44: Hoare triple {1651#false} assume !(#t~mem3 != 0bv32);havoc #t~mem3; {1651#false} is VALID [2018-11-14 16:40:04,306 INFO L273 TraceCheckUtils]: 43: Hoare triple {1651#false} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1651#false} is VALID [2018-11-14 16:40:04,306 INFO L273 TraceCheckUtils]: 42: Hoare triple {1651#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1651#false} is VALID [2018-11-14 16:40:04,306 INFO L273 TraceCheckUtils]: 41: Hoare triple {1651#false} assume !~bvsge32(~i~0, 1023bv32); {1651#false} is VALID [2018-11-14 16:40:04,307 INFO L273 TraceCheckUtils]: 40: Hoare triple {1651#false} assume !!(#t~mem3 != 0bv32);havoc #t~mem3; {1651#false} is VALID [2018-11-14 16:40:04,307 INFO L273 TraceCheckUtils]: 39: Hoare triple {1651#false} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1651#false} is VALID [2018-11-14 16:40:04,307 INFO L273 TraceCheckUtils]: 38: Hoare triple {1651#false} ~i~0 := 0bv32; {1651#false} is VALID [2018-11-14 16:40:04,332 INFO L273 TraceCheckUtils]: 37: Hoare triple {1843#(bvslt main_~i~0 (_ bv1024 32))} assume !~bvslt32(~i~0, 1024bv32); {1651#false} is VALID [2018-11-14 16:40:04,347 INFO L273 TraceCheckUtils]: 36: Hoare triple {1843#(bvslt main_~i~0 (_ bv1024 32))} assume true; {1843#(bvslt main_~i~0 (_ bv1024 32))} is VALID [2018-11-14 16:40:04,350 INFO L273 TraceCheckUtils]: 35: Hoare triple {1850#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1843#(bvslt main_~i~0 (_ bv1024 32))} is VALID [2018-11-14 16:40:04,350 INFO L273 TraceCheckUtils]: 34: Hoare triple {1850#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1850#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:04,351 INFO L273 TraceCheckUtils]: 33: Hoare triple {1850#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} assume true; {1850#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:04,355 INFO L273 TraceCheckUtils]: 32: Hoare triple {1860#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1850#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:04,356 INFO L273 TraceCheckUtils]: 31: Hoare triple {1860#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1860#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:04,356 INFO L273 TraceCheckUtils]: 30: Hoare triple {1860#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} assume true; {1860#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:04,360 INFO L273 TraceCheckUtils]: 29: Hoare triple {1870#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1860#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:04,361 INFO L273 TraceCheckUtils]: 28: Hoare triple {1870#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1870#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:04,361 INFO L273 TraceCheckUtils]: 27: Hoare triple {1870#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} assume true; {1870#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:04,365 INFO L273 TraceCheckUtils]: 26: Hoare triple {1880#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1870#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:04,367 INFO L273 TraceCheckUtils]: 25: Hoare triple {1880#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1880#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:04,367 INFO L273 TraceCheckUtils]: 24: Hoare triple {1880#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} assume true; {1880#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:04,371 INFO L273 TraceCheckUtils]: 23: Hoare triple {1890#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1880#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:04,372 INFO L273 TraceCheckUtils]: 22: Hoare triple {1890#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1890#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:04,373 INFO L273 TraceCheckUtils]: 21: Hoare triple {1890#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv1024 32))} assume true; {1890#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:04,377 INFO L273 TraceCheckUtils]: 20: Hoare triple {1900#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1890#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:04,378 INFO L273 TraceCheckUtils]: 19: Hoare triple {1900#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1900#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:04,378 INFO L273 TraceCheckUtils]: 18: Hoare triple {1900#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv1024 32))} assume true; {1900#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:04,382 INFO L273 TraceCheckUtils]: 17: Hoare triple {1910#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1900#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:04,383 INFO L273 TraceCheckUtils]: 16: Hoare triple {1910#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1910#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:04,383 INFO L273 TraceCheckUtils]: 15: Hoare triple {1910#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv1024 32))} assume true; {1910#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:04,387 INFO L273 TraceCheckUtils]: 14: Hoare triple {1920#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1910#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:04,388 INFO L273 TraceCheckUtils]: 13: Hoare triple {1920#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1920#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:04,388 INFO L273 TraceCheckUtils]: 12: Hoare triple {1920#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv1024 32))} assume true; {1920#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:04,392 INFO L273 TraceCheckUtils]: 11: Hoare triple {1930#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1920#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:04,393 INFO L273 TraceCheckUtils]: 10: Hoare triple {1930#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1930#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:04,393 INFO L273 TraceCheckUtils]: 9: Hoare triple {1930#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv1024 32))} assume true; {1930#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:04,397 INFO L273 TraceCheckUtils]: 8: Hoare triple {1940#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1930#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:04,397 INFO L273 TraceCheckUtils]: 7: Hoare triple {1940#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1940#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:04,398 INFO L273 TraceCheckUtils]: 6: Hoare triple {1940#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv1024 32))} assume true; {1940#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:04,399 INFO L273 TraceCheckUtils]: 5: Hoare triple {1650#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4096bv32);havoc ~i~0;~i~0 := 0bv32; {1940#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:04,399 INFO L256 TraceCheckUtils]: 4: Hoare triple {1650#true} call #t~ret4 := main(); {1650#true} is VALID [2018-11-14 16:40:04,399 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1650#true} {1650#true} #55#return; {1650#true} is VALID [2018-11-14 16:40:04,399 INFO L273 TraceCheckUtils]: 2: Hoare triple {1650#true} assume true; {1650#true} is VALID [2018-11-14 16:40:04,400 INFO L273 TraceCheckUtils]: 1: Hoare triple {1650#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1650#true} is VALID [2018-11-14 16:40:04,400 INFO L256 TraceCheckUtils]: 0: Hoare triple {1650#true} call ULTIMATE.init(); {1650#true} is VALID [2018-11-14 16:40:04,405 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 16:40:04,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:40:04,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-14 16:40:04,408 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 49 [2018-11-14 16:40:04,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:40:04,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 16:40:04,612 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:40:04,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 16:40:04,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 16:40:04,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-14 16:40:04,613 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 24 states. [2018-11-14 16:40:10,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:10,922 INFO L93 Difference]: Finished difference Result 232 states and 287 transitions. [2018-11-14 16:40:10,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-14 16:40:10,922 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 49 [2018-11-14 16:40:10,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:40:10,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 16:40:10,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 244 transitions. [2018-11-14 16:40:10,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 16:40:10,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 244 transitions. [2018-11-14 16:40:10,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 244 transitions. [2018-11-14 16:40:11,495 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 244 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:40:11,500 INFO L225 Difference]: With dead ends: 232 [2018-11-14 16:40:11,501 INFO L226 Difference]: Without dead ends: 187 [2018-11-14 16:40:11,502 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 16:40:11,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-14 16:40:11,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 167. [2018-11-14 16:40:11,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:40:11,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 187 states. Second operand 167 states. [2018-11-14 16:40:11,611 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand 167 states. [2018-11-14 16:40:11,611 INFO L87 Difference]: Start difference. First operand 187 states. Second operand 167 states. [2018-11-14 16:40:11,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:11,619 INFO L93 Difference]: Finished difference Result 187 states and 209 transitions. [2018-11-14 16:40:11,619 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 209 transitions. [2018-11-14 16:40:11,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:40:11,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:40:11,620 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand 187 states. [2018-11-14 16:40:11,620 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 187 states. [2018-11-14 16:40:11,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:11,628 INFO L93 Difference]: Finished difference Result 187 states and 209 transitions. [2018-11-14 16:40:11,628 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 209 transitions. [2018-11-14 16:40:11,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:40:11,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:40:11,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:40:11,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:40:11,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-14 16:40:11,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 189 transitions. [2018-11-14 16:40:11,635 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 189 transitions. Word has length 49 [2018-11-14 16:40:11,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:40:11,635 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 189 transitions. [2018-11-14 16:40:11,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 16:40:11,636 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 189 transitions. [2018-11-14 16:40:11,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-14 16:40:11,638 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:40:11,638 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:40:11,638 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:40:11,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:40:11,639 INFO L82 PathProgramCache]: Analyzing trace with hash 249265024, now seen corresponding path program 3 times [2018-11-14 16:40:11,639 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:40:11,639 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:40:11,666 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-14 16:40:11,716 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 16:40:11,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:40:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:40:11,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:40:11,857 INFO L256 TraceCheckUtils]: 0: Hoare triple {2894#true} call ULTIMATE.init(); {2894#true} is VALID [2018-11-14 16:40:11,857 INFO L273 TraceCheckUtils]: 1: Hoare triple {2894#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2894#true} is VALID [2018-11-14 16:40:11,857 INFO L273 TraceCheckUtils]: 2: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:11,858 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2894#true} {2894#true} #55#return; {2894#true} is VALID [2018-11-14 16:40:11,858 INFO L256 TraceCheckUtils]: 4: Hoare triple {2894#true} call #t~ret4 := main(); {2894#true} is VALID [2018-11-14 16:40:11,859 INFO L273 TraceCheckUtils]: 5: Hoare triple {2894#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4096bv32);havoc ~i~0;~i~0 := 0bv32; {2894#true} is VALID [2018-11-14 16:40:11,859 INFO L273 TraceCheckUtils]: 6: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:11,859 INFO L273 TraceCheckUtils]: 7: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:11,859 INFO L273 TraceCheckUtils]: 8: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:11,860 INFO L273 TraceCheckUtils]: 9: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:11,860 INFO L273 TraceCheckUtils]: 10: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:11,860 INFO L273 TraceCheckUtils]: 11: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:11,860 INFO L273 TraceCheckUtils]: 12: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:11,860 INFO L273 TraceCheckUtils]: 13: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:11,861 INFO L273 TraceCheckUtils]: 14: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:11,861 INFO L273 TraceCheckUtils]: 15: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:11,861 INFO L273 TraceCheckUtils]: 16: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:11,861 INFO L273 TraceCheckUtils]: 17: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:11,861 INFO L273 TraceCheckUtils]: 18: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:11,861 INFO L273 TraceCheckUtils]: 19: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:11,862 INFO L273 TraceCheckUtils]: 20: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:11,862 INFO L273 TraceCheckUtils]: 21: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:11,862 INFO L273 TraceCheckUtils]: 22: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:11,862 INFO L273 TraceCheckUtils]: 23: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:11,862 INFO L273 TraceCheckUtils]: 24: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:11,862 INFO L273 TraceCheckUtils]: 25: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:11,863 INFO L273 TraceCheckUtils]: 26: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:11,863 INFO L273 TraceCheckUtils]: 27: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:11,863 INFO L273 TraceCheckUtils]: 28: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:11,863 INFO L273 TraceCheckUtils]: 29: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:11,863 INFO L273 TraceCheckUtils]: 30: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:11,863 INFO L273 TraceCheckUtils]: 31: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:11,864 INFO L273 TraceCheckUtils]: 32: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:11,864 INFO L273 TraceCheckUtils]: 33: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:11,864 INFO L273 TraceCheckUtils]: 34: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:11,864 INFO L273 TraceCheckUtils]: 35: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:11,864 INFO L273 TraceCheckUtils]: 36: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:11,864 INFO L273 TraceCheckUtils]: 37: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:11,864 INFO L273 TraceCheckUtils]: 38: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:11,865 INFO L273 TraceCheckUtils]: 39: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:11,865 INFO L273 TraceCheckUtils]: 40: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:11,865 INFO L273 TraceCheckUtils]: 41: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:11,865 INFO L273 TraceCheckUtils]: 42: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:11,865 INFO L273 TraceCheckUtils]: 43: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:11,866 INFO L273 TraceCheckUtils]: 44: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:11,866 INFO L273 TraceCheckUtils]: 45: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:11,866 INFO L273 TraceCheckUtils]: 46: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:11,866 INFO L273 TraceCheckUtils]: 47: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:11,866 INFO L273 TraceCheckUtils]: 48: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:11,867 INFO L273 TraceCheckUtils]: 49: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:11,867 INFO L273 TraceCheckUtils]: 50: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:11,867 INFO L273 TraceCheckUtils]: 51: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:11,867 INFO L273 TraceCheckUtils]: 52: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:11,867 INFO L273 TraceCheckUtils]: 53: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:11,868 INFO L273 TraceCheckUtils]: 54: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:11,868 INFO L273 TraceCheckUtils]: 55: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:11,868 INFO L273 TraceCheckUtils]: 56: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:11,868 INFO L273 TraceCheckUtils]: 57: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:11,868 INFO L273 TraceCheckUtils]: 58: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:11,868 INFO L273 TraceCheckUtils]: 59: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:11,869 INFO L273 TraceCheckUtils]: 60: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:11,869 INFO L273 TraceCheckUtils]: 61: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:11,869 INFO L273 TraceCheckUtils]: 62: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:11,869 INFO L273 TraceCheckUtils]: 63: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:11,869 INFO L273 TraceCheckUtils]: 64: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:11,870 INFO L273 TraceCheckUtils]: 65: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:11,870 INFO L273 TraceCheckUtils]: 66: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:11,870 INFO L273 TraceCheckUtils]: 67: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:11,870 INFO L273 TraceCheckUtils]: 68: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:11,870 INFO L273 TraceCheckUtils]: 69: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:11,870 INFO L273 TraceCheckUtils]: 70: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:11,870 INFO L273 TraceCheckUtils]: 71: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:11,871 INFO L273 TraceCheckUtils]: 72: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:11,871 INFO L273 TraceCheckUtils]: 73: Hoare triple {2894#true} assume !~bvslt32(~i~0, 1024bv32); {2894#true} is VALID [2018-11-14 16:40:11,871 INFO L273 TraceCheckUtils]: 74: Hoare triple {2894#true} ~i~0 := 0bv32; {3121#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:40:11,872 INFO L273 TraceCheckUtils]: 75: Hoare triple {3121#(= main_~i~0 (_ bv0 32))} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3121#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:40:11,872 INFO L273 TraceCheckUtils]: 76: Hoare triple {3121#(= main_~i~0 (_ bv0 32))} assume !!(#t~mem3 != 0bv32);havoc #t~mem3; {3121#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:40:11,872 INFO L273 TraceCheckUtils]: 77: Hoare triple {3121#(= main_~i~0 (_ bv0 32))} assume !~bvsge32(~i~0, 1023bv32); {3121#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:40:11,873 INFO L273 TraceCheckUtils]: 78: Hoare triple {3121#(= main_~i~0 (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3134#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:11,873 INFO L273 TraceCheckUtils]: 79: Hoare triple {3134#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3134#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:11,873 INFO L273 TraceCheckUtils]: 80: Hoare triple {3134#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(#t~mem3 != 0bv32);havoc #t~mem3; {3134#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:11,874 INFO L256 TraceCheckUtils]: 81: Hoare triple {3134#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsle32(~i~0, 1024bv32) then 1bv32 else 0bv32)); {3144#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:11,875 INFO L273 TraceCheckUtils]: 82: Hoare triple {3144#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {3148#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:11,875 INFO L273 TraceCheckUtils]: 83: Hoare triple {3148#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {2895#false} is VALID [2018-11-14 16:40:11,876 INFO L273 TraceCheckUtils]: 84: Hoare triple {2895#false} assume !false; {2895#false} is VALID [2018-11-14 16:40:11,880 INFO L134 CoverageAnalysis]: Checked inductivity of 739 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2018-11-14 16:40:11,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:40:12,133 INFO L273 TraceCheckUtils]: 84: Hoare triple {2895#false} assume !false; {2895#false} is VALID [2018-11-14 16:40:12,134 INFO L273 TraceCheckUtils]: 83: Hoare triple {3158#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {2895#false} is VALID [2018-11-14 16:40:12,134 INFO L273 TraceCheckUtils]: 82: Hoare triple {3162#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {3158#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-14 16:40:12,135 INFO L256 TraceCheckUtils]: 81: Hoare triple {3166#(bvsle main_~i~0 (_ bv1024 32))} call __VERIFIER_assert((if ~bvsle32(~i~0, 1024bv32) then 1bv32 else 0bv32)); {3162#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-14 16:40:12,136 INFO L273 TraceCheckUtils]: 80: Hoare triple {3166#(bvsle main_~i~0 (_ bv1024 32))} assume !(#t~mem3 != 0bv32);havoc #t~mem3; {3166#(bvsle main_~i~0 (_ bv1024 32))} is VALID [2018-11-14 16:40:12,136 INFO L273 TraceCheckUtils]: 79: Hoare triple {3166#(bvsle main_~i~0 (_ bv1024 32))} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3166#(bvsle main_~i~0 (_ bv1024 32))} is VALID [2018-11-14 16:40:12,137 INFO L273 TraceCheckUtils]: 78: Hoare triple {3176#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3166#(bvsle main_~i~0 (_ bv1024 32))} is VALID [2018-11-14 16:40:12,137 INFO L273 TraceCheckUtils]: 77: Hoare triple {3176#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} assume !~bvsge32(~i~0, 1023bv32); {3176#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:12,138 INFO L273 TraceCheckUtils]: 76: Hoare triple {3176#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} assume !!(#t~mem3 != 0bv32);havoc #t~mem3; {3176#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:12,139 INFO L273 TraceCheckUtils]: 75: Hoare triple {3176#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3176#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:12,139 INFO L273 TraceCheckUtils]: 74: Hoare triple {2894#true} ~i~0 := 0bv32; {3176#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-14 16:40:12,140 INFO L273 TraceCheckUtils]: 73: Hoare triple {2894#true} assume !~bvslt32(~i~0, 1024bv32); {2894#true} is VALID [2018-11-14 16:40:12,140 INFO L273 TraceCheckUtils]: 72: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:12,140 INFO L273 TraceCheckUtils]: 71: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:12,141 INFO L273 TraceCheckUtils]: 70: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:12,141 INFO L273 TraceCheckUtils]: 69: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:12,141 INFO L273 TraceCheckUtils]: 68: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:12,142 INFO L273 TraceCheckUtils]: 67: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:12,142 INFO L273 TraceCheckUtils]: 66: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:12,142 INFO L273 TraceCheckUtils]: 65: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:12,143 INFO L273 TraceCheckUtils]: 64: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:12,143 INFO L273 TraceCheckUtils]: 63: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:12,143 INFO L273 TraceCheckUtils]: 62: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:12,143 INFO L273 TraceCheckUtils]: 61: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:12,143 INFO L273 TraceCheckUtils]: 60: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:12,144 INFO L273 TraceCheckUtils]: 59: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:12,144 INFO L273 TraceCheckUtils]: 58: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:12,144 INFO L273 TraceCheckUtils]: 57: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:12,144 INFO L273 TraceCheckUtils]: 56: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:12,145 INFO L273 TraceCheckUtils]: 55: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:12,145 INFO L273 TraceCheckUtils]: 54: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:12,145 INFO L273 TraceCheckUtils]: 53: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:12,145 INFO L273 TraceCheckUtils]: 52: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:12,145 INFO L273 TraceCheckUtils]: 51: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:12,146 INFO L273 TraceCheckUtils]: 50: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:12,146 INFO L273 TraceCheckUtils]: 49: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:12,146 INFO L273 TraceCheckUtils]: 48: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:12,146 INFO L273 TraceCheckUtils]: 47: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:12,146 INFO L273 TraceCheckUtils]: 46: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:12,147 INFO L273 TraceCheckUtils]: 45: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:12,147 INFO L273 TraceCheckUtils]: 44: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:12,147 INFO L273 TraceCheckUtils]: 43: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:12,147 INFO L273 TraceCheckUtils]: 42: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:12,147 INFO L273 TraceCheckUtils]: 41: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:12,148 INFO L273 TraceCheckUtils]: 40: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:12,148 INFO L273 TraceCheckUtils]: 39: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:12,148 INFO L273 TraceCheckUtils]: 38: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:12,148 INFO L273 TraceCheckUtils]: 37: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:12,149 INFO L273 TraceCheckUtils]: 36: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:12,149 INFO L273 TraceCheckUtils]: 35: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:12,149 INFO L273 TraceCheckUtils]: 34: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:12,149 INFO L273 TraceCheckUtils]: 33: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:12,149 INFO L273 TraceCheckUtils]: 32: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:12,150 INFO L273 TraceCheckUtils]: 31: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:12,150 INFO L273 TraceCheckUtils]: 30: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:12,150 INFO L273 TraceCheckUtils]: 29: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:12,150 INFO L273 TraceCheckUtils]: 28: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:12,150 INFO L273 TraceCheckUtils]: 27: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:12,151 INFO L273 TraceCheckUtils]: 26: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:12,151 INFO L273 TraceCheckUtils]: 25: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:12,151 INFO L273 TraceCheckUtils]: 24: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:12,151 INFO L273 TraceCheckUtils]: 23: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:12,152 INFO L273 TraceCheckUtils]: 22: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:12,152 INFO L273 TraceCheckUtils]: 21: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:12,152 INFO L273 TraceCheckUtils]: 20: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:12,152 INFO L273 TraceCheckUtils]: 19: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:12,152 INFO L273 TraceCheckUtils]: 18: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:12,153 INFO L273 TraceCheckUtils]: 17: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:12,153 INFO L273 TraceCheckUtils]: 16: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:12,153 INFO L273 TraceCheckUtils]: 15: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:12,153 INFO L273 TraceCheckUtils]: 14: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:12,153 INFO L273 TraceCheckUtils]: 13: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:12,153 INFO L273 TraceCheckUtils]: 12: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:12,154 INFO L273 TraceCheckUtils]: 11: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:12,154 INFO L273 TraceCheckUtils]: 10: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:12,154 INFO L273 TraceCheckUtils]: 9: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:12,154 INFO L273 TraceCheckUtils]: 8: Hoare triple {2894#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2894#true} is VALID [2018-11-14 16:40:12,154 INFO L273 TraceCheckUtils]: 7: Hoare triple {2894#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2894#true} is VALID [2018-11-14 16:40:12,155 INFO L273 TraceCheckUtils]: 6: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:12,155 INFO L273 TraceCheckUtils]: 5: Hoare triple {2894#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4096bv32);havoc ~i~0;~i~0 := 0bv32; {2894#true} is VALID [2018-11-14 16:40:12,155 INFO L256 TraceCheckUtils]: 4: Hoare triple {2894#true} call #t~ret4 := main(); {2894#true} is VALID [2018-11-14 16:40:12,155 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2894#true} {2894#true} #55#return; {2894#true} is VALID [2018-11-14 16:40:12,155 INFO L273 TraceCheckUtils]: 2: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-14 16:40:12,155 INFO L273 TraceCheckUtils]: 1: Hoare triple {2894#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2894#true} is VALID [2018-11-14 16:40:12,155 INFO L256 TraceCheckUtils]: 0: Hoare triple {2894#true} call ULTIMATE.init(); {2894#true} is VALID [2018-11-14 16:40:12,159 INFO L134 CoverageAnalysis]: Checked inductivity of 739 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2018-11-14 16:40:12,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:40:12,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-14 16:40:12,161 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2018-11-14 16:40:12,161 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:40:12,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 16:40:12,234 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:40:12,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 16:40:12,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 16:40:12,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:40:12,235 INFO L87 Difference]: Start difference. First operand 167 states and 189 transitions. Second operand 10 states. [2018-11-14 16:40:12,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:12,769 INFO L93 Difference]: Finished difference Result 169 states and 191 transitions. [2018-11-14 16:40:12,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 16:40:12,769 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2018-11-14 16:40:12,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:40:12,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:40:12,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2018-11-14 16:40:12,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:40:12,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2018-11-14 16:40:12,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 44 transitions. [2018-11-14 16:40:12,846 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:40:12,846 INFO L225 Difference]: With dead ends: 169 [2018-11-14 16:40:12,846 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 16:40:12,848 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:40:12,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 16:40:12,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 16:40:12,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:40:12,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 16:40:12,850 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 16:40:12,850 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 16:40:12,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:12,850 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 16:40:12,851 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 16:40:12,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:40:12,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:40:12,851 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 16:40:12,851 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 16:40:12,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:12,851 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 16:40:12,851 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 16:40:12,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:40:12,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:40:12,852 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:40:12,852 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:40:12,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 16:40:12,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 16:40:12,852 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2018-11-14 16:40:12,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:40:12,852 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 16:40:12,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 16:40:12,852 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 16:40:12,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:40:12,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 16:40:13,067 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 48 [2018-11-14 16:40:13,368 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-14 16:40:13,369 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-14 16:40:13,369 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 16:40:13,369 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 16:40:13,369 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 16:40:13,369 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 16:40:13,369 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 16:40:13,369 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 9 23) no Hoare annotation was computed. [2018-11-14 16:40:13,370 INFO L425 ceAbstractionStarter]: For program point L17-1(lines 17 21) no Hoare annotation was computed. [2018-11-14 16:40:13,370 INFO L425 ceAbstractionStarter]: For program point L17-3(lines 17 21) no Hoare annotation was computed. [2018-11-14 16:40:13,370 INFO L421 ceAbstractionStarter]: At program point L17-4(lines 17 21) the Hoare annotation is: (bvslt main_~i~0 (_ bv1024 32)) [2018-11-14 16:40:13,370 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 9 23) no Hoare annotation was computed. [2018-11-14 16:40:13,370 INFO L425 ceAbstractionStarter]: For program point L13-1(lines 13 15) no Hoare annotation was computed. [2018-11-14 16:40:13,370 INFO L421 ceAbstractionStarter]: At program point L17-5(lines 17 21) the Hoare annotation is: (bvslt main_~i~0 (_ bv1024 32)) [2018-11-14 16:40:13,370 INFO L425 ceAbstractionStarter]: For program point L13-3(lines 13 15) no Hoare annotation was computed. [2018-11-14 16:40:13,370 INFO L421 ceAbstractionStarter]: At program point L13-4(lines 13 15) the Hoare annotation is: (bvsle main_~i~0 (_ bv1024 32)) [2018-11-14 16:40:13,370 INFO L425 ceAbstractionStarter]: For program point L13-5(lines 13 15) no Hoare annotation was computed. [2018-11-14 16:40:13,371 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 9 23) the Hoare annotation is: true [2018-11-14 16:40:13,371 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-14 16:40:13,371 INFO L425 ceAbstractionStarter]: For program point L18(lines 18 20) no Hoare annotation was computed. [2018-11-14 16:40:13,371 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-14 16:40:13,371 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-14 16:40:13,371 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-14 16:40:13,371 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-14 16:40:13,371 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-14 16:40:13,371 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-14 16:40:13,373 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 16:40:13,374 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 16:40:13,374 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 16:40:13,374 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 16:40:13,374 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-14 16:40:13,375 WARN L170 areAnnotationChecker]: L13-5 has no Hoare annotation [2018-11-14 16:40:13,375 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 16:40:13,375 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 16:40:13,375 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 16:40:13,375 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 16:40:13,375 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-14 16:40:13,375 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-14 16:40:13,375 WARN L170 areAnnotationChecker]: L13-5 has no Hoare annotation [2018-11-14 16:40:13,375 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 16:40:13,375 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 16:40:13,375 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-14 16:40:13,376 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2018-11-14 16:40:13,376 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2018-11-14 16:40:13,376 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 16:40:13,376 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2018-11-14 16:40:13,376 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2018-11-14 16:40:13,376 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2018-11-14 16:40:13,376 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2018-11-14 16:40:13,377 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-14 16:40:13,377 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-14 16:40:13,377 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 16:40:13,377 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2018-11-14 16:40:13,377 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 16:40:13,377 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. [2018-11-14 16:40:13,384 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvslt32 [2018-11-14 16:40:13,384 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvslt32 [2018-11-14 16:40:13,385 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvsle32 [2018-11-14 16:40:13,385 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvsle32 [2018-11-14 16:40:13,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 04:40:13 BoogieIcfgContainer [2018-11-14 16:40:13,387 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 16:40:13,388 INFO L168 Benchmark]: Toolchain (without parser) took 17755.38 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 870.8 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -248.4 MB). Peak memory consumption was 622.4 MB. Max. memory is 7.1 GB. [2018-11-14 16:40:13,389 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 16:40:13,389 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-14 16:40:13,390 INFO L168 Benchmark]: Boogie Preprocessor took 41.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 16:40:13,390 INFO L168 Benchmark]: RCFGBuilder took 641.37 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -779.4 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. [2018-11-14 16:40:13,391 INFO L168 Benchmark]: TraceAbstraction took 16750.22 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 121.6 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 520.4 MB). Peak memory consumption was 642.0 MB. Max. memory is 7.1 GB. [2018-11-14 16:40:13,394 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 318.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 641.37 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -779.4 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16750.22 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 121.6 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 520.4 MB). Peak memory consumption was 642.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation cannot identify Boogie2SMT function ~bvslt32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation cannot identify Boogie2SMT function ~bvslt32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation cannot identify Boogie2SMT function ~bvsle32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation cannot identify Boogie2SMT function ~bvsle32 * 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 [2018-11-14 16:40:13,400 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvslt32 [2018-11-14 16:40:13,400 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvslt32 Derived loop invariant: NULL - InvariantResult [Line: 13]: Loop Invariant [2018-11-14 16:40:13,400 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvsle32 [2018-11-14 16:40:13,401 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvsle32 Derived loop invariant: NULL - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. SAFE Result, 16.6s OverallTime, 7 OverallIterations, 23 TraceHistogramMax, 11.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 173 SDtfs, 718 SDslu, 863 SDs, 0 SdLazy, 1017 SolverSat, 238 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 433 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 34 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 16 PreInvPairs, 64 NumberOfFragments, 14 HoareAnnotationTreeSize, 16 FomulaSimplifications, 16130 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 8 FomulaSimplificationsInter, 616 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 238 NumberOfCodeBlocks, 163 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 410 ConstructedInterpolants, 0 QuantifiedInterpolants, 40972 SizeOfPredicates, 8 NumberOfNonLiveVariables, 340 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 1508/1878 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...