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-call1_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:39:47,367 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:39:47,373 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:39:47,391 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:39:47,391 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:39:47,392 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:39:47,393 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:39:47,396 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:39:47,397 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:39:47,398 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:39:47,399 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:39:47,399 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:39:47,400 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:39:47,402 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:39:47,404 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:39:47,405 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:39:47,409 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:39:47,414 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:39:47,416 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:39:47,417 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:39:47,418 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:39:47,420 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:39:47,422 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:39:47,422 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:39:47,422 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:39:47,423 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:39:47,424 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:39:47,424 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:39:47,425 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:39:47,426 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:39:47,426 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:39:47,427 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:39:47,427 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:39:47,427 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:39:47,428 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:39:47,429 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:39:47,429 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:47,444 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:39:47,445 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:39:47,445 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:39:47,446 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:39:47,446 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:39:47,446 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:39:47,447 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:39:47,447 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:39:47,447 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:39:47,447 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:39:47,447 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:39:47,448 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:39:47,448 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:39:47,448 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:39:47,448 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:39:47,448 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:39:47,449 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:39:47,449 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:39:47,449 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:39:47,449 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:39:47,449 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:39:47,450 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:39:47,450 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:39:47,450 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:39:47,450 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:39:47,451 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:39:47,451 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:39:47,451 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:39:47,451 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:39:47,451 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:39:47,451 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:39:47,452 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:39:47,495 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:39:47,510 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:39:47,514 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:39:47,515 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:39:47,516 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:39:47,517 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_true-unreach-call1_true-termination.i [2018-11-14 16:39:47,577 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/529ea5ad8/11425eee7d104634850536bc2de585b1/FLAGb0964a82c [2018-11-14 16:39:48,025 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:39:48,025 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_true-unreach-call1_true-termination.i [2018-11-14 16:39:48,031 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/529ea5ad8/11425eee7d104634850536bc2de585b1/FLAGb0964a82c [2018-11-14 16:39:48,045 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/529ea5ad8/11425eee7d104634850536bc2de585b1 [2018-11-14 16:39:48,055 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:39:48,056 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:39:48,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:39:48,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:39:48,063 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:39:48,064 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:39:48" (1/1) ... [2018-11-14 16:39:48,067 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36543a22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:39:48, skipping insertion in model container [2018-11-14 16:39:48,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:39:48" (1/1) ... [2018-11-14 16:39:48,078 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:39:48,105 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:39:48,344 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:39:48,349 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:39:48,373 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:39:48,398 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:39:48,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:39:48 WrapperNode [2018-11-14 16:39:48,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:39:48,399 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:39:48,399 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:39:48,399 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:39:48,414 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:48" (1/1) ... [2018-11-14 16:39:48,414 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:48" (1/1) ... [2018-11-14 16:39:48,424 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:48" (1/1) ... [2018-11-14 16:39:48,425 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:48" (1/1) ... [2018-11-14 16:39:48,435 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:48" (1/1) ... [2018-11-14 16:39:48,441 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:48" (1/1) ... [2018-11-14 16:39:48,442 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:48" (1/1) ... [2018-11-14 16:39:48,445 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:39:48,445 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:39:48,445 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:39:48,445 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:39:48,447 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:39:48" (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:48,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:39:48,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:39:48,574 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 16:39:48,574 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:39:48,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:39:48,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 16:39:48,574 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:39:48,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:39:48,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 16:39:48,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 16:39:48,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:39:48,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:39:48,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:39:48,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 16:39:49,097 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:39:49,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:39:49 BoogieIcfgContainer [2018-11-14 16:39:49,098 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:39:49,099 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:39:49,099 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:39:49,102 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:39:49,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:39:48" (1/3) ... [2018-11-14 16:39:49,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cd649d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:39:49, skipping insertion in model container [2018-11-14 16:39:49,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:39:48" (2/3) ... [2018-11-14 16:39:49,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cd649d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:39:49, skipping insertion in model container [2018-11-14 16:39:49,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:39:49" (3/3) ... [2018-11-14 16:39:49,106 INFO L112 eAbstractionObserver]: Analyzing ICFG array_true-unreach-call1_true-termination.i [2018-11-14 16:39:49,116 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:39:49,125 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:39:49,143 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:39:49,188 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:39:49,189 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:39:49,189 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:39:49,189 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:39:49,189 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:39:49,189 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:39:49,189 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:39:49,189 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:39:49,190 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:39:49,205 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-14 16:39:49,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 16:39:49,211 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:39:49,212 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:39:49,214 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:39:49,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:39:49,220 INFO L82 PathProgramCache]: Analyzing trace with hash -173834890, now seen corresponding path program 1 times [2018-11-14 16:39:49,224 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:39:49,225 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:49,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:39:49,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:49,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:39:49,372 INFO L256 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {25#true} is VALID [2018-11-14 16:39:49,376 INFO L273 TraceCheckUtils]: 1: Hoare triple {25#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {25#true} is VALID [2018-11-14 16:39:49,376 INFO L273 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2018-11-14 16:39:49,377 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #36#return; {25#true} is VALID [2018-11-14 16:39:49,377 INFO L256 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret2 := main(); {25#true} is VALID [2018-11-14 16:39:49,377 INFO L273 TraceCheckUtils]: 5: Hoare triple {25#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192bv32);havoc ~i~0;~i~0 := 0bv32; {25#true} is VALID [2018-11-14 16:39:49,378 INFO L273 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2018-11-14 16:39:49,379 INFO L273 TraceCheckUtils]: 7: Hoare triple {26#false} call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(4092bv32, ~#A~0.offset), 4bv32); {26#false} is VALID [2018-11-14 16:39:49,379 INFO L256 TraceCheckUtils]: 8: Hoare triple {26#false} call __VERIFIER_assert((if #t~mem1 == 1023bv32 then 1bv32 else 0bv32)); {26#false} is VALID [2018-11-14 16:39:49,379 INFO L273 TraceCheckUtils]: 9: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2018-11-14 16:39:49,380 INFO L273 TraceCheckUtils]: 10: Hoare triple {26#false} assume ~cond == 0bv32; {26#false} is VALID [2018-11-14 16:39:49,380 INFO L273 TraceCheckUtils]: 11: Hoare triple {26#false} assume !false; {26#false} is VALID [2018-11-14 16:39:49,383 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:49,383 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:39:49,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:39:49,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:39:49,390 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-14 16:39:49,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:39:49,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:39:49,464 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:49,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:39:49,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:39:49,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:39:49,475 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-11-14 16:39:49,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:49,660 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-14 16:39:49,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:39:49,660 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-14 16:39:49,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:39:49,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:39:49,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2018-11-14 16:39:49,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:39:49,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2018-11-14 16:39:49,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 38 transitions. [2018-11-14 16:39:50,045 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:50,055 INFO L225 Difference]: With dead ends: 35 [2018-11-14 16:39:50,056 INFO L226 Difference]: Without dead ends: 15 [2018-11-14 16:39:50,059 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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:50,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-14 16:39:50,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-14 16:39:50,105 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:39:50,105 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-14 16:39:50,106 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-14 16:39:50,106 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-14 16:39:50,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:50,110 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-14 16:39:50,111 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-14 16:39:50,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:50,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:50,111 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-14 16:39:50,112 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-14 16:39:50,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:50,115 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-14 16:39:50,115 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-14 16:39:50,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:50,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:50,116 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:39:50,116 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:39:50,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 16:39:50,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-14 16:39:50,120 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-11-14 16:39:50,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:39:50,120 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-14 16:39:50,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:39:50,120 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-14 16:39:50,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-14 16:39:50,121 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:39:50,121 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:39:50,122 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:39:50,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:39:50,122 INFO L82 PathProgramCache]: Analyzing trace with hash -737648989, now seen corresponding path program 1 times [2018-11-14 16:39:50,122 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:39:50,123 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:50,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:39:50,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:50,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:39:50,272 INFO L256 TraceCheckUtils]: 0: Hoare triple {158#true} call ULTIMATE.init(); {158#true} is VALID [2018-11-14 16:39:50,272 INFO L273 TraceCheckUtils]: 1: Hoare triple {158#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {158#true} is VALID [2018-11-14 16:39:50,272 INFO L273 TraceCheckUtils]: 2: Hoare triple {158#true} assume true; {158#true} is VALID [2018-11-14 16:39:50,273 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {158#true} {158#true} #36#return; {158#true} is VALID [2018-11-14 16:39:50,273 INFO L256 TraceCheckUtils]: 4: Hoare triple {158#true} call #t~ret2 := main(); {158#true} is VALID [2018-11-14 16:39:50,279 INFO L273 TraceCheckUtils]: 5: Hoare triple {158#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192bv32);havoc ~i~0;~i~0 := 0bv32; {178#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:39:50,280 INFO L273 TraceCheckUtils]: 6: Hoare triple {178#(= main_~i~0 (_ bv0 32))} assume true; {178#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:39:50,282 INFO L273 TraceCheckUtils]: 7: Hoare triple {178#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 1024bv32); {159#false} is VALID [2018-11-14 16:39:50,282 INFO L273 TraceCheckUtils]: 8: Hoare triple {159#false} call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(4092bv32, ~#A~0.offset), 4bv32); {159#false} is VALID [2018-11-14 16:39:50,283 INFO L256 TraceCheckUtils]: 9: Hoare triple {159#false} call __VERIFIER_assert((if #t~mem1 == 1023bv32 then 1bv32 else 0bv32)); {159#false} is VALID [2018-11-14 16:39:50,283 INFO L273 TraceCheckUtils]: 10: Hoare triple {159#false} ~cond := #in~cond; {159#false} is VALID [2018-11-14 16:39:50,283 INFO L273 TraceCheckUtils]: 11: Hoare triple {159#false} assume ~cond == 0bv32; {159#false} is VALID [2018-11-14 16:39:50,284 INFO L273 TraceCheckUtils]: 12: Hoare triple {159#false} assume !false; {159#false} is VALID [2018-11-14 16:39:50,285 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:50,285 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:39:50,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:39:50,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:39:50,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-14 16:39:50,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:39:50,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:39:50,392 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:50,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:39:50,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:39:50,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:39:50,393 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 3 states. [2018-11-14 16:39:50,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:50,490 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-14 16:39:50,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:39:50,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-14 16:39:50,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:39:50,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:39:50,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2018-11-14 16:39:50,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:39:50,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2018-11-14 16:39:50,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 24 transitions. [2018-11-14 16:39:50,551 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:50,553 INFO L225 Difference]: With dead ends: 24 [2018-11-14 16:39:50,553 INFO L226 Difference]: Without dead ends: 18 [2018-11-14 16:39:50,554 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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:50,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-14 16:39:50,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-14 16:39:50,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:39:50,568 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 17 states. [2018-11-14 16:39:50,568 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 17 states. [2018-11-14 16:39:50,568 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 17 states. [2018-11-14 16:39:50,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:50,570 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-14 16:39:50,571 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-14 16:39:50,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:50,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:50,572 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 18 states. [2018-11-14 16:39:50,572 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 18 states. [2018-11-14 16:39:50,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:50,574 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-14 16:39:50,574 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-14 16:39:50,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:50,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:50,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:39:50,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:39:50,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 16:39:50,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-14 16:39:50,577 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 13 [2018-11-14 16:39:50,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:39:50,578 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-14 16:39:50,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:39:50,578 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-14 16:39:50,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 16:39:50,579 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:39:50,579 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:39:50,579 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:39:50,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:39:50,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1154592614, now seen corresponding path program 1 times [2018-11-14 16:39:50,580 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:39:50,581 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:50,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:39:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:50,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:39:51,016 INFO L256 TraceCheckUtils]: 0: Hoare triple {294#true} call ULTIMATE.init(); {294#true} is VALID [2018-11-14 16:39:51,017 INFO L273 TraceCheckUtils]: 1: Hoare triple {294#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {294#true} is VALID [2018-11-14 16:39:51,017 INFO L273 TraceCheckUtils]: 2: Hoare triple {294#true} assume true; {294#true} is VALID [2018-11-14 16:39:51,017 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {294#true} {294#true} #36#return; {294#true} is VALID [2018-11-14 16:39:51,018 INFO L256 TraceCheckUtils]: 4: Hoare triple {294#true} call #t~ret2 := main(); {294#true} is VALID [2018-11-14 16:39:51,032 INFO L273 TraceCheckUtils]: 5: Hoare triple {294#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192bv32);havoc ~i~0;~i~0 := 0bv32; {314#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:39:51,047 INFO L273 TraceCheckUtils]: 6: Hoare triple {314#(= main_~i~0 (_ bv0 32))} assume true; {314#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:39:51,062 INFO L273 TraceCheckUtils]: 7: Hoare triple {314#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {314#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:39:51,068 INFO L273 TraceCheckUtils]: 8: Hoare triple {314#(= main_~i~0 (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {324#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:51,069 INFO L273 TraceCheckUtils]: 9: Hoare triple {324#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {324#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:51,076 INFO L273 TraceCheckUtils]: 10: Hoare triple {324#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 1024bv32); {295#false} is VALID [2018-11-14 16:39:51,077 INFO L273 TraceCheckUtils]: 11: Hoare triple {295#false} call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(4092bv32, ~#A~0.offset), 4bv32); {295#false} is VALID [2018-11-14 16:39:51,077 INFO L256 TraceCheckUtils]: 12: Hoare triple {295#false} call __VERIFIER_assert((if #t~mem1 == 1023bv32 then 1bv32 else 0bv32)); {295#false} is VALID [2018-11-14 16:39:51,077 INFO L273 TraceCheckUtils]: 13: Hoare triple {295#false} ~cond := #in~cond; {295#false} is VALID [2018-11-14 16:39:51,078 INFO L273 TraceCheckUtils]: 14: Hoare triple {295#false} assume ~cond == 0bv32; {295#false} is VALID [2018-11-14 16:39:51,078 INFO L273 TraceCheckUtils]: 15: Hoare triple {295#false} assume !false; {295#false} is VALID [2018-11-14 16:39:51,080 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:51,080 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:39:51,172 INFO L273 TraceCheckUtils]: 15: Hoare triple {295#false} assume !false; {295#false} is VALID [2018-11-14 16:39:51,172 INFO L273 TraceCheckUtils]: 14: Hoare triple {295#false} assume ~cond == 0bv32; {295#false} is VALID [2018-11-14 16:39:51,173 INFO L273 TraceCheckUtils]: 13: Hoare triple {295#false} ~cond := #in~cond; {295#false} is VALID [2018-11-14 16:39:51,173 INFO L256 TraceCheckUtils]: 12: Hoare triple {295#false} call __VERIFIER_assert((if #t~mem1 == 1023bv32 then 1bv32 else 0bv32)); {295#false} is VALID [2018-11-14 16:39:51,173 INFO L273 TraceCheckUtils]: 11: Hoare triple {295#false} call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(4092bv32, ~#A~0.offset), 4bv32); {295#false} is VALID [2018-11-14 16:39:51,176 INFO L273 TraceCheckUtils]: 10: Hoare triple {361#(bvslt main_~i~0 (_ bv1024 32))} assume !~bvslt32(~i~0, 1024bv32); {295#false} is VALID [2018-11-14 16:39:51,176 INFO L273 TraceCheckUtils]: 9: Hoare triple {361#(bvslt main_~i~0 (_ bv1024 32))} assume true; {361#(bvslt main_~i~0 (_ bv1024 32))} is VALID [2018-11-14 16:39:51,180 INFO L273 TraceCheckUtils]: 8: Hoare triple {368#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {361#(bvslt main_~i~0 (_ bv1024 32))} is VALID [2018-11-14 16:39:51,184 INFO L273 TraceCheckUtils]: 7: Hoare triple {368#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {368#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:51,184 INFO L273 TraceCheckUtils]: 6: Hoare triple {368#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} assume true; {368#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:51,195 INFO L273 TraceCheckUtils]: 5: Hoare triple {294#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192bv32);havoc ~i~0;~i~0 := 0bv32; {368#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:51,195 INFO L256 TraceCheckUtils]: 4: Hoare triple {294#true} call #t~ret2 := main(); {294#true} is VALID [2018-11-14 16:39:51,195 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {294#true} {294#true} #36#return; {294#true} is VALID [2018-11-14 16:39:51,196 INFO L273 TraceCheckUtils]: 2: Hoare triple {294#true} assume true; {294#true} is VALID [2018-11-14 16:39:51,196 INFO L273 TraceCheckUtils]: 1: Hoare triple {294#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {294#true} is VALID [2018-11-14 16:39:51,196 INFO L256 TraceCheckUtils]: 0: Hoare triple {294#true} call ULTIMATE.init(); {294#true} is VALID [2018-11-14 16:39:51,198 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:51,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:39:51,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-14 16:39:51,205 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-14 16:39:51,205 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:39:51,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 16:39:51,410 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:51,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 16:39:51,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 16:39:51,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:39:51,411 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 6 states. [2018-11-14 16:39:51,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:51,653 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-11-14 16:39:51,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:39:51,653 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-14 16:39:51,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:39:51,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:39:51,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2018-11-14 16:39:51,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:39:51,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2018-11-14 16:39:51,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 34 transitions. [2018-11-14 16:39:51,775 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:51,777 INFO L225 Difference]: With dead ends: 32 [2018-11-14 16:39:51,777 INFO L226 Difference]: Without dead ends: 26 [2018-11-14 16:39:51,777 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:39:51,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-14 16:39:51,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-14 16:39:51,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:39:51,795 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-14 16:39:51,795 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-14 16:39:51,795 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-14 16:39:51,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:51,798 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-14 16:39:51,798 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-14 16:39:51,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:51,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:51,799 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-14 16:39:51,799 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-14 16:39:51,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:51,802 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-14 16:39:51,802 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-14 16:39:51,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:51,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:51,803 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:39:51,803 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:39:51,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 16:39:51,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-11-14 16:39:51,806 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 16 [2018-11-14 16:39:51,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:39:51,806 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-11-14 16:39:51,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 16:39:51,806 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-14 16:39:51,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 16:39:51,807 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:39:51,807 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:39:51,808 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:39:51,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:39:51,808 INFO L82 PathProgramCache]: Analyzing trace with hash -603146269, now seen corresponding path program 2 times [2018-11-14 16:39:51,809 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:39:51,809 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:51,832 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 16:39:51,877 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:39:51,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:39:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:51,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:39:52,043 INFO L256 TraceCheckUtils]: 0: Hoare triple {531#true} call ULTIMATE.init(); {531#true} is VALID [2018-11-14 16:39:52,044 INFO L273 TraceCheckUtils]: 1: Hoare triple {531#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {531#true} is VALID [2018-11-14 16:39:52,044 INFO L273 TraceCheckUtils]: 2: Hoare triple {531#true} assume true; {531#true} is VALID [2018-11-14 16:39:52,044 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {531#true} {531#true} #36#return; {531#true} is VALID [2018-11-14 16:39:52,045 INFO L256 TraceCheckUtils]: 4: Hoare triple {531#true} call #t~ret2 := main(); {531#true} is VALID [2018-11-14 16:39:52,047 INFO L273 TraceCheckUtils]: 5: Hoare triple {531#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192bv32);havoc ~i~0;~i~0 := 0bv32; {551#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:39:52,050 INFO L273 TraceCheckUtils]: 6: Hoare triple {551#(= main_~i~0 (_ bv0 32))} assume true; {551#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:39:52,050 INFO L273 TraceCheckUtils]: 7: Hoare triple {551#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {551#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:39:52,054 INFO L273 TraceCheckUtils]: 8: Hoare triple {551#(= main_~i~0 (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {561#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:52,055 INFO L273 TraceCheckUtils]: 9: Hoare triple {561#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {561#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:52,055 INFO L273 TraceCheckUtils]: 10: Hoare triple {561#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {561#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:52,056 INFO L273 TraceCheckUtils]: 11: Hoare triple {561#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {571#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 16:39:52,063 INFO L273 TraceCheckUtils]: 12: Hoare triple {571#(= (_ bv2 32) main_~i~0)} assume true; {571#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 16:39:52,064 INFO L273 TraceCheckUtils]: 13: Hoare triple {571#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {571#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 16:39:52,065 INFO L273 TraceCheckUtils]: 14: Hoare triple {571#(= (_ bv2 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {581#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:52,066 INFO L273 TraceCheckUtils]: 15: Hoare triple {581#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {581#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:52,066 INFO L273 TraceCheckUtils]: 16: Hoare triple {581#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {581#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:52,067 INFO L273 TraceCheckUtils]: 17: Hoare triple {581#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {591#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 16:39:52,067 INFO L273 TraceCheckUtils]: 18: Hoare triple {591#(= (_ bv4 32) main_~i~0)} assume true; {591#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 16:39:52,068 INFO L273 TraceCheckUtils]: 19: Hoare triple {591#(= (_ bv4 32) main_~i~0)} assume !~bvslt32(~i~0, 1024bv32); {532#false} is VALID [2018-11-14 16:39:52,068 INFO L273 TraceCheckUtils]: 20: Hoare triple {532#false} call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(4092bv32, ~#A~0.offset), 4bv32); {532#false} is VALID [2018-11-14 16:39:52,069 INFO L256 TraceCheckUtils]: 21: Hoare triple {532#false} call __VERIFIER_assert((if #t~mem1 == 1023bv32 then 1bv32 else 0bv32)); {532#false} is VALID [2018-11-14 16:39:52,069 INFO L273 TraceCheckUtils]: 22: Hoare triple {532#false} ~cond := #in~cond; {532#false} is VALID [2018-11-14 16:39:52,069 INFO L273 TraceCheckUtils]: 23: Hoare triple {532#false} assume ~cond == 0bv32; {532#false} is VALID [2018-11-14 16:39:52,070 INFO L273 TraceCheckUtils]: 24: Hoare triple {532#false} assume !false; {532#false} is VALID [2018-11-14 16:39:52,072 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:39:52,073 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:39:52,423 INFO L273 TraceCheckUtils]: 24: Hoare triple {532#false} assume !false; {532#false} is VALID [2018-11-14 16:39:52,423 INFO L273 TraceCheckUtils]: 23: Hoare triple {532#false} assume ~cond == 0bv32; {532#false} is VALID [2018-11-14 16:39:52,424 INFO L273 TraceCheckUtils]: 22: Hoare triple {532#false} ~cond := #in~cond; {532#false} is VALID [2018-11-14 16:39:52,424 INFO L256 TraceCheckUtils]: 21: Hoare triple {532#false} call __VERIFIER_assert((if #t~mem1 == 1023bv32 then 1bv32 else 0bv32)); {532#false} is VALID [2018-11-14 16:39:52,424 INFO L273 TraceCheckUtils]: 20: Hoare triple {532#false} call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(4092bv32, ~#A~0.offset), 4bv32); {532#false} is VALID [2018-11-14 16:39:52,425 INFO L273 TraceCheckUtils]: 19: Hoare triple {628#(bvslt main_~i~0 (_ bv1024 32))} assume !~bvslt32(~i~0, 1024bv32); {532#false} is VALID [2018-11-14 16:39:52,425 INFO L273 TraceCheckUtils]: 18: Hoare triple {628#(bvslt main_~i~0 (_ bv1024 32))} assume true; {628#(bvslt main_~i~0 (_ bv1024 32))} is VALID [2018-11-14 16:39:52,427 INFO L273 TraceCheckUtils]: 17: Hoare triple {635#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {628#(bvslt main_~i~0 (_ bv1024 32))} is VALID [2018-11-14 16:39:52,427 INFO L273 TraceCheckUtils]: 16: Hoare triple {635#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {635#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:52,428 INFO L273 TraceCheckUtils]: 15: Hoare triple {635#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} assume true; {635#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:52,433 INFO L273 TraceCheckUtils]: 14: Hoare triple {645#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {635#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:52,434 INFO L273 TraceCheckUtils]: 13: Hoare triple {645#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {645#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:52,434 INFO L273 TraceCheckUtils]: 12: Hoare triple {645#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} assume true; {645#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:52,438 INFO L273 TraceCheckUtils]: 11: Hoare triple {655#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {645#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:52,438 INFO L273 TraceCheckUtils]: 10: Hoare triple {655#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {655#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:52,439 INFO L273 TraceCheckUtils]: 9: Hoare triple {655#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} assume true; {655#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:52,442 INFO L273 TraceCheckUtils]: 8: Hoare triple {665#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {655#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:52,442 INFO L273 TraceCheckUtils]: 7: Hoare triple {665#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {665#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:52,443 INFO L273 TraceCheckUtils]: 6: Hoare triple {665#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} assume true; {665#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:52,444 INFO L273 TraceCheckUtils]: 5: Hoare triple {531#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192bv32);havoc ~i~0;~i~0 := 0bv32; {665#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:52,444 INFO L256 TraceCheckUtils]: 4: Hoare triple {531#true} call #t~ret2 := main(); {531#true} is VALID [2018-11-14 16:39:52,444 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {531#true} {531#true} #36#return; {531#true} is VALID [2018-11-14 16:39:52,445 INFO L273 TraceCheckUtils]: 2: Hoare triple {531#true} assume true; {531#true} is VALID [2018-11-14 16:39:52,445 INFO L273 TraceCheckUtils]: 1: Hoare triple {531#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {531#true} is VALID [2018-11-14 16:39:52,446 INFO L256 TraceCheckUtils]: 0: Hoare triple {531#true} call ULTIMATE.init(); {531#true} is VALID [2018-11-14 16:39:52,448 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:39:52,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:39:52,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-14 16:39:52,454 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-11-14 16:39:52,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:39:52,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 16:39:52,525 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:52,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 16:39:52,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 16:39:52,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:39:52,526 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 12 states. [2018-11-14 16:39:53,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:53,266 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-11-14 16:39:53,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 16:39:53,266 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-11-14 16:39:53,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:39:53,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:39:53,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 55 transitions. [2018-11-14 16:39:53,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:39:53,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 55 transitions. [2018-11-14 16:39:53,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 55 transitions. [2018-11-14 16:39:53,371 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:53,373 INFO L225 Difference]: With dead ends: 50 [2018-11-14 16:39:53,374 INFO L226 Difference]: Without dead ends: 44 [2018-11-14 16:39:53,374 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 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:39:53,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-14 16:39:53,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-14 16:39:53,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:39:53,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2018-11-14 16:39:53,414 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-14 16:39:53,414 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-14 16:39:53,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:53,417 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-11-14 16:39:53,418 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-14 16:39:53,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:53,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:53,419 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-14 16:39:53,419 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-14 16:39:53,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:53,422 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-11-14 16:39:53,422 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-14 16:39:53,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:53,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:53,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:39:53,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:39:53,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 16:39:53,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-11-14 16:39:53,426 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 25 [2018-11-14 16:39:53,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:39:53,427 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-11-14 16:39:53,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 16:39:53,427 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-14 16:39:53,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-14 16:39:53,429 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:39:53,429 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:39:53,429 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:39:53,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:39:53,430 INFO L82 PathProgramCache]: Analyzing trace with hash 581695939, now seen corresponding path program 3 times [2018-11-14 16:39:53,430 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:39:53,431 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:39:53,452 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-14 16:39:53,495 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 16:39:53,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:39:53,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:53,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:39:53,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-14 16:39:53,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-14 16:39:53,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:39:53,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:39:53,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:39:53,933 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-14 16:39:54,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-14 16:39:54,336 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:39:54,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-14 16:39:54,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:39:54,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:39:54,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:39:54,375 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:10 [2018-11-14 16:39:54,396 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:39:54,475 INFO L256 TraceCheckUtils]: 0: Hoare triple {918#true} call ULTIMATE.init(); {918#true} is VALID [2018-11-14 16:39:54,475 INFO L273 TraceCheckUtils]: 1: Hoare triple {918#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {918#true} is VALID [2018-11-14 16:39:54,476 INFO L273 TraceCheckUtils]: 2: Hoare triple {918#true} assume true; {918#true} is VALID [2018-11-14 16:39:54,476 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {918#true} {918#true} #36#return; {918#true} is VALID [2018-11-14 16:39:54,476 INFO L256 TraceCheckUtils]: 4: Hoare triple {918#true} call #t~ret2 := main(); {918#true} is VALID [2018-11-14 16:39:54,477 INFO L273 TraceCheckUtils]: 5: Hoare triple {918#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192bv32);havoc ~i~0;~i~0 := 0bv32; {938#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-14 16:39:54,478 INFO L273 TraceCheckUtils]: 6: Hoare triple {938#(= (_ bv0 32) |main_~#A~0.offset|)} assume true; {938#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-14 16:39:54,478 INFO L273 TraceCheckUtils]: 7: Hoare triple {938#(= (_ bv0 32) |main_~#A~0.offset|)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {938#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-14 16:39:54,479 INFO L273 TraceCheckUtils]: 8: Hoare triple {938#(= (_ bv0 32) |main_~#A~0.offset|)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {938#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-14 16:39:54,479 INFO L273 TraceCheckUtils]: 9: Hoare triple {938#(= (_ bv0 32) |main_~#A~0.offset|)} assume true; {938#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-14 16:39:54,480 INFO L273 TraceCheckUtils]: 10: Hoare triple {938#(= (_ bv0 32) |main_~#A~0.offset|)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {938#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-14 16:39:54,481 INFO L273 TraceCheckUtils]: 11: Hoare triple {938#(= (_ bv0 32) |main_~#A~0.offset|)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {938#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-14 16:39:54,481 INFO L273 TraceCheckUtils]: 12: Hoare triple {938#(= (_ bv0 32) |main_~#A~0.offset|)} assume true; {938#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-14 16:39:54,492 INFO L273 TraceCheckUtils]: 13: Hoare triple {938#(= (_ bv0 32) |main_~#A~0.offset|)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {938#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-14 16:39:54,506 INFO L273 TraceCheckUtils]: 14: Hoare triple {938#(= (_ bv0 32) |main_~#A~0.offset|)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {938#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-14 16:39:54,507 INFO L273 TraceCheckUtils]: 15: Hoare triple {938#(= (_ bv0 32) |main_~#A~0.offset|)} assume true; {938#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-14 16:39:54,508 INFO L273 TraceCheckUtils]: 16: Hoare triple {938#(= (_ bv0 32) |main_~#A~0.offset|)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {938#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-14 16:39:54,508 INFO L273 TraceCheckUtils]: 17: Hoare triple {938#(= (_ bv0 32) |main_~#A~0.offset|)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {938#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-14 16:39:54,510 INFO L273 TraceCheckUtils]: 18: Hoare triple {938#(= (_ bv0 32) |main_~#A~0.offset|)} assume true; {938#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-14 16:39:54,510 INFO L273 TraceCheckUtils]: 19: Hoare triple {938#(= (_ bv0 32) |main_~#A~0.offset|)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {938#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-14 16:39:54,511 INFO L273 TraceCheckUtils]: 20: Hoare triple {938#(= (_ bv0 32) |main_~#A~0.offset|)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {938#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-14 16:39:54,515 INFO L273 TraceCheckUtils]: 21: Hoare triple {938#(= (_ bv0 32) |main_~#A~0.offset|)} assume true; {938#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-14 16:39:54,516 INFO L273 TraceCheckUtils]: 22: Hoare triple {938#(= (_ bv0 32) |main_~#A~0.offset|)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {938#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-14 16:39:54,516 INFO L273 TraceCheckUtils]: 23: Hoare triple {938#(= (_ bv0 32) |main_~#A~0.offset|)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {938#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-14 16:39:54,517 INFO L273 TraceCheckUtils]: 24: Hoare triple {938#(= (_ bv0 32) |main_~#A~0.offset|)} assume true; {938#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-14 16:39:54,517 INFO L273 TraceCheckUtils]: 25: Hoare triple {938#(= (_ bv0 32) |main_~#A~0.offset|)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {938#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-14 16:39:54,518 INFO L273 TraceCheckUtils]: 26: Hoare triple {938#(= (_ bv0 32) |main_~#A~0.offset|)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {938#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-14 16:39:54,518 INFO L273 TraceCheckUtils]: 27: Hoare triple {938#(= (_ bv0 32) |main_~#A~0.offset|)} assume true; {938#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-14 16:39:54,518 INFO L273 TraceCheckUtils]: 28: Hoare triple {938#(= (_ bv0 32) |main_~#A~0.offset|)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {938#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-14 16:39:54,519 INFO L273 TraceCheckUtils]: 29: Hoare triple {938#(= (_ bv0 32) |main_~#A~0.offset|)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {938#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-14 16:39:54,519 INFO L273 TraceCheckUtils]: 30: Hoare triple {938#(= (_ bv0 32) |main_~#A~0.offset|)} assume true; {938#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-14 16:39:54,520 INFO L273 TraceCheckUtils]: 31: Hoare triple {938#(= (_ bv0 32) |main_~#A~0.offset|)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {938#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-14 16:39:54,521 INFO L273 TraceCheckUtils]: 32: Hoare triple {938#(= (_ bv0 32) |main_~#A~0.offset|)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {938#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-14 16:39:54,522 INFO L273 TraceCheckUtils]: 33: Hoare triple {938#(= (_ bv0 32) |main_~#A~0.offset|)} assume true; {938#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-14 16:39:54,540 INFO L273 TraceCheckUtils]: 34: Hoare triple {938#(= (_ bv0 32) |main_~#A~0.offset|)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1026#(and (= (_ bv0 32) |main_~#A~0.offset|) (= main_~i~0 (select (select |#memory_int| |main_~#A~0.base|) (bvadd |main_~#A~0.offset| (bvmul (_ bv4 32) main_~i~0)))) (bvslt main_~i~0 (_ bv1024 32)))} is VALID [2018-11-14 16:39:56,564 INFO L273 TraceCheckUtils]: 35: Hoare triple {1026#(and (= (_ bv0 32) |main_~#A~0.offset|) (= main_~i~0 (select (select |#memory_int| |main_~#A~0.base|) (bvadd |main_~#A~0.offset| (bvmul (_ bv4 32) main_~i~0)))) (bvslt main_~i~0 (_ bv1024 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1030#(and (= (_ bv0 32) |main_~#A~0.offset|) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv1024 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| |main_~#A~0.base|) (bvadd |main_~#A~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))))} is UNKNOWN [2018-11-14 16:39:56,566 INFO L273 TraceCheckUtils]: 36: Hoare triple {1030#(and (= (_ bv0 32) |main_~#A~0.offset|) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv1024 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| |main_~#A~0.base|) (bvadd |main_~#A~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))))} assume true; {1030#(and (= (_ bv0 32) |main_~#A~0.offset|) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv1024 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| |main_~#A~0.base|) (bvadd |main_~#A~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))))} is VALID [2018-11-14 16:39:56,568 INFO L273 TraceCheckUtils]: 37: Hoare triple {1030#(and (= (_ bv0 32) |main_~#A~0.offset|) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv1024 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| |main_~#A~0.base|) (bvadd |main_~#A~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))))} assume !~bvslt32(~i~0, 1024bv32); {1037#(and (= (_ bv0 32) |main_~#A~0.offset|) (exists ((main_~i~0 (_ BitVec 32))) (and (not (bvslt main_~i~0 (_ bv1024 32))) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv1024 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| |main_~#A~0.base|) (bvadd |main_~#A~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))))))} is VALID [2018-11-14 16:39:56,573 INFO L273 TraceCheckUtils]: 38: Hoare triple {1037#(and (= (_ bv0 32) |main_~#A~0.offset|) (exists ((main_~i~0 (_ BitVec 32))) (and (not (bvslt main_~i~0 (_ bv1024 32))) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv1024 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| |main_~#A~0.base|) (bvadd |main_~#A~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))))))} call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(4092bv32, ~#A~0.offset), 4bv32); {1041#(and (not (bvslt (bvadd |main_#t~mem1| (_ bv1 32)) (_ bv1024 32))) (bvslt |main_#t~mem1| (_ bv1024 32)))} is VALID [2018-11-14 16:39:56,575 INFO L256 TraceCheckUtils]: 39: Hoare triple {1041#(and (not (bvslt (bvadd |main_#t~mem1| (_ bv1 32)) (_ bv1024 32))) (bvslt |main_#t~mem1| (_ bv1024 32)))} call __VERIFIER_assert((if #t~mem1 == 1023bv32 then 1bv32 else 0bv32)); {1045#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:56,576 INFO L273 TraceCheckUtils]: 40: Hoare triple {1045#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1049#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:56,577 INFO L273 TraceCheckUtils]: 41: Hoare triple {1049#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {919#false} is VALID [2018-11-14 16:39:56,577 INFO L273 TraceCheckUtils]: 42: Hoare triple {919#false} assume !false; {919#false} is VALID [2018-11-14 16:39:56,583 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-14 16:39:56,583 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:39:56,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:39:56,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-14 16:39:56,586 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-11-14 16:39:56,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:39:56,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 16:39:58,655 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 17 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:58,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 16:39:58,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 16:39:58,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:39:58,656 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 9 states. [2018-11-14 16:39:59,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:59,603 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-11-14 16:39:59,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 16:39:59,604 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-11-14 16:39:59,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:39:59,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:39:59,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2018-11-14 16:39:59,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:39:59,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2018-11-14 16:39:59,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 18 transitions. [2018-11-14 16:40:03,713 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 16 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2018-11-14 16:40:03,714 INFO L225 Difference]: With dead ends: 44 [2018-11-14 16:40:03,714 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 16:40:03,715 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-11-14 16:40:03,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 16:40:03,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 16:40:03,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:40:03,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 16:40:03,716 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 16:40:03,716 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 16:40:03,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:03,716 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 16:40:03,717 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 16:40:03,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:40:03,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:40:03,717 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 16:40:03,717 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 16:40:03,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:03,717 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 16:40:03,718 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 16:40:03,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:40:03,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:40:03,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:40:03,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:40:03,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 16:40:03,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 16:40:03,719 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2018-11-14 16:40:03,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:40:03,719 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 16:40:03,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 16:40:03,719 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 16:40:03,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:40:03,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 16:40:04,075 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-14 16:40:04,075 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-14 16:40:04,075 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 16:40:04,075 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 16:40:04,075 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 16:40:04,076 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 16:40:04,076 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 16:40:04,076 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 8 15) the Hoare annotation is: true [2018-11-14 16:40:04,076 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 8 15) no Hoare annotation was computed. [2018-11-14 16:40:04,077 INFO L421 ceAbstractionStarter]: At program point L14(line 14) the Hoare annotation is: (let ((.cse0 (bvadd main_~i~0 (_ bv4294967295 32)))) (and (not (bvslt (bvadd |main_#t~mem1| (_ bv1 32)) (_ bv1024 32))) (= (_ bv0 32) |main_~#A~0.offset|) (bvslt .cse0 (_ bv1024 32)) (exists ((main_~i~0 (_ BitVec 32))) (let ((.cse1 (bvadd main_~i~0 (_ bv4294967295 32)))) (and (not (bvslt main_~i~0 (_ bv1024 32))) (bvslt .cse1 (_ bv1024 32)) (= .cse1 (select (select |#memory_int| |main_~#A~0.base|) (bvadd |main_~#A~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32))))))) (= .cse0 (select (select |#memory_int| |main_~#A~0.base|) (bvadd |main_~#A~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))) (bvslt |main_#t~mem1| (_ bv1024 32)))) [2018-11-14 16:40:04,077 INFO L425 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2018-11-14 16:40:04,077 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 8 15) no Hoare annotation was computed. [2018-11-14 16:40:04,078 INFO L425 ceAbstractionStarter]: For program point L11-1(lines 11 13) no Hoare annotation was computed. [2018-11-14 16:40:04,078 INFO L425 ceAbstractionStarter]: For program point L11-3(lines 11 13) no Hoare annotation was computed. [2018-11-14 16:40:04,078 INFO L421 ceAbstractionStarter]: At program point L11-4(lines 11 13) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) |main_~#A~0.offset|))) (or (let ((.cse1 (bvadd main_~i~0 (_ bv4294967295 32)))) (and .cse0 (bvslt .cse1 (_ bv1024 32)) (= .cse1 (select (select |#memory_int| |main_~#A~0.base|) (bvadd |main_~#A~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))))) (and .cse0 (= main_~i~0 (_ bv0 32))))) [2018-11-14 16:40:04,078 INFO L425 ceAbstractionStarter]: For program point L11-5(lines 11 13) no Hoare annotation was computed. [2018-11-14 16:40:04,078 INFO L425 ceAbstractionStarter]: For program point L3-2(lines 2 7) no Hoare annotation was computed. [2018-11-14 16:40:04,079 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2018-11-14 16:40:04,079 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 2 7) the Hoare annotation is: true [2018-11-14 16:40:04,079 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 2 7) no Hoare annotation was computed. [2018-11-14 16:40:04,079 INFO L425 ceAbstractionStarter]: For program point L4(line 4) no Hoare annotation was computed. [2018-11-14 16:40:04,079 INFO L425 ceAbstractionStarter]: For program point L3(lines 3 5) no Hoare annotation was computed. [2018-11-14 16:40:04,081 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 16:40:04,083 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-14 16:40:04,083 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 16:40:04,083 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 16:40:04,083 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2018-11-14 16:40:04,083 WARN L170 areAnnotationChecker]: L11-5 has no Hoare annotation [2018-11-14 16:40:04,083 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-14 16:40:04,083 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-14 16:40:04,083 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 16:40:04,083 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 16:40:04,084 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2018-11-14 16:40:04,084 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2018-11-14 16:40:04,084 WARN L170 areAnnotationChecker]: L11-5 has no Hoare annotation [2018-11-14 16:40:04,084 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 16:40:04,084 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 16:40:04,084 WARN L170 areAnnotationChecker]: L3-2 has no Hoare annotation [2018-11-14 16:40:04,084 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2018-11-14 16:40:04,084 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2018-11-14 16:40:04,084 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 16:40:04,084 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2018-11-14 16:40:04,085 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 16:40:04,085 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 16:40:04,085 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 16:40:04,091 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 16:40:04,094 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 16:40:04,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 04:40:04 BoogieIcfgContainer [2018-11-14 16:40:04,097 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 16:40:04,098 INFO L168 Benchmark]: Toolchain (without parser) took 16042.15 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 739.2 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -350.0 MB). Peak memory consumption was 389.2 MB. Max. memory is 7.1 GB. [2018-11-14 16:40:04,099 INFO L168 Benchmark]: CDTParser took 0.27 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:04,100 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.38 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:04,101 INFO L168 Benchmark]: Boogie Preprocessor took 45.71 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:04,101 INFO L168 Benchmark]: RCFGBuilder took 653.08 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 739.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -776.2 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-14 16:40:04,102 INFO L168 Benchmark]: TraceAbstraction took 14997.57 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 415.6 MB). Peak memory consumption was 415.6 MB. Max. memory is 7.1 GB. [2018-11-14 16:40:04,107 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.27 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 340.38 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 45.71 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 653.08 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 739.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -776.2 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14997.57 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 415.6 MB). Peak memory consumption was 415.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: 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: 11]: Loop Invariant [2018-11-14 16:40:04,114 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 16:40:04,115 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((0bv32 == A && ~bvslt32(~bvadd64(i, 4294967295bv32), 1024bv32)) && ~bvadd64(i, 4294967295bv32) == unknown-#memory_int-unknown[A][~bvadd64(A, ~bvmul32(4bv32, i), 4294967292bv32)]) || (0bv32 == A && i == 0bv32) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. SAFE Result, 14.9s OverallTime, 5 OverallIterations, 11 TraceHistogramMax, 7.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 75 SDtfs, 20 SDslu, 167 SDs, 0 SdLazy, 132 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=4, 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.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 11 PreInvPairs, 22 NumberOfFragments, 93 HoareAnnotationTreeSize, 11 FomulaSimplifications, 269 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 109 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 143 ConstructedInterpolants, 1 QuantifiedInterpolants, 13225 SizeOfPredicates, 9 NumberOfNonLiveVariables, 203 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 155/211 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...