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_Default.epf -i ../../../trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 23:56:14,238 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 23:56:14,243 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 23:56:14,260 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 23:56:14,260 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 23:56:14,261 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 23:56:14,263 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 23:56:14,266 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 23:56:14,268 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 23:56:14,269 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 23:56:14,271 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 23:56:14,271 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 23:56:14,277 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 23:56:14,279 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 23:56:14,283 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 23:56:14,284 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 23:56:14,285 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 23:56:14,289 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 23:56:14,293 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 23:56:14,295 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 23:56:14,296 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 23:56:14,297 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 23:56:14,299 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 23:56:14,299 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 23:56:14,300 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 23:56:14,301 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 23:56:14,301 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 23:56:14,302 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 23:56:14,303 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 23:56:14,304 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 23:56:14,304 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 23:56:14,305 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 23:56:14,305 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 23:56:14,305 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 23:56:14,306 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 23:56:14,307 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 23:56:14,307 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 23:56:14,322 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 23:56:14,322 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 23:56:14,323 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 23:56:14,323 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 23:56:14,324 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 23:56:14,324 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 23:56:14,324 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 23:56:14,324 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 23:56:14,325 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 23:56:14,325 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 23:56:14,325 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 23:56:14,325 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 23:56:14,325 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 23:56:14,325 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 23:56:14,326 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 23:56:14,326 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 23:56:14,326 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 23:56:14,326 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 23:56:14,326 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 23:56:14,327 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 23:56:14,327 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 23:56:14,327 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 23:56:14,327 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 23:56:14,327 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 23:56:14,328 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 23:56:14,328 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 23:56:14,328 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 23:56:14,328 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 23:56:14,328 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 23:56:14,329 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 23:56:14,329 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 23:56:14,394 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 23:56:14,412 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 23:56:14,417 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 23:56:14,419 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 23:56:14,419 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 23:56:14,420 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i [2018-11-18 23:56:14,487 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9679e331f/737adb54ef934d448122221f7b249fdc/FLAGa15dc0739 [2018-11-18 23:56:14,910 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 23:56:14,911 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i [2018-11-18 23:56:14,919 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9679e331f/737adb54ef934d448122221f7b249fdc/FLAGa15dc0739 [2018-11-18 23:56:15,287 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9679e331f/737adb54ef934d448122221f7b249fdc [2018-11-18 23:56:15,297 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 23:56:15,299 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 23:56:15,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 23:56:15,300 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 23:56:15,304 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 23:56:15,307 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:56:15" (1/1) ... [2018-11-18 23:56:15,310 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25367905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:56:15, skipping insertion in model container [2018-11-18 23:56:15,310 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:56:15" (1/1) ... [2018-11-18 23:56:15,320 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 23:56:15,343 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 23:56:15,594 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:56:15,599 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 23:56:15,626 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:56:15,648 INFO L195 MainTranslator]: Completed translation [2018-11-18 23:56:15,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:56:15 WrapperNode [2018-11-18 23:56:15,649 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 23:56:15,650 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 23:56:15,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 23:56:15,650 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 23:56:15,666 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:56:15" (1/1) ... [2018-11-18 23:56:15,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:56:15" (1/1) ... [2018-11-18 23:56:15,676 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:56:15" (1/1) ... [2018-11-18 23:56:15,677 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:56:15" (1/1) ... [2018-11-18 23:56:15,690 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:56:15" (1/1) ... [2018-11-18 23:56:15,700 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:56:15" (1/1) ... [2018-11-18 23:56:15,703 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:56:15" (1/1) ... [2018-11-18 23:56:15,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 23:56:15,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 23:56:15,706 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 23:56:15,706 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 23:56:15,710 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:56:15" (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-18 23:56:15,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 23:56:15,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 23:56:15,839 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 23:56:15,839 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 23:56:15,839 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 23:56:15,839 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 23:56:15,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2018-11-18 23:56:15,840 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 23:56:15,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 23:56:15,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 23:56:15,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 23:56:15,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 23:56:15,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 23:56:15,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 23:56:15,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 23:56:16,464 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 23:56:16,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:56:16 BoogieIcfgContainer [2018-11-18 23:56:16,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 23:56:16,466 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 23:56:16,466 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 23:56:16,470 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 23:56:16,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:56:15" (1/3) ... [2018-11-18 23:56:16,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47943c91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:56:16, skipping insertion in model container [2018-11-18 23:56:16,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:56:15" (2/3) ... [2018-11-18 23:56:16,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47943c91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:56:16, skipping insertion in model container [2018-11-18 23:56:16,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:56:16" (3/3) ... [2018-11-18 23:56:16,474 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort_false-unreach-call_true-termination.i [2018-11-18 23:56:16,484 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 23:56:16,491 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 23:56:16,504 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 23:56:16,538 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 23:56:16,539 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 23:56:16,539 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 23:56:16,539 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 23:56:16,540 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 23:56:16,542 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 23:56:16,542 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 23:56:16,542 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 23:56:16,543 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 23:56:16,563 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-18 23:56:16,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 23:56:16,570 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:56:16,571 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:56:16,576 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:56:16,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:56:16,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1403248464, now seen corresponding path program 1 times [2018-11-18 23:56:16,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:56:16,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:56:16,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:56:16,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:56:16,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:56:16,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:56:16,743 INFO L256 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2018-11-18 23:56:16,747 INFO L273 TraceCheckUtils]: 1: Hoare triple {36#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {36#true} is VALID [2018-11-18 23:56:16,747 INFO L273 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2018-11-18 23:56:16,748 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #79#return; {36#true} is VALID [2018-11-18 23:56:16,748 INFO L256 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret9 := main(); {36#true} is VALID [2018-11-18 23:56:16,748 INFO L273 TraceCheckUtils]: 5: Hoare triple {36#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 1; {36#true} is VALID [2018-11-18 23:56:16,749 INFO L273 TraceCheckUtils]: 6: Hoare triple {36#true} assume !true; {37#false} is VALID [2018-11-18 23:56:16,749 INFO L273 TraceCheckUtils]: 7: Hoare triple {37#false} ~k~0 := 1; {37#false} is VALID [2018-11-18 23:56:16,750 INFO L273 TraceCheckUtils]: 8: Hoare triple {37#false} assume true; {37#false} is VALID [2018-11-18 23:56:16,750 INFO L273 TraceCheckUtils]: 9: Hoare triple {37#false} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem7 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {37#false} is VALID [2018-11-18 23:56:16,750 INFO L256 TraceCheckUtils]: 10: Hoare triple {37#false} call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); {37#false} is VALID [2018-11-18 23:56:16,751 INFO L273 TraceCheckUtils]: 11: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2018-11-18 23:56:16,751 INFO L273 TraceCheckUtils]: 12: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2018-11-18 23:56:16,752 INFO L273 TraceCheckUtils]: 13: Hoare triple {37#false} assume !false; {37#false} is VALID [2018-11-18 23:56:16,755 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-18 23:56:16,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:56:16,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 23:56:16,764 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-18 23:56:16,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:56:16,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 23:56:16,918 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:56:16,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 23:56:16,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 23:56:16,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 23:56:16,931 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-11-18 23:56:17,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:56:17,250 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2018-11-18 23:56:17,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 23:56:17,250 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-18 23:56:17,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:56:17,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:56:17,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 77 transitions. [2018-11-18 23:56:17,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:56:17,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 77 transitions. [2018-11-18 23:56:17,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 77 transitions. [2018-11-18 23:56:17,542 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:56:17,554 INFO L225 Difference]: With dead ends: 60 [2018-11-18 23:56:17,554 INFO L226 Difference]: Without dead ends: 28 [2018-11-18 23:56:17,558 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-18 23:56:17,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-18 23:56:17,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-18 23:56:17,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:56:17,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-18 23:56:17,600 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-18 23:56:17,600 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-18 23:56:17,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:56:17,605 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-18 23:56:17,605 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-18 23:56:17,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:56:17,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:56:17,606 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-18 23:56:17,606 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-18 23:56:17,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:56:17,610 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-18 23:56:17,610 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-18 23:56:17,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:56:17,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:56:17,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:56:17,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:56:17,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 23:56:17,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-18 23:56:17,616 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 14 [2018-11-18 23:56:17,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:56:17,617 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-18 23:56:17,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 23:56:17,617 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-18 23:56:17,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 23:56:17,618 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:56:17,618 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:56:17,618 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:56:17,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:56:17,619 INFO L82 PathProgramCache]: Analyzing trace with hash 969867983, now seen corresponding path program 1 times [2018-11-18 23:56:17,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:56:17,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:56:17,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:56:17,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:56:17,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:56:17,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:56:17,920 INFO L256 TraceCheckUtils]: 0: Hoare triple {207#true} call ULTIMATE.init(); {207#true} is VALID [2018-11-18 23:56:17,920 INFO L273 TraceCheckUtils]: 1: Hoare triple {207#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {207#true} is VALID [2018-11-18 23:56:17,921 INFO L273 TraceCheckUtils]: 2: Hoare triple {207#true} assume true; {207#true} is VALID [2018-11-18 23:56:17,922 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {207#true} {207#true} #79#return; {207#true} is VALID [2018-11-18 23:56:17,922 INFO L256 TraceCheckUtils]: 4: Hoare triple {207#true} call #t~ret9 := main(); {207#true} is VALID [2018-11-18 23:56:17,923 INFO L273 TraceCheckUtils]: 5: Hoare triple {207#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 1; {209#(and (<= main_~j~0 1) (<= 1 main_~j~0))} is VALID [2018-11-18 23:56:17,924 INFO L273 TraceCheckUtils]: 6: Hoare triple {209#(and (<= main_~j~0 1) (<= 1 main_~j~0))} assume true; {209#(and (<= main_~j~0 1) (<= 1 main_~j~0))} is VALID [2018-11-18 23:56:17,925 INFO L273 TraceCheckUtils]: 7: Hoare triple {209#(and (<= main_~j~0 1) (<= 1 main_~j~0))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {210#(<= main_~SIZE~0 (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 1))} is VALID [2018-11-18 23:56:17,926 INFO L273 TraceCheckUtils]: 8: Hoare triple {210#(<= main_~SIZE~0 (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 1))} ~k~0 := 1; {211#(and (= main_~k~0 1) (<= (+ main_~SIZE~0 (* 4294967296 (div main_~k~0 4294967296))) (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 1)))} is VALID [2018-11-18 23:56:17,928 INFO L273 TraceCheckUtils]: 9: Hoare triple {211#(and (= main_~k~0 1) (<= (+ main_~SIZE~0 (* 4294967296 (div main_~k~0 4294967296))) (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 1)))} assume true; {211#(and (= main_~k~0 1) (<= (+ main_~SIZE~0 (* 4294967296 (div main_~k~0 4294967296))) (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 1)))} is VALID [2018-11-18 23:56:17,937 INFO L273 TraceCheckUtils]: 10: Hoare triple {211#(and (= main_~k~0 1) (<= (+ main_~SIZE~0 (* 4294967296 (div main_~k~0 4294967296))) (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 1)))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem7 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {208#false} is VALID [2018-11-18 23:56:17,938 INFO L256 TraceCheckUtils]: 11: Hoare triple {208#false} call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); {208#false} is VALID [2018-11-18 23:56:17,938 INFO L273 TraceCheckUtils]: 12: Hoare triple {208#false} ~cond := #in~cond; {208#false} is VALID [2018-11-18 23:56:17,939 INFO L273 TraceCheckUtils]: 13: Hoare triple {208#false} assume 0 == ~cond; {208#false} is VALID [2018-11-18 23:56:17,939 INFO L273 TraceCheckUtils]: 14: Hoare triple {208#false} assume !false; {208#false} is VALID [2018-11-18 23:56:17,942 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-18 23:56:17,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:56:17,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 23:56:17,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-18 23:56:17,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:56:17,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 23:56:18,040 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:56:18,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 23:56:18,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 23:56:18,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 23:56:18,041 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2018-11-18 23:56:18,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:56:18,720 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-18 23:56:18,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 23:56:18,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-18 23:56:18,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:56:18,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:56:18,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2018-11-18 23:56:18,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:56:18,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2018-11-18 23:56:18,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2018-11-18 23:56:18,821 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:56:18,823 INFO L225 Difference]: With dead ends: 52 [2018-11-18 23:56:18,823 INFO L226 Difference]: Without dead ends: 38 [2018-11-18 23:56:18,825 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-18 23:56:18,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-18 23:56:18,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2018-11-18 23:56:18,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:56:18,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 30 states. [2018-11-18 23:56:18,866 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 30 states. [2018-11-18 23:56:18,866 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 30 states. [2018-11-18 23:56:18,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:56:18,870 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2018-11-18 23:56:18,870 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-18 23:56:18,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:56:18,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:56:18,871 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 38 states. [2018-11-18 23:56:18,871 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 38 states. [2018-11-18 23:56:18,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:56:18,874 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2018-11-18 23:56:18,875 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-18 23:56:18,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:56:18,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:56:18,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:56:18,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:56:18,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 23:56:18,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-11-18 23:56:18,878 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 15 [2018-11-18 23:56:18,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:56:18,879 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-18 23:56:18,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 23:56:18,879 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-18 23:56:18,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 23:56:18,880 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:56:18,880 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:56:18,880 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:56:18,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:56:18,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1889876064, now seen corresponding path program 1 times [2018-11-18 23:56:18,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:56:18,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:56:18,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:56:18,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:56:18,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:56:18,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:56:19,905 INFO L256 TraceCheckUtils]: 0: Hoare triple {401#true} call ULTIMATE.init(); {401#true} is VALID [2018-11-18 23:56:19,905 INFO L273 TraceCheckUtils]: 1: Hoare triple {401#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {401#true} is VALID [2018-11-18 23:56:19,906 INFO L273 TraceCheckUtils]: 2: Hoare triple {401#true} assume true; {401#true} is VALID [2018-11-18 23:56:19,907 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {401#true} {401#true} #79#return; {401#true} is VALID [2018-11-18 23:56:19,907 INFO L256 TraceCheckUtils]: 4: Hoare triple {401#true} call #t~ret9 := main(); {401#true} is VALID [2018-11-18 23:56:19,909 INFO L273 TraceCheckUtils]: 5: Hoare triple {401#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 1; {403#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0))} is VALID [2018-11-18 23:56:19,909 INFO L273 TraceCheckUtils]: 6: Hoare triple {403#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0))} assume true; {403#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0))} is VALID [2018-11-18 23:56:19,911 INFO L273 TraceCheckUtils]: 7: Hoare triple {403#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem2 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~j~0 - 1; {404#(and (= 0 (+ (* 4 main_~i~0) |main_~#v~0.offset|)) (= |main_~#v~0.offset| 0) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4)))} is VALID [2018-11-18 23:56:19,911 INFO L273 TraceCheckUtils]: 8: Hoare triple {404#(and (= 0 (+ (* 4 main_~i~0) |main_~#v~0.offset|)) (= |main_~#v~0.offset| 0) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4)))} assume true; {404#(and (= 0 (+ (* 4 main_~i~0) |main_~#v~0.offset|)) (= |main_~#v~0.offset| 0) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4)))} is VALID [2018-11-18 23:56:19,912 INFO L273 TraceCheckUtils]: 9: Hoare triple {404#(and (= 0 (+ (* 4 main_~i~0) |main_~#v~0.offset|)) (= |main_~#v~0.offset| 0) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4)))} #t~short4 := ~i~0 >= 0; {404#(and (= 0 (+ (* 4 main_~i~0) |main_~#v~0.offset|)) (= |main_~#v~0.offset| 0) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4)))} is VALID [2018-11-18 23:56:19,914 INFO L273 TraceCheckUtils]: 10: Hoare triple {404#(and (= 0 (+ (* 4 main_~i~0) |main_~#v~0.offset|)) (= |main_~#v~0.offset| 0) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4)))} assume #t~short4;call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short4 := #t~mem3 > ~key~0; {405#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (or |main_#t~short4| (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0))) main_~key~0)) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4)))} is VALID [2018-11-18 23:56:19,916 INFO L273 TraceCheckUtils]: 11: Hoare triple {405#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (or |main_#t~short4| (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0))) main_~key~0)) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4)))} assume !#t~short4;havoc #t~mem3;havoc #t~short4; {406#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4)) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0))) main_~key~0))} is VALID [2018-11-18 23:56:19,918 INFO L273 TraceCheckUtils]: 12: Hoare triple {406#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4)) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0))) main_~key~0))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {407#(and (<= main_~j~0 1) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~j~0)))) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0))} is VALID [2018-11-18 23:56:19,919 INFO L273 TraceCheckUtils]: 13: Hoare triple {407#(and (<= main_~j~0 1) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~j~0)))) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {408#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))))} is VALID [2018-11-18 23:56:19,921 INFO L273 TraceCheckUtils]: 14: Hoare triple {408#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))))} assume true; {408#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))))} is VALID [2018-11-18 23:56:19,922 INFO L273 TraceCheckUtils]: 15: Hoare triple {408#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {408#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))))} is VALID [2018-11-18 23:56:19,923 INFO L273 TraceCheckUtils]: 16: Hoare triple {408#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))))} ~k~0 := 1; {409#(and (= main_~k~0 1) (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0)))))} is VALID [2018-11-18 23:56:19,924 INFO L273 TraceCheckUtils]: 17: Hoare triple {409#(and (= main_~k~0 1) (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0)))))} assume true; {409#(and (= main_~k~0 1) (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0)))))} is VALID [2018-11-18 23:56:19,926 INFO L273 TraceCheckUtils]: 18: Hoare triple {409#(and (= main_~k~0 1) (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0)))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem7 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {410#(<= |main_#t~mem7| |main_#t~mem8|)} is VALID [2018-11-18 23:56:19,928 INFO L256 TraceCheckUtils]: 19: Hoare triple {410#(<= |main_#t~mem7| |main_#t~mem8|)} call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); {411#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-18 23:56:19,929 INFO L273 TraceCheckUtils]: 20: Hoare triple {411#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {412#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-18 23:56:19,931 INFO L273 TraceCheckUtils]: 21: Hoare triple {412#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {402#false} is VALID [2018-11-18 23:56:19,931 INFO L273 TraceCheckUtils]: 22: Hoare triple {402#false} assume !false; {402#false} is VALID [2018-11-18 23:56:19,937 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-18 23:56:19,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:56:19,938 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:56:19,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:56:19,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:56:20,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:56:20,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:56:20,275 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-18 23:56:20,675 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 28 treesize of output 23 [2018-11-18 23:56:20,770 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:56:20,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-11-18 23:56:20,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:56:20,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:56:20,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:56:20,898 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-11-18 23:56:20,904 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:56:21,122 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 26 treesize of output 18 [2018-11-18 23:56:21,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-18 23:56:21,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:56:21,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:56:21,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:56:21,157 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-18 23:56:21,159 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:56:21,198 INFO L256 TraceCheckUtils]: 0: Hoare triple {401#true} call ULTIMATE.init(); {401#true} is VALID [2018-11-18 23:56:21,199 INFO L273 TraceCheckUtils]: 1: Hoare triple {401#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {401#true} is VALID [2018-11-18 23:56:21,199 INFO L273 TraceCheckUtils]: 2: Hoare triple {401#true} assume true; {401#true} is VALID [2018-11-18 23:56:21,200 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {401#true} {401#true} #79#return; {401#true} is VALID [2018-11-18 23:56:21,200 INFO L256 TraceCheckUtils]: 4: Hoare triple {401#true} call #t~ret9 := main(); {401#true} is VALID [2018-11-18 23:56:21,201 INFO L273 TraceCheckUtils]: 5: Hoare triple {401#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 1; {431#(and (<= main_~j~0 1) (= |main_~#v~0.offset| 0))} is VALID [2018-11-18 23:56:21,202 INFO L273 TraceCheckUtils]: 6: Hoare triple {431#(and (<= main_~j~0 1) (= |main_~#v~0.offset| 0))} assume true; {431#(and (<= main_~j~0 1) (= |main_~#v~0.offset| 0))} is VALID [2018-11-18 23:56:21,203 INFO L273 TraceCheckUtils]: 7: Hoare triple {431#(and (<= main_~j~0 1) (= |main_~#v~0.offset| 0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem2 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~j~0 - 1; {438#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0))} is VALID [2018-11-18 23:56:21,204 INFO L273 TraceCheckUtils]: 8: Hoare triple {438#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0))} assume true; {438#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0))} is VALID [2018-11-18 23:56:21,205 INFO L273 TraceCheckUtils]: 9: Hoare triple {438#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0))} #t~short4 := ~i~0 >= 0; {445#(and (or (and (<= 0 main_~i~0) |main_#t~short4|) (and (not |main_#t~short4|) (< main_~i~0 0))) (= |main_~#v~0.offset| 0) (<= main_~i~0 0))} is VALID [2018-11-18 23:56:21,209 INFO L273 TraceCheckUtils]: 10: Hoare triple {445#(and (or (and (<= 0 main_~i~0) |main_#t~short4|) (and (not |main_#t~short4|) (< main_~i~0 0))) (= |main_~#v~0.offset| 0) (<= main_~i~0 0))} assume #t~short4;call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short4 := #t~mem3 > ~key~0; {449#(and (<= 0 main_~i~0) (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset|)) main_~key~0) |main_#t~short4|))} is VALID [2018-11-18 23:56:21,210 INFO L273 TraceCheckUtils]: 11: Hoare triple {449#(and (<= 0 main_~i~0) (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset|)) main_~key~0) |main_#t~short4|))} assume !#t~short4;havoc #t~mem3;havoc #t~short4; {453#(and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset|)) main_~key~0) (<= 0 main_~i~0) (= |main_~#v~0.offset| 0) (<= main_~i~0 0))} is VALID [2018-11-18 23:56:21,211 INFO L273 TraceCheckUtils]: 12: Hoare triple {453#(and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset|)) main_~key~0) (<= 0 main_~i~0) (= |main_~#v~0.offset| 0) (<= main_~i~0 0))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {408#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))))} is VALID [2018-11-18 23:56:21,216 INFO L273 TraceCheckUtils]: 13: Hoare triple {408#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {408#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))))} is VALID [2018-11-18 23:56:21,217 INFO L273 TraceCheckUtils]: 14: Hoare triple {408#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))))} assume true; {408#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))))} is VALID [2018-11-18 23:56:21,221 INFO L273 TraceCheckUtils]: 15: Hoare triple {408#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {408#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))))} is VALID [2018-11-18 23:56:21,222 INFO L273 TraceCheckUtils]: 16: Hoare triple {408#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))))} ~k~0 := 1; {409#(and (= main_~k~0 1) (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0)))))} is VALID [2018-11-18 23:56:21,223 INFO L273 TraceCheckUtils]: 17: Hoare triple {409#(and (= main_~k~0 1) (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0)))))} assume true; {409#(and (= main_~k~0 1) (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0)))))} is VALID [2018-11-18 23:56:21,225 INFO L273 TraceCheckUtils]: 18: Hoare triple {409#(and (= main_~k~0 1) (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0)))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem7 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {410#(<= |main_#t~mem7| |main_#t~mem8|)} is VALID [2018-11-18 23:56:21,226 INFO L256 TraceCheckUtils]: 19: Hoare triple {410#(<= |main_#t~mem7| |main_#t~mem8|)} call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); {411#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-18 23:56:21,234 INFO L273 TraceCheckUtils]: 20: Hoare triple {411#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {412#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-18 23:56:21,235 INFO L273 TraceCheckUtils]: 21: Hoare triple {412#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {402#false} is VALID [2018-11-18 23:56:21,235 INFO L273 TraceCheckUtils]: 22: Hoare triple {402#false} assume !false; {402#false} is VALID [2018-11-18 23:56:21,238 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-18 23:56:21,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:56:21,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-11-18 23:56:21,261 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2018-11-18 23:56:21,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:56:21,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-18 23:56:21,319 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:56:21,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 23:56:21,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 23:56:21,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-11-18 23:56:21,321 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 17 states. [2018-11-18 23:56:23,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:56:23,477 INFO L93 Difference]: Finished difference Result 101 states and 124 transitions. [2018-11-18 23:56:23,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 23:56:23,477 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2018-11-18 23:56:23,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:56:23,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 23:56:23,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 124 transitions. [2018-11-18 23:56:23,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 23:56:23,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 124 transitions. [2018-11-18 23:56:23,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 124 transitions. [2018-11-18 23:56:23,691 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:56:23,696 INFO L225 Difference]: With dead ends: 101 [2018-11-18 23:56:23,696 INFO L226 Difference]: Without dead ends: 79 [2018-11-18 23:56:23,697 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2018-11-18 23:56:23,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-18 23:56:23,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 52. [2018-11-18 23:56:23,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:56:23,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 52 states. [2018-11-18 23:56:23,838 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 52 states. [2018-11-18 23:56:23,839 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 52 states. [2018-11-18 23:56:23,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:56:23,845 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2018-11-18 23:56:23,846 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2018-11-18 23:56:23,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:56:23,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:56:23,847 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 79 states. [2018-11-18 23:56:23,847 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 79 states. [2018-11-18 23:56:23,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:56:23,853 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2018-11-18 23:56:23,853 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2018-11-18 23:56:23,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:56:23,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:56:23,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:56:23,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:56:23,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-18 23:56:23,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2018-11-18 23:56:23,858 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 23 [2018-11-18 23:56:23,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:56:23,859 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2018-11-18 23:56:23,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 23:56:23,859 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2018-11-18 23:56:23,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 23:56:23,860 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:56:23,860 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:56:23,861 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:56:23,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:56:23,861 INFO L82 PathProgramCache]: Analyzing trace with hash -249426572, now seen corresponding path program 1 times [2018-11-18 23:56:23,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:56:23,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:56:23,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:56:23,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:56:23,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:56:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:56:24,879 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 26 [2018-11-18 23:56:25,130 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 18 [2018-11-18 23:56:25,391 INFO L256 TraceCheckUtils]: 0: Hoare triple {862#true} call ULTIMATE.init(); {862#true} is VALID [2018-11-18 23:56:25,392 INFO L273 TraceCheckUtils]: 1: Hoare triple {862#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {862#true} is VALID [2018-11-18 23:56:25,392 INFO L273 TraceCheckUtils]: 2: Hoare triple {862#true} assume true; {862#true} is VALID [2018-11-18 23:56:25,392 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {862#true} {862#true} #79#return; {862#true} is VALID [2018-11-18 23:56:25,393 INFO L256 TraceCheckUtils]: 4: Hoare triple {862#true} call #t~ret9 := main(); {862#true} is VALID [2018-11-18 23:56:25,393 INFO L273 TraceCheckUtils]: 5: Hoare triple {862#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 1; {864#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0))} is VALID [2018-11-18 23:56:25,394 INFO L273 TraceCheckUtils]: 6: Hoare triple {864#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0))} assume true; {864#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0))} is VALID [2018-11-18 23:56:25,395 INFO L273 TraceCheckUtils]: 7: Hoare triple {864#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem2 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~j~0 - 1; {865#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~j~0)))))} is VALID [2018-11-18 23:56:25,395 INFO L273 TraceCheckUtils]: 8: Hoare triple {865#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~j~0)))))} assume true; {865#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~j~0)))))} is VALID [2018-11-18 23:56:25,396 INFO L273 TraceCheckUtils]: 9: Hoare triple {865#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~j~0)))))} #t~short4 := ~i~0 >= 0; {866#(and (<= main_~j~0 1) (or (<= 0 main_~i~0) (not |main_#t~short4|)) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~j~0)))))} is VALID [2018-11-18 23:56:25,398 INFO L273 TraceCheckUtils]: 10: Hoare triple {866#(and (<= main_~j~0 1) (or (<= 0 main_~i~0) (not |main_#t~short4|)) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~j~0)))))} assume #t~short4;call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short4 := #t~mem3 > ~key~0; {867#(and (<= 0 main_~i~0) (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~j~0)))) (or (not |main_#t~short4|) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0))))))} is VALID [2018-11-18 23:56:25,399 INFO L273 TraceCheckUtils]: 11: Hoare triple {867#(and (<= 0 main_~i~0) (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~j~0)))) (or (not |main_#t~short4|) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0))))))} assume !!#t~short4;havoc #t~mem3;havoc #t~short4; {868#(and (<= 0 main_~i~0) (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~j~0)))) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0)))))} is VALID [2018-11-18 23:56:25,401 INFO L273 TraceCheckUtils]: 12: Hoare triple {868#(and (<= 0 main_~i~0) (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~j~0)))) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0)))))} assume ~i~0 < 2;call #t~mem5 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem5; {869#(and (<= 0 main_~i~0) (<= main_~j~0 1) (or (not (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4))) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0) 4)))) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (or (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~j~0)))) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4))))} is VALID [2018-11-18 23:56:25,403 INFO L273 TraceCheckUtils]: 13: Hoare triple {869#(and (<= 0 main_~i~0) (<= main_~j~0 1) (or (not (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4))) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0) 4)))) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (or (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~j~0)))) (= (* 4 main_~j~0) (+ (* 4 main_~i~0) 4))))} ~i~0 := ~i~0 - 1; {870#(and (or (<= (+ main_~key~0 1) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0) 4) main_~key~0) (+ |main_~#v~0.offset| (* 4 main_~j~0)))) (= main_~key~0 (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0) 4) main_~key~0) (+ |main_~#v~0.offset| (* 4 main_~j~0))))) (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (or (= 0 (+ (* 4 main_~i~0) |main_~#v~0.offset| 4)) (< 0 (+ (* 4 main_~i~0) |main_~#v~0.offset| 4))))} is VALID [2018-11-18 23:56:25,404 INFO L273 TraceCheckUtils]: 14: Hoare triple {870#(and (or (<= (+ main_~key~0 1) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0) 4) main_~key~0) (+ |main_~#v~0.offset| (* 4 main_~j~0)))) (= main_~key~0 (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0) 4) main_~key~0) (+ |main_~#v~0.offset| (* 4 main_~j~0))))) (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (or (= 0 (+ (* 4 main_~i~0) |main_~#v~0.offset| 4)) (< 0 (+ (* 4 main_~i~0) |main_~#v~0.offset| 4))))} assume true; {870#(and (or (<= (+ main_~key~0 1) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0) 4) main_~key~0) (+ |main_~#v~0.offset| (* 4 main_~j~0)))) (= main_~key~0 (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0) 4) main_~key~0) (+ |main_~#v~0.offset| (* 4 main_~j~0))))) (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (or (= 0 (+ (* 4 main_~i~0) |main_~#v~0.offset| 4)) (< 0 (+ (* 4 main_~i~0) |main_~#v~0.offset| 4))))} is VALID [2018-11-18 23:56:25,406 INFO L273 TraceCheckUtils]: 15: Hoare triple {870#(and (or (<= (+ main_~key~0 1) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0) 4) main_~key~0) (+ |main_~#v~0.offset| (* 4 main_~j~0)))) (= main_~key~0 (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0) 4) main_~key~0) (+ |main_~#v~0.offset| (* 4 main_~j~0))))) (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (or (= 0 (+ (* 4 main_~i~0) |main_~#v~0.offset| 4)) (< 0 (+ (* 4 main_~i~0) |main_~#v~0.offset| 4))))} #t~short4 := ~i~0 >= 0; {871#(or (and (or (<= (+ main_~key~0 1) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0) 4) main_~key~0) (+ |main_~#v~0.offset| (* 4 main_~j~0)))) (= main_~key~0 (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0) 4) main_~key~0) (+ |main_~#v~0.offset| (* 4 main_~j~0))))) (= 0 (+ (* 4 main_~i~0) |main_~#v~0.offset| 4)) (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0)) |main_#t~short4|)} is VALID [2018-11-18 23:56:25,407 INFO L273 TraceCheckUtils]: 16: Hoare triple {871#(or (and (or (<= (+ main_~key~0 1) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0) 4) main_~key~0) (+ |main_~#v~0.offset| (* 4 main_~j~0)))) (= main_~key~0 (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0) 4) main_~key~0) (+ |main_~#v~0.offset| (* 4 main_~j~0))))) (= 0 (+ (* 4 main_~i~0) |main_~#v~0.offset| 4)) (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0)) |main_#t~short4|)} assume !#t~short4; {872#(and (or (<= (+ main_~key~0 1) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0) 4) main_~key~0) (+ |main_~#v~0.offset| (* 4 main_~j~0)))) (= main_~key~0 (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0) 4) main_~key~0) (+ |main_~#v~0.offset| (* 4 main_~j~0))))) (= 0 (+ (* 4 main_~i~0) |main_~#v~0.offset| 4)) (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0))} is VALID [2018-11-18 23:56:25,408 INFO L273 TraceCheckUtils]: 17: Hoare triple {872#(and (or (<= (+ main_~key~0 1) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0) 4) main_~key~0) (+ |main_~#v~0.offset| (* 4 main_~j~0)))) (= main_~key~0 (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0) 4) main_~key~0) (+ |main_~#v~0.offset| (* 4 main_~j~0))))) (= 0 (+ (* 4 main_~i~0) |main_~#v~0.offset| 4)) (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0))} assume !#t~short4;havoc #t~mem3;havoc #t~short4; {872#(and (or (<= (+ main_~key~0 1) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0) 4) main_~key~0) (+ |main_~#v~0.offset| (* 4 main_~j~0)))) (= main_~key~0 (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0) 4) main_~key~0) (+ |main_~#v~0.offset| (* 4 main_~j~0))))) (= 0 (+ (* 4 main_~i~0) |main_~#v~0.offset| 4)) (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0))} is VALID [2018-11-18 23:56:25,410 INFO L273 TraceCheckUtils]: 18: Hoare triple {872#(and (or (<= (+ main_~key~0 1) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0) 4) main_~key~0) (+ |main_~#v~0.offset| (* 4 main_~j~0)))) (= main_~key~0 (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~i~0) 4) main_~key~0) (+ |main_~#v~0.offset| (* 4 main_~j~0))))) (= 0 (+ (* 4 main_~i~0) |main_~#v~0.offset| 4)) (<= main_~j~0 1) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {873#(and (<= main_~j~0 1) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~j~0)))) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0))} is VALID [2018-11-18 23:56:25,411 INFO L273 TraceCheckUtils]: 19: Hoare triple {873#(and (<= main_~j~0 1) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~j~0)))) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {874#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))))} is VALID [2018-11-18 23:56:25,412 INFO L273 TraceCheckUtils]: 20: Hoare triple {874#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))))} assume true; {874#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))))} is VALID [2018-11-18 23:56:25,413 INFO L273 TraceCheckUtils]: 21: Hoare triple {874#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {874#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))))} is VALID [2018-11-18 23:56:25,414 INFO L273 TraceCheckUtils]: 22: Hoare triple {874#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 1)))))} ~k~0 := 1; {875#(and (= main_~k~0 1) (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0)))))} is VALID [2018-11-18 23:56:25,415 INFO L273 TraceCheckUtils]: 23: Hoare triple {875#(and (= main_~k~0 1) (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0)))))} assume true; {875#(and (= main_~k~0 1) (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0)))))} is VALID [2018-11-18 23:56:25,416 INFO L273 TraceCheckUtils]: 24: Hoare triple {875#(and (= main_~k~0 1) (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0)))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem7 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {876#(<= |main_#t~mem7| |main_#t~mem8|)} is VALID [2018-11-18 23:56:25,418 INFO L256 TraceCheckUtils]: 25: Hoare triple {876#(<= |main_#t~mem7| |main_#t~mem8|)} call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); {877#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-18 23:56:25,418 INFO L273 TraceCheckUtils]: 26: Hoare triple {877#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {878#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-18 23:56:25,420 INFO L273 TraceCheckUtils]: 27: Hoare triple {878#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {863#false} is VALID [2018-11-18 23:56:25,420 INFO L273 TraceCheckUtils]: 28: Hoare triple {863#false} assume !false; {863#false} is VALID [2018-11-18 23:56:25,427 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:56:25,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:56:25,428 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:56:25,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:56:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:56:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:56:25,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:56:25,751 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 38 treesize of output 31 [2018-11-18 23:56:25,757 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:56:25,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 47 [2018-11-18 23:56:25,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:56:25,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:56:25,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:56:25,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-11-18 23:56:26,140 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:56:26,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-11-18 23:56:26,152 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:56:26,153 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:56:26,154 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 23:56:26,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 72 [2018-11-18 23:56:26,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:56:26,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:56:26,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:56:26,195 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2018-11-18 23:56:26,202 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:56:26,464 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 39 treesize of output 31 [2018-11-18 23:56:26,471 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:56:26,472 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 23:56:26,474 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:56:26,475 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 23:56:26,479 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:56:26,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 49 [2018-11-18 23:56:26,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:56:26,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:56:26,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:56:26,509 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-11-18 23:56:26,512 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:56:26,618 INFO L256 TraceCheckUtils]: 0: Hoare triple {862#true} call ULTIMATE.init(); {862#true} is VALID [2018-11-18 23:56:26,618 INFO L273 TraceCheckUtils]: 1: Hoare triple {862#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {862#true} is VALID [2018-11-18 23:56:26,619 INFO L273 TraceCheckUtils]: 2: Hoare triple {862#true} assume true; {862#true} is VALID [2018-11-18 23:56:26,619 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {862#true} {862#true} #79#return; {862#true} is VALID [2018-11-18 23:56:26,619 INFO L256 TraceCheckUtils]: 4: Hoare triple {862#true} call #t~ret9 := main(); {862#true} is VALID [2018-11-18 23:56:26,624 INFO L273 TraceCheckUtils]: 5: Hoare triple {862#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 1; {897#(<= main_~j~0 1)} is VALID [2018-11-18 23:56:26,625 INFO L273 TraceCheckUtils]: 6: Hoare triple {897#(<= main_~j~0 1)} assume true; {897#(<= main_~j~0 1)} is VALID [2018-11-18 23:56:26,626 INFO L273 TraceCheckUtils]: 7: Hoare triple {897#(<= main_~j~0 1)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem2 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~j~0 - 1; {904#(<= main_~i~0 0)} is VALID [2018-11-18 23:56:26,626 INFO L273 TraceCheckUtils]: 8: Hoare triple {904#(<= main_~i~0 0)} assume true; {904#(<= main_~i~0 0)} is VALID [2018-11-18 23:56:26,627 INFO L273 TraceCheckUtils]: 9: Hoare triple {904#(<= main_~i~0 0)} #t~short4 := ~i~0 >= 0; {911#(and (or (and (<= 0 main_~i~0) |main_#t~short4|) (and (not |main_#t~short4|) (< main_~i~0 0))) (<= main_~i~0 0))} is VALID [2018-11-18 23:56:26,628 INFO L273 TraceCheckUtils]: 10: Hoare triple {911#(and (or (and (<= 0 main_~i~0) |main_#t~short4|) (and (not |main_#t~short4|) (< main_~i~0 0))) (<= main_~i~0 0))} assume #t~short4;call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short4 := #t~mem3 > ~key~0; {915#(and (<= 0 main_~i~0) (or (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset|))) (not |main_#t~short4|)) (<= main_~i~0 0))} is VALID [2018-11-18 23:56:26,629 INFO L273 TraceCheckUtils]: 11: Hoare triple {915#(and (<= 0 main_~i~0) (or (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset|))) (not |main_#t~short4|)) (<= main_~i~0 0))} assume !!#t~short4;havoc #t~mem3;havoc #t~short4; {919#(and (<= 0 main_~i~0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset|))) (<= main_~i~0 0))} is VALID [2018-11-18 23:56:26,630 INFO L273 TraceCheckUtils]: 12: Hoare triple {919#(and (<= 0 main_~i~0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset|))) (<= main_~i~0 0))} assume ~i~0 < 2;call #t~mem5 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem5; {923#(and (<= 0 main_~i~0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset|))) (= (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset|))) (<= main_~i~0 0))} is VALID [2018-11-18 23:56:26,632 INFO L273 TraceCheckUtils]: 13: Hoare triple {923#(and (<= 0 main_~i~0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset|))) (= (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset| 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ (* 4 main_~i~0) |main_~#v~0.offset|))) (<= main_~i~0 0))} ~i~0 := ~i~0 - 1; {927#(exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10)))) (<= v_main_~i~0_10 0) (<= v_main_~i~0_10 (+ main_~i~0 1)) (= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10))))))} is VALID [2018-11-18 23:56:26,632 INFO L273 TraceCheckUtils]: 14: Hoare triple {927#(exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10)))) (<= v_main_~i~0_10 0) (<= v_main_~i~0_10 (+ main_~i~0 1)) (= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10))))))} assume true; {927#(exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10)))) (<= v_main_~i~0_10 0) (<= v_main_~i~0_10 (+ main_~i~0 1)) (= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10))))))} is VALID [2018-11-18 23:56:26,634 INFO L273 TraceCheckUtils]: 15: Hoare triple {927#(exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10)))) (<= v_main_~i~0_10 0) (<= v_main_~i~0_10 (+ main_~i~0 1)) (= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10))))))} #t~short4 := ~i~0 >= 0; {934#(or (and (<= 0 main_~i~0) (exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10)))) (<= v_main_~i~0_10 0) (<= v_main_~i~0_10 (+ main_~i~0 1)) (= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10)))))) |main_#t~short4|) (and (exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10)))) (<= v_main_~i~0_10 0) (<= v_main_~i~0_10 (+ main_~i~0 1)) (= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10)))))) (not |main_#t~short4|) (< main_~i~0 0)))} is VALID [2018-11-18 23:56:26,635 INFO L273 TraceCheckUtils]: 16: Hoare triple {934#(or (and (<= 0 main_~i~0) (exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10)))) (<= v_main_~i~0_10 0) (<= v_main_~i~0_10 (+ main_~i~0 1)) (= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10)))))) |main_#t~short4|) (and (exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10)))) (<= v_main_~i~0_10 0) (<= v_main_~i~0_10 (+ main_~i~0 1)) (= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10)))))) (not |main_#t~short4|) (< main_~i~0 0)))} assume !#t~short4; {938#(and (exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10)))) (<= v_main_~i~0_10 0) (<= v_main_~i~0_10 (+ main_~i~0 1)) (= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10)))))) (< main_~i~0 0))} is VALID [2018-11-18 23:56:26,651 INFO L273 TraceCheckUtils]: 17: Hoare triple {938#(and (exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10)))) (<= v_main_~i~0_10 0) (<= v_main_~i~0_10 (+ main_~i~0 1)) (= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10)))))) (< main_~i~0 0))} assume !#t~short4;havoc #t~mem3;havoc #t~short4; {938#(and (exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10)))) (<= v_main_~i~0_10 0) (<= v_main_~i~0_10 (+ main_~i~0 1)) (= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10)))))) (< main_~i~0 0))} is VALID [2018-11-18 23:56:26,653 INFO L273 TraceCheckUtils]: 18: Hoare triple {938#(and (exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10)))) (<= v_main_~i~0_10 0) (<= v_main_~i~0_10 (+ main_~i~0 1)) (= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10)))))) (< main_~i~0 0))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {945#(exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= v_main_~i~0_10 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4)))))} is VALID [2018-11-18 23:56:26,654 INFO L273 TraceCheckUtils]: 19: Hoare triple {945#(exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= v_main_~i~0_10 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4)))))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {945#(exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= v_main_~i~0_10 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4)))))} is VALID [2018-11-18 23:56:26,654 INFO L273 TraceCheckUtils]: 20: Hoare triple {945#(exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= v_main_~i~0_10 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4)))))} assume true; {945#(exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= v_main_~i~0_10 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4)))))} is VALID [2018-11-18 23:56:26,655 INFO L273 TraceCheckUtils]: 21: Hoare triple {945#(exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= v_main_~i~0_10 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4)))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {945#(exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= v_main_~i~0_10 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4)))))} is VALID [2018-11-18 23:56:26,660 INFO L273 TraceCheckUtils]: 22: Hoare triple {945#(exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= v_main_~i~0_10 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4)))))} ~k~0 := 1; {958#(and (= main_~k~0 1) (exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= v_main_~i~0_10 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4))))))} is VALID [2018-11-18 23:56:26,661 INFO L273 TraceCheckUtils]: 23: Hoare triple {958#(and (= main_~k~0 1) (exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= v_main_~i~0_10 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4))))))} assume true; {958#(and (= main_~k~0 1) (exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= v_main_~i~0_10 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4))))))} is VALID [2018-11-18 23:56:26,664 INFO L273 TraceCheckUtils]: 24: Hoare triple {958#(and (= main_~k~0 1) (exists ((v_main_~i~0_10 Int)) (and (<= 0 v_main_~i~0_10) (<= v_main_~i~0_10 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 v_main_~i~0_10) 4))))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem7 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {965#(<= (+ |main_#t~mem7| 1) |main_#t~mem8|)} is VALID [2018-11-18 23:56:26,665 INFO L256 TraceCheckUtils]: 25: Hoare triple {965#(<= (+ |main_#t~mem7| 1) |main_#t~mem8|)} call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); {877#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-18 23:56:26,666 INFO L273 TraceCheckUtils]: 26: Hoare triple {877#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {878#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-18 23:56:26,666 INFO L273 TraceCheckUtils]: 27: Hoare triple {878#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {863#false} is VALID [2018-11-18 23:56:26,666 INFO L273 TraceCheckUtils]: 28: Hoare triple {863#false} assume !false; {863#false} is VALID [2018-11-18 23:56:26,670 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:56:26,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:56:26,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 29 [2018-11-18 23:56:26,690 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-11-18 23:56:26,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:56:26,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-18 23:56:26,789 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:56:26,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-18 23:56:26,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-18 23:56:26,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=713, Unknown=0, NotChecked=0, Total=812 [2018-11-18 23:56:26,790 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand 29 states. [2018-11-18 23:56:29,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:56:29,848 INFO L93 Difference]: Finished difference Result 124 states and 147 transitions. [2018-11-18 23:56:29,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 23:56:29,848 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-11-18 23:56:29,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:56:29,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 23:56:29,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 117 transitions. [2018-11-18 23:56:29,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 23:56:29,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 117 transitions. [2018-11-18 23:56:29,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 117 transitions. [2018-11-18 23:56:30,014 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:56:30,019 INFO L225 Difference]: With dead ends: 124 [2018-11-18 23:56:30,019 INFO L226 Difference]: Without dead ends: 83 [2018-11-18 23:56:30,021 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=231, Invalid=1491, Unknown=0, NotChecked=0, Total=1722 [2018-11-18 23:56:30,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-18 23:56:30,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 52. [2018-11-18 23:56:30,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:56:30,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 52 states. [2018-11-18 23:56:30,109 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 52 states. [2018-11-18 23:56:30,109 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 52 states. [2018-11-18 23:56:30,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:56:30,115 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2018-11-18 23:56:30,115 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2018-11-18 23:56:30,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:56:30,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:56:30,116 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 83 states. [2018-11-18 23:56:30,117 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 83 states. [2018-11-18 23:56:30,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:56:30,121 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2018-11-18 23:56:30,121 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2018-11-18 23:56:30,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:56:30,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:56:30,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:56:30,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:56:30,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-18 23:56:30,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2018-11-18 23:56:30,125 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 29 [2018-11-18 23:56:30,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:56:30,126 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2018-11-18 23:56:30,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-18 23:56:30,126 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-11-18 23:56:30,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 23:56:30,127 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:56:30,127 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:56:30,127 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:56:30,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:56:30,128 INFO L82 PathProgramCache]: Analyzing trace with hash -853417747, now seen corresponding path program 1 times [2018-11-18 23:56:30,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:56:30,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:56:30,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:56:30,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:56:30,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:56:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:56:30,423 INFO L256 TraceCheckUtils]: 0: Hoare triple {1396#true} call ULTIMATE.init(); {1396#true} is VALID [2018-11-18 23:56:30,423 INFO L273 TraceCheckUtils]: 1: Hoare triple {1396#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1396#true} is VALID [2018-11-18 23:56:30,424 INFO L273 TraceCheckUtils]: 2: Hoare triple {1396#true} assume true; {1396#true} is VALID [2018-11-18 23:56:30,424 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1396#true} {1396#true} #79#return; {1396#true} is VALID [2018-11-18 23:56:30,424 INFO L256 TraceCheckUtils]: 4: Hoare triple {1396#true} call #t~ret9 := main(); {1396#true} is VALID [2018-11-18 23:56:30,425 INFO L273 TraceCheckUtils]: 5: Hoare triple {1396#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 1; {1398#(and (<= main_~j~0 1) (<= 1 main_~j~0))} is VALID [2018-11-18 23:56:30,426 INFO L273 TraceCheckUtils]: 6: Hoare triple {1398#(and (<= main_~j~0 1) (<= 1 main_~j~0))} assume true; {1398#(and (<= main_~j~0 1) (<= 1 main_~j~0))} is VALID [2018-11-18 23:56:30,427 INFO L273 TraceCheckUtils]: 7: Hoare triple {1398#(and (<= main_~j~0 1) (<= 1 main_~j~0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem2 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~j~0 - 1; {1398#(and (<= main_~j~0 1) (<= 1 main_~j~0))} is VALID [2018-11-18 23:56:30,428 INFO L273 TraceCheckUtils]: 8: Hoare triple {1398#(and (<= main_~j~0 1) (<= 1 main_~j~0))} assume true; {1398#(and (<= main_~j~0 1) (<= 1 main_~j~0))} is VALID [2018-11-18 23:56:30,429 INFO L273 TraceCheckUtils]: 9: Hoare triple {1398#(and (<= main_~j~0 1) (<= 1 main_~j~0))} #t~short4 := ~i~0 >= 0; {1398#(and (<= main_~j~0 1) (<= 1 main_~j~0))} is VALID [2018-11-18 23:56:30,430 INFO L273 TraceCheckUtils]: 10: Hoare triple {1398#(and (<= main_~j~0 1) (<= 1 main_~j~0))} assume #t~short4;call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short4 := #t~mem3 > ~key~0; {1398#(and (<= main_~j~0 1) (<= 1 main_~j~0))} is VALID [2018-11-18 23:56:30,431 INFO L273 TraceCheckUtils]: 11: Hoare triple {1398#(and (<= main_~j~0 1) (<= 1 main_~j~0))} assume !#t~short4;havoc #t~mem3;havoc #t~short4; {1398#(and (<= main_~j~0 1) (<= 1 main_~j~0))} is VALID [2018-11-18 23:56:30,432 INFO L273 TraceCheckUtils]: 12: Hoare triple {1398#(and (<= main_~j~0 1) (<= 1 main_~j~0))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {1398#(and (<= main_~j~0 1) (<= 1 main_~j~0))} is VALID [2018-11-18 23:56:30,433 INFO L273 TraceCheckUtils]: 13: Hoare triple {1398#(and (<= main_~j~0 1) (<= 1 main_~j~0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1399#(and (<= main_~j~0 2) (< 0 (+ (div main_~j~0 4294967296) 1)))} is VALID [2018-11-18 23:56:30,434 INFO L273 TraceCheckUtils]: 14: Hoare triple {1399#(and (<= main_~j~0 2) (< 0 (+ (div main_~j~0 4294967296) 1)))} assume true; {1399#(and (<= main_~j~0 2) (< 0 (+ (div main_~j~0 4294967296) 1)))} is VALID [2018-11-18 23:56:30,436 INFO L273 TraceCheckUtils]: 15: Hoare triple {1399#(and (<= main_~j~0 2) (< 0 (+ (div main_~j~0 4294967296) 1)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1400#(<= main_~SIZE~0 (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 2))} is VALID [2018-11-18 23:56:30,437 INFO L273 TraceCheckUtils]: 16: Hoare triple {1400#(<= main_~SIZE~0 (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 2))} ~k~0 := 1; {1401#(and (<= main_~SIZE~0 (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 2)) (= main_~k~0 1))} is VALID [2018-11-18 23:56:30,438 INFO L273 TraceCheckUtils]: 17: Hoare triple {1401#(and (<= main_~SIZE~0 (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 2)) (= main_~k~0 1))} assume true; {1401#(and (<= main_~SIZE~0 (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 2)) (= main_~k~0 1))} is VALID [2018-11-18 23:56:30,439 INFO L273 TraceCheckUtils]: 18: Hoare triple {1401#(and (<= main_~SIZE~0 (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 2)) (= main_~k~0 1))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem7 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {1401#(and (<= main_~SIZE~0 (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 2)) (= main_~k~0 1))} is VALID [2018-11-18 23:56:30,439 INFO L256 TraceCheckUtils]: 19: Hoare triple {1401#(and (<= main_~SIZE~0 (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 2)) (= main_~k~0 1))} call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); {1396#true} is VALID [2018-11-18 23:56:30,440 INFO L273 TraceCheckUtils]: 20: Hoare triple {1396#true} ~cond := #in~cond; {1396#true} is VALID [2018-11-18 23:56:30,440 INFO L273 TraceCheckUtils]: 21: Hoare triple {1396#true} assume !(0 == ~cond); {1396#true} is VALID [2018-11-18 23:56:30,440 INFO L273 TraceCheckUtils]: 22: Hoare triple {1396#true} assume true; {1396#true} is VALID [2018-11-18 23:56:30,442 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1396#true} {1401#(and (<= main_~SIZE~0 (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 2)) (= main_~k~0 1))} #83#return; {1401#(and (<= main_~SIZE~0 (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 2)) (= main_~k~0 1))} is VALID [2018-11-18 23:56:30,442 INFO L273 TraceCheckUtils]: 24: Hoare triple {1401#(and (<= main_~SIZE~0 (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 2)) (= main_~k~0 1))} havoc #t~mem7;havoc #t~mem8; {1401#(and (<= main_~SIZE~0 (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 2)) (= main_~k~0 1))} is VALID [2018-11-18 23:56:30,443 INFO L273 TraceCheckUtils]: 25: Hoare triple {1401#(and (<= main_~SIZE~0 (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 2)) (= main_~k~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1402#(and (<= main_~SIZE~0 (+ main_~k~0 (* 4294967296 (div main_~SIZE~0 4294967296)))) (<= (div main_~k~0 4294967296) 0))} is VALID [2018-11-18 23:56:30,444 INFO L273 TraceCheckUtils]: 26: Hoare triple {1402#(and (<= main_~SIZE~0 (+ main_~k~0 (* 4294967296 (div main_~SIZE~0 4294967296)))) (<= (div main_~k~0 4294967296) 0))} assume true; {1402#(and (<= main_~SIZE~0 (+ main_~k~0 (* 4294967296 (div main_~SIZE~0 4294967296)))) (<= (div main_~k~0 4294967296) 0))} is VALID [2018-11-18 23:56:30,445 INFO L273 TraceCheckUtils]: 27: Hoare triple {1402#(and (<= main_~SIZE~0 (+ main_~k~0 (* 4294967296 (div main_~SIZE~0 4294967296)))) (<= (div main_~k~0 4294967296) 0))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem7 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {1397#false} is VALID [2018-11-18 23:56:30,446 INFO L256 TraceCheckUtils]: 28: Hoare triple {1397#false} call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); {1397#false} is VALID [2018-11-18 23:56:30,446 INFO L273 TraceCheckUtils]: 29: Hoare triple {1397#false} ~cond := #in~cond; {1397#false} is VALID [2018-11-18 23:56:30,446 INFO L273 TraceCheckUtils]: 30: Hoare triple {1397#false} assume 0 == ~cond; {1397#false} is VALID [2018-11-18 23:56:30,447 INFO L273 TraceCheckUtils]: 31: Hoare triple {1397#false} assume !false; {1397#false} is VALID [2018-11-18 23:56:30,450 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:56:30,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:56:30,451 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:56:30,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:56:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:56:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:56:30,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:56:30,647 INFO L256 TraceCheckUtils]: 0: Hoare triple {1396#true} call ULTIMATE.init(); {1396#true} is VALID [2018-11-18 23:56:30,647 INFO L273 TraceCheckUtils]: 1: Hoare triple {1396#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1396#true} is VALID [2018-11-18 23:56:30,647 INFO L273 TraceCheckUtils]: 2: Hoare triple {1396#true} assume true; {1396#true} is VALID [2018-11-18 23:56:30,648 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1396#true} {1396#true} #79#return; {1396#true} is VALID [2018-11-18 23:56:30,648 INFO L256 TraceCheckUtils]: 4: Hoare triple {1396#true} call #t~ret9 := main(); {1396#true} is VALID [2018-11-18 23:56:30,649 INFO L273 TraceCheckUtils]: 5: Hoare triple {1396#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 1; {1398#(and (<= main_~j~0 1) (<= 1 main_~j~0))} is VALID [2018-11-18 23:56:30,649 INFO L273 TraceCheckUtils]: 6: Hoare triple {1398#(and (<= main_~j~0 1) (<= 1 main_~j~0))} assume true; {1398#(and (<= main_~j~0 1) (<= 1 main_~j~0))} is VALID [2018-11-18 23:56:30,650 INFO L273 TraceCheckUtils]: 7: Hoare triple {1398#(and (<= main_~j~0 1) (<= 1 main_~j~0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem2 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~j~0 - 1; {1398#(and (<= main_~j~0 1) (<= 1 main_~j~0))} is VALID [2018-11-18 23:56:30,657 INFO L273 TraceCheckUtils]: 8: Hoare triple {1398#(and (<= main_~j~0 1) (<= 1 main_~j~0))} assume true; {1398#(and (<= main_~j~0 1) (<= 1 main_~j~0))} is VALID [2018-11-18 23:56:30,658 INFO L273 TraceCheckUtils]: 9: Hoare triple {1398#(and (<= main_~j~0 1) (<= 1 main_~j~0))} #t~short4 := ~i~0 >= 0; {1398#(and (<= main_~j~0 1) (<= 1 main_~j~0))} is VALID [2018-11-18 23:56:30,659 INFO L273 TraceCheckUtils]: 10: Hoare triple {1398#(and (<= main_~j~0 1) (<= 1 main_~j~0))} assume #t~short4;call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short4 := #t~mem3 > ~key~0; {1398#(and (<= main_~j~0 1) (<= 1 main_~j~0))} is VALID [2018-11-18 23:56:30,660 INFO L273 TraceCheckUtils]: 11: Hoare triple {1398#(and (<= main_~j~0 1) (<= 1 main_~j~0))} assume !#t~short4;havoc #t~mem3;havoc #t~short4; {1398#(and (<= main_~j~0 1) (<= 1 main_~j~0))} is VALID [2018-11-18 23:56:30,660 INFO L273 TraceCheckUtils]: 12: Hoare triple {1398#(and (<= main_~j~0 1) (<= 1 main_~j~0))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {1398#(and (<= main_~j~0 1) (<= 1 main_~j~0))} is VALID [2018-11-18 23:56:30,661 INFO L273 TraceCheckUtils]: 13: Hoare triple {1398#(and (<= main_~j~0 1) (<= 1 main_~j~0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1445#(and (<= 2 main_~j~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:56:30,662 INFO L273 TraceCheckUtils]: 14: Hoare triple {1445#(and (<= 2 main_~j~0) (<= main_~j~0 2))} assume true; {1445#(and (<= 2 main_~j~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:56:30,663 INFO L273 TraceCheckUtils]: 15: Hoare triple {1445#(and (<= 2 main_~j~0) (<= main_~j~0 2))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1400#(<= main_~SIZE~0 (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 2))} is VALID [2018-11-18 23:56:30,664 INFO L273 TraceCheckUtils]: 16: Hoare triple {1400#(<= main_~SIZE~0 (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 2))} ~k~0 := 1; {1401#(and (<= main_~SIZE~0 (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 2)) (= main_~k~0 1))} is VALID [2018-11-18 23:56:30,667 INFO L273 TraceCheckUtils]: 17: Hoare triple {1401#(and (<= main_~SIZE~0 (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 2)) (= main_~k~0 1))} assume true; {1401#(and (<= main_~SIZE~0 (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 2)) (= main_~k~0 1))} is VALID [2018-11-18 23:56:30,667 INFO L273 TraceCheckUtils]: 18: Hoare triple {1401#(and (<= main_~SIZE~0 (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 2)) (= main_~k~0 1))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem7 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {1401#(and (<= main_~SIZE~0 (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 2)) (= main_~k~0 1))} is VALID [2018-11-18 23:56:30,668 INFO L256 TraceCheckUtils]: 19: Hoare triple {1401#(and (<= main_~SIZE~0 (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 2)) (= main_~k~0 1))} call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); {1396#true} is VALID [2018-11-18 23:56:30,668 INFO L273 TraceCheckUtils]: 20: Hoare triple {1396#true} ~cond := #in~cond; {1396#true} is VALID [2018-11-18 23:56:30,668 INFO L273 TraceCheckUtils]: 21: Hoare triple {1396#true} assume !(0 == ~cond); {1396#true} is VALID [2018-11-18 23:56:30,668 INFO L273 TraceCheckUtils]: 22: Hoare triple {1396#true} assume true; {1396#true} is VALID [2018-11-18 23:56:30,669 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1396#true} {1401#(and (<= main_~SIZE~0 (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 2)) (= main_~k~0 1))} #83#return; {1401#(and (<= main_~SIZE~0 (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 2)) (= main_~k~0 1))} is VALID [2018-11-18 23:56:30,670 INFO L273 TraceCheckUtils]: 24: Hoare triple {1401#(and (<= main_~SIZE~0 (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 2)) (= main_~k~0 1))} havoc #t~mem7;havoc #t~mem8; {1401#(and (<= main_~SIZE~0 (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 2)) (= main_~k~0 1))} is VALID [2018-11-18 23:56:30,670 INFO L273 TraceCheckUtils]: 25: Hoare triple {1401#(and (<= main_~SIZE~0 (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 2)) (= main_~k~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1482#(and (<= main_~SIZE~0 (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 2)) (= main_~k~0 2))} is VALID [2018-11-18 23:56:30,671 INFO L273 TraceCheckUtils]: 26: Hoare triple {1482#(and (<= main_~SIZE~0 (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 2)) (= main_~k~0 2))} assume true; {1482#(and (<= main_~SIZE~0 (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 2)) (= main_~k~0 2))} is VALID [2018-11-18 23:56:30,673 INFO L273 TraceCheckUtils]: 27: Hoare triple {1482#(and (<= main_~SIZE~0 (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 2)) (= main_~k~0 2))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem7 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {1397#false} is VALID [2018-11-18 23:56:30,673 INFO L256 TraceCheckUtils]: 28: Hoare triple {1397#false} call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); {1397#false} is VALID [2018-11-18 23:56:30,673 INFO L273 TraceCheckUtils]: 29: Hoare triple {1397#false} ~cond := #in~cond; {1397#false} is VALID [2018-11-18 23:56:30,674 INFO L273 TraceCheckUtils]: 30: Hoare triple {1397#false} assume 0 == ~cond; {1397#false} is VALID [2018-11-18 23:56:30,674 INFO L273 TraceCheckUtils]: 31: Hoare triple {1397#false} assume !false; {1397#false} is VALID [2018-11-18 23:56:30,676 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:56:30,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:56:30,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-11-18 23:56:30,696 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-11-18 23:56:30,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:56:30,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 23:56:30,777 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-18 23:56:30,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 23:56:30,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 23:56:30,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-18 23:56:30,779 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 9 states. [2018-11-18 23:56:31,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:56:31,282 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2018-11-18 23:56:31,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 23:56:31,282 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-11-18 23:56:31,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:56:31,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 23:56:31,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2018-11-18 23:56:31,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 23:56:31,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2018-11-18 23:56:31,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 78 transitions. [2018-11-18 23:56:31,404 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:56:31,406 INFO L225 Difference]: With dead ends: 75 [2018-11-18 23:56:31,407 INFO L226 Difference]: Without dead ends: 52 [2018-11-18 23:56:31,408 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-18 23:56:31,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-18 23:56:31,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2018-11-18 23:56:31,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:56:31,574 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 44 states. [2018-11-18 23:56:31,574 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 44 states. [2018-11-18 23:56:31,574 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 44 states. [2018-11-18 23:56:31,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:56:31,577 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-18 23:56:31,577 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2018-11-18 23:56:31,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:56:31,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:56:31,578 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 52 states. [2018-11-18 23:56:31,578 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 52 states. [2018-11-18 23:56:31,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:56:31,580 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-18 23:56:31,581 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2018-11-18 23:56:31,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:56:31,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:56:31,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:56:31,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:56:31,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-18 23:56:31,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-11-18 23:56:31,583 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 32 [2018-11-18 23:56:31,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:56:31,583 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-11-18 23:56:31,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 23:56:31,584 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-18 23:56:31,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 23:56:31,584 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:56:31,584 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:56:31,585 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:56:31,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:56:31,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1757852431, now seen corresponding path program 2 times [2018-11-18 23:56:31,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:56:31,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:56:31,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:56:31,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:56:31,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:56:31,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:56:32,638 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: zero is neutral element of plus operator at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:87) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:154) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-18 23:56:32,643 INFO L168 Benchmark]: Toolchain (without parser) took 17345.71 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -1.0 GB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2018-11-18 23:56:32,644 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-18 23:56:32,645 INFO L168 Benchmark]: CACSL2BoogieTranslator took 349.71 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-18 23:56:32,646 INFO L168 Benchmark]: Boogie Preprocessor took 55.61 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-18 23:56:32,646 INFO L168 Benchmark]: RCFGBuilder took 759.21 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -769.1 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2018-11-18 23:56:32,647 INFO L168 Benchmark]: TraceAbstraction took 16175.64 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 295.7 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -259.3 MB). Peak memory consumption was 36.4 MB. Max. memory is 7.1 GB. [2018-11-18 23:56:32,651 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 349.71 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 55.61 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 759.21 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -769.1 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16175.64 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 295.7 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -259.3 MB). Peak memory consumption was 36.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: zero is neutral element of plus operator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: zero is neutral element of plus operator: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:87) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...