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-Const.epf -i ../../../trunk/examples/svcomp/array-tiling/nr2_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:51:55,356 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:51:55,362 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:51:55,377 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:51:55,377 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:51:55,378 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:51:55,379 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:51:55,381 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:51:55,383 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:51:55,384 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:51:55,385 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:51:55,385 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:51:55,386 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:51:55,387 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:51:55,388 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:51:55,389 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:51:55,390 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:51:55,392 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:51:55,394 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:51:55,396 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:51:55,397 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:51:55,398 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:51:55,400 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:51:55,401 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:51:55,401 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:51:55,402 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:51:55,403 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:51:55,404 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:51:55,404 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:51:55,406 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:51:55,406 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:51:55,407 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:51:55,407 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:51:55,407 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:51:55,408 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:51:55,409 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:51:55,409 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 18:51:55,425 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:51:55,426 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:51:55,427 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:51:55,427 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:51:55,427 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:51:55,428 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:51:55,428 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:51:55,428 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:51:55,428 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:51:55,428 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 18:51:55,429 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:51:55,429 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:51:55,429 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:51:55,429 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:51:55,429 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:51:55,430 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:51:55,430 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:51:55,430 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:51:55,430 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:51:55,430 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:51:55,431 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:51:55,431 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:51:55,431 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:51:55,431 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:51:55,431 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:51:55,432 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:51:55,432 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:51:55,432 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 18:51:55,432 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:51:55,432 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 18:51:55,433 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:51:55,493 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:51:55,508 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:51:55,512 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:51:55,514 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:51:55,514 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:51:55,515 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/nr2_true-unreach-call.i [2018-11-14 18:51:55,581 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62096ca4c/c22ca69a9ab443f69260ccbbc5fdc377/FLAG0bfc5dd68 [2018-11-14 18:51:56,043 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:51:56,044 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/nr2_true-unreach-call.i [2018-11-14 18:51:56,050 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62096ca4c/c22ca69a9ab443f69260ccbbc5fdc377/FLAG0bfc5dd68 [2018-11-14 18:51:56,064 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62096ca4c/c22ca69a9ab443f69260ccbbc5fdc377 [2018-11-14 18:51:56,073 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:51:56,075 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:51:56,076 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:51:56,076 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:51:56,080 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:51:56,082 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:51:56" (1/1) ... [2018-11-14 18:51:56,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39baef06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:51:56, skipping insertion in model container [2018-11-14 18:51:56,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:51:56" (1/1) ... [2018-11-14 18:51:56,095 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:51:56,124 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:51:56,374 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:51:56,381 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:51:56,416 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:51:56,439 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:51:56,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:51:56 WrapperNode [2018-11-14 18:51:56,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:51:56,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:51:56,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:51:56,442 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:51:56,456 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:51:56" (1/1) ... [2018-11-14 18:51:56,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:51:56" (1/1) ... [2018-11-14 18:51:56,466 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:51:56" (1/1) ... [2018-11-14 18:51:56,466 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:51:56" (1/1) ... [2018-11-14 18:51:56,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:51:56" (1/1) ... [2018-11-14 18:51:56,485 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:51:56" (1/1) ... [2018-11-14 18:51:56,487 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:51:56" (1/1) ... [2018-11-14 18:51:56,490 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:51:56,490 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:51:56,490 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:51:56,490 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:51:56,491 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:51:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:51:56,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:51:56,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:51:56,624 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 18:51:56,624 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:51:56,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:51:56,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 18:51:56,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 18:51:56,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:51:56,625 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:51:56,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:51:56,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:51:56,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 18:51:56,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 18:51:56,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:51:56,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:51:56,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 18:51:57,274 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:51:57,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:51:57 BoogieIcfgContainer [2018-11-14 18:51:57,275 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:51:57,276 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:51:57,276 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:51:57,279 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:51:57,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:51:56" (1/3) ... [2018-11-14 18:51:57,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d781870 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:51:57, skipping insertion in model container [2018-11-14 18:51:57,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:51:56" (2/3) ... [2018-11-14 18:51:57,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d781870 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:51:57, skipping insertion in model container [2018-11-14 18:51:57,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:51:57" (3/3) ... [2018-11-14 18:51:57,283 INFO L112 eAbstractionObserver]: Analyzing ICFG nr2_true-unreach-call.i [2018-11-14 18:51:57,293 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:51:57,304 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:51:57,321 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:51:57,361 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:51:57,361 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:51:57,361 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:51:57,362 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:51:57,362 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:51:57,362 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:51:57,362 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:51:57,362 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:51:57,362 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:51:57,381 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-14 18:51:57,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 18:51:57,388 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:51:57,389 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:51:57,392 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:51:57,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:51:57,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1065126958, now seen corresponding path program 1 times [2018-11-14 18:51:57,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:51:57,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:51:57,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:51:57,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:51:57,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:51:57,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:51:57,598 INFO L256 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2018-11-14 18:51:57,602 INFO L273 TraceCheckUtils]: 1: Hoare triple {37#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {37#true} is VALID [2018-11-14 18:51:57,602 INFO L273 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 18:51:57,603 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #86#return; {37#true} is VALID [2018-11-14 18:51:57,603 INFO L256 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret8 := main(); {37#true} is VALID [2018-11-14 18:51:57,603 INFO L273 TraceCheckUtils]: 5: Hoare triple {37#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {37#true} is VALID [2018-11-14 18:51:57,604 INFO L273 TraceCheckUtils]: 6: Hoare triple {37#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4); {37#true} is VALID [2018-11-14 18:51:57,604 INFO L273 TraceCheckUtils]: 7: Hoare triple {37#true} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) == 0 then 1 else 0) != 0;~i~0 := 1; {37#true} is VALID [2018-11-14 18:51:57,605 INFO L273 TraceCheckUtils]: 8: Hoare triple {37#true} assume !true; {38#false} is VALID [2018-11-14 18:51:57,606 INFO L273 TraceCheckUtils]: 9: Hoare triple {38#false} ~i~0 := 0; {38#false} is VALID [2018-11-14 18:51:57,606 INFO L273 TraceCheckUtils]: 10: Hoare triple {38#false} assume true; {38#false} is VALID [2018-11-14 18:51:57,606 INFO L273 TraceCheckUtils]: 11: Hoare triple {38#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {38#false} is VALID [2018-11-14 18:51:57,606 INFO L273 TraceCheckUtils]: 12: Hoare triple {38#false} assume #t~short7; {38#false} is VALID [2018-11-14 18:51:57,607 INFO L256 TraceCheckUtils]: 13: Hoare triple {38#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {38#false} is VALID [2018-11-14 18:51:57,607 INFO L273 TraceCheckUtils]: 14: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2018-11-14 18:51:57,607 INFO L273 TraceCheckUtils]: 15: Hoare triple {38#false} assume ~cond == 0; {38#false} is VALID [2018-11-14 18:51:57,607 INFO L273 TraceCheckUtils]: 16: Hoare triple {38#false} assume !false; {38#false} is VALID [2018-11-14 18:51:57,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:51:57,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:51:57,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:51:57,620 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-14 18:51:57,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:51:57,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:51:57,831 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:51:57,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:51:57,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:51:57,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:51:57,846 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-14 18:51:58,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:58,021 INFO L93 Difference]: Finished difference Result 60 states and 79 transitions. [2018-11-14 18:51:58,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:51:58,022 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-14 18:51:58,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:51:58,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:51:58,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 79 transitions. [2018-11-14 18:51:58,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:51:58,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 79 transitions. [2018-11-14 18:51:58,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 79 transitions. [2018-11-14 18:51:58,307 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:51:58,318 INFO L225 Difference]: With dead ends: 60 [2018-11-14 18:51:58,318 INFO L226 Difference]: Without dead ends: 28 [2018-11-14 18:51:58,322 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-14 18:51:58,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-14 18:51:58,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-14 18:51:58,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:51:58,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-14 18:51:58,473 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 18:51:58,473 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 18:51:58,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:58,478 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-14 18:51:58,478 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-14 18:51:58,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:51:58,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:51:58,480 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 18:51:58,480 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 18:51:58,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:58,485 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-14 18:51:58,485 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-14 18:51:58,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:51:58,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:51:58,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:51:58,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:51:58,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 18:51:58,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-14 18:51:58,491 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 17 [2018-11-14 18:51:58,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:51:58,492 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-14 18:51:58,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:51:58,492 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-14 18:51:58,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 18:51:58,493 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:51:58,494 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:51:58,494 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:51:58,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:51:58,495 INFO L82 PathProgramCache]: Analyzing trace with hash -832945488, now seen corresponding path program 1 times [2018-11-14 18:51:58,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:51:58,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:51:58,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:51:58,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:51:58,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:51:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:51:58,780 INFO L256 TraceCheckUtils]: 0: Hoare triple {208#true} call ULTIMATE.init(); {208#true} is VALID [2018-11-14 18:51:58,781 INFO L273 TraceCheckUtils]: 1: Hoare triple {208#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {208#true} is VALID [2018-11-14 18:51:58,781 INFO L273 TraceCheckUtils]: 2: Hoare triple {208#true} assume true; {208#true} is VALID [2018-11-14 18:51:58,781 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {208#true} {208#true} #86#return; {208#true} is VALID [2018-11-14 18:51:58,782 INFO L256 TraceCheckUtils]: 4: Hoare triple {208#true} call #t~ret8 := main(); {208#true} is VALID [2018-11-14 18:51:58,782 INFO L273 TraceCheckUtils]: 5: Hoare triple {208#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {208#true} is VALID [2018-11-14 18:51:58,782 INFO L273 TraceCheckUtils]: 6: Hoare triple {208#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4); {208#true} is VALID [2018-11-14 18:51:58,783 INFO L273 TraceCheckUtils]: 7: Hoare triple {208#true} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) == 0 then 1 else 0) != 0;~i~0 := 1; {208#true} is VALID [2018-11-14 18:51:58,783 INFO L273 TraceCheckUtils]: 8: Hoare triple {208#true} assume true; {208#true} is VALID [2018-11-14 18:51:58,783 INFO L273 TraceCheckUtils]: 9: Hoare triple {208#true} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 / 2 + 1 else ~CELLCOUNT~0 / 2)); {208#true} is VALID [2018-11-14 18:51:58,784 INFO L273 TraceCheckUtils]: 10: Hoare triple {208#true} ~i~0 := 0; {208#true} is VALID [2018-11-14 18:51:58,784 INFO L273 TraceCheckUtils]: 11: Hoare triple {208#true} assume true; {208#true} is VALID [2018-11-14 18:51:58,785 INFO L273 TraceCheckUtils]: 12: Hoare triple {208#true} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {208#true} is VALID [2018-11-14 18:51:58,801 INFO L273 TraceCheckUtils]: 13: Hoare triple {208#true} assume #t~short7; {210#|main_#t~short7|} is VALID [2018-11-14 18:51:58,816 INFO L256 TraceCheckUtils]: 14: Hoare triple {210#|main_#t~short7|} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {211#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 18:51:58,826 INFO L273 TraceCheckUtils]: 15: Hoare triple {211#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {212#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-14 18:51:58,828 INFO L273 TraceCheckUtils]: 16: Hoare triple {212#(not (= __VERIFIER_assert_~cond 0))} assume ~cond == 0; {209#false} is VALID [2018-11-14 18:51:58,828 INFO L273 TraceCheckUtils]: 17: Hoare triple {209#false} assume !false; {209#false} is VALID [2018-11-14 18:51:58,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:51:58,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:51:58,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 18:51:58,832 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-14 18:51:58,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:51:58,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:51:58,880 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:51:58,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:51:58,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:51:58,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:51:58,882 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2018-11-14 18:51:59,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:59,611 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-14 18:51:59,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:51:59,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-14 18:51:59,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:51:59,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:51:59,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2018-11-14 18:51:59,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:51:59,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2018-11-14 18:51:59,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2018-11-14 18:51:59,683 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:51:59,686 INFO L225 Difference]: With dead ends: 36 [2018-11-14 18:51:59,686 INFO L226 Difference]: Without dead ends: 34 [2018-11-14 18:51:59,687 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:51:59,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-14 18:51:59,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-14 18:51:59,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:51:59,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-14 18:51:59,710 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-14 18:51:59,710 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-14 18:51:59,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:59,714 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-14 18:51:59,714 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-14 18:51:59,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:51:59,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:51:59,715 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-14 18:51:59,715 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-14 18:51:59,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:59,718 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-14 18:51:59,718 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-14 18:51:59,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:51:59,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:51:59,719 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:51:59,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:51:59,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 18:51:59,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-14 18:51:59,722 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 18 [2018-11-14 18:51:59,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:51:59,723 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-14 18:51:59,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:51:59,723 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-14 18:51:59,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 18:51:59,724 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:51:59,724 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:51:59,725 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:51:59,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:51:59,725 INFO L82 PathProgramCache]: Analyzing trace with hash -831098446, now seen corresponding path program 1 times [2018-11-14 18:51:59,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:51:59,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:51:59,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:51:59,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:51:59,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:51:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:51:59,924 INFO L256 TraceCheckUtils]: 0: Hoare triple {376#true} call ULTIMATE.init(); {376#true} is VALID [2018-11-14 18:51:59,925 INFO L273 TraceCheckUtils]: 1: Hoare triple {376#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {376#true} is VALID [2018-11-14 18:51:59,925 INFO L273 TraceCheckUtils]: 2: Hoare triple {376#true} assume true; {376#true} is VALID [2018-11-14 18:51:59,926 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {376#true} {376#true} #86#return; {376#true} is VALID [2018-11-14 18:51:59,926 INFO L256 TraceCheckUtils]: 4: Hoare triple {376#true} call #t~ret8 := main(); {376#true} is VALID [2018-11-14 18:51:59,926 INFO L273 TraceCheckUtils]: 5: Hoare triple {376#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {376#true} is VALID [2018-11-14 18:51:59,928 INFO L273 TraceCheckUtils]: 6: Hoare triple {376#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4); {378#(<= 2 ~CELLCOUNT~0)} is VALID [2018-11-14 18:51:59,929 INFO L273 TraceCheckUtils]: 7: Hoare triple {378#(<= 2 ~CELLCOUNT~0)} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) == 0 then 1 else 0) != 0;~i~0 := 1; {379#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} is VALID [2018-11-14 18:51:59,929 INFO L273 TraceCheckUtils]: 8: Hoare triple {379#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} assume true; {379#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} is VALID [2018-11-14 18:51:59,931 INFO L273 TraceCheckUtils]: 9: Hoare triple {379#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 / 2 + 1 else ~CELLCOUNT~0 / 2)); {377#false} is VALID [2018-11-14 18:51:59,931 INFO L273 TraceCheckUtils]: 10: Hoare triple {377#false} ~i~0 := 0; {377#false} is VALID [2018-11-14 18:51:59,932 INFO L273 TraceCheckUtils]: 11: Hoare triple {377#false} assume true; {377#false} is VALID [2018-11-14 18:51:59,932 INFO L273 TraceCheckUtils]: 12: Hoare triple {377#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {377#false} is VALID [2018-11-14 18:51:59,932 INFO L273 TraceCheckUtils]: 13: Hoare triple {377#false} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short7 := #t~mem6 == 0; {377#false} is VALID [2018-11-14 18:51:59,933 INFO L256 TraceCheckUtils]: 14: Hoare triple {377#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {377#false} is VALID [2018-11-14 18:51:59,934 INFO L273 TraceCheckUtils]: 15: Hoare triple {377#false} ~cond := #in~cond; {377#false} is VALID [2018-11-14 18:51:59,934 INFO L273 TraceCheckUtils]: 16: Hoare triple {377#false} assume ~cond == 0; {377#false} is VALID [2018-11-14 18:51:59,935 INFO L273 TraceCheckUtils]: 17: Hoare triple {377#false} assume !false; {377#false} is VALID [2018-11-14 18:51:59,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:51:59,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:51:59,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 18:51:59,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-14 18:51:59,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:51:59,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:51:59,996 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:51:59,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:51:59,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:51:59,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:51:59,998 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2018-11-14 18:52:00,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:00,252 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2018-11-14 18:52:00,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:52:00,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-14 18:52:00,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:52:00,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:52:00,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-14 18:52:00,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:52:00,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-14 18:52:00,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2018-11-14 18:52:00,362 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:52:00,364 INFO L225 Difference]: With dead ends: 58 [2018-11-14 18:52:00,365 INFO L226 Difference]: Without dead ends: 40 [2018-11-14 18:52:00,365 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:52:00,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-14 18:52:00,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2018-11-14 18:52:00,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:52:00,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 35 states. [2018-11-14 18:52:00,402 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 35 states. [2018-11-14 18:52:00,402 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 35 states. [2018-11-14 18:52:00,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:00,406 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-11-14 18:52:00,406 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-14 18:52:00,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:52:00,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:52:00,408 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 40 states. [2018-11-14 18:52:00,408 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 40 states. [2018-11-14 18:52:00,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:00,411 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-11-14 18:52:00,411 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-14 18:52:00,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:52:00,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:52:00,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:52:00,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:52:00,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 18:52:00,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-14 18:52:00,415 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 18 [2018-11-14 18:52:00,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:52:00,415 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-14 18:52:00,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:52:00,416 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-14 18:52:00,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 18:52:00,417 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:52:00,417 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-14 18:52:00,417 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:52:00,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:52:00,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1996039917, now seen corresponding path program 1 times [2018-11-14 18:52:00,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:52:00,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:52:00,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:52:00,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:52:00,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:52:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:52:00,522 INFO L256 TraceCheckUtils]: 0: Hoare triple {585#true} call ULTIMATE.init(); {585#true} is VALID [2018-11-14 18:52:00,522 INFO L273 TraceCheckUtils]: 1: Hoare triple {585#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {585#true} is VALID [2018-11-14 18:52:00,522 INFO L273 TraceCheckUtils]: 2: Hoare triple {585#true} assume true; {585#true} is VALID [2018-11-14 18:52:00,523 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {585#true} {585#true} #86#return; {585#true} is VALID [2018-11-14 18:52:00,523 INFO L256 TraceCheckUtils]: 4: Hoare triple {585#true} call #t~ret8 := main(); {585#true} is VALID [2018-11-14 18:52:00,523 INFO L273 TraceCheckUtils]: 5: Hoare triple {585#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {585#true} is VALID [2018-11-14 18:52:00,524 INFO L273 TraceCheckUtils]: 6: Hoare triple {585#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4); {585#true} is VALID [2018-11-14 18:52:00,524 INFO L273 TraceCheckUtils]: 7: Hoare triple {585#true} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) == 0 then 1 else 0) != 0;~i~0 := 1; {585#true} is VALID [2018-11-14 18:52:00,524 INFO L273 TraceCheckUtils]: 8: Hoare triple {585#true} assume true; {585#true} is VALID [2018-11-14 18:52:00,536 INFO L273 TraceCheckUtils]: 9: Hoare triple {585#true} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 / 2 + 1 else ~CELLCOUNT~0 / 2));~j~0 := 2; {587#(<= 2 main_~j~0)} is VALID [2018-11-14 18:52:00,538 INFO L273 TraceCheckUtils]: 10: Hoare triple {587#(<= 2 main_~j~0)} assume true; {587#(<= 2 main_~j~0)} is VALID [2018-11-14 18:52:00,541 INFO L273 TraceCheckUtils]: 11: Hoare triple {587#(<= 2 main_~j~0)} assume !(~j~0 >= 1); {586#false} is VALID [2018-11-14 18:52:00,541 INFO L273 TraceCheckUtils]: 12: Hoare triple {586#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {586#false} is VALID [2018-11-14 18:52:00,541 INFO L273 TraceCheckUtils]: 13: Hoare triple {586#false} assume true; {586#false} is VALID [2018-11-14 18:52:00,542 INFO L273 TraceCheckUtils]: 14: Hoare triple {586#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 / 2 + 1 else ~CELLCOUNT~0 / 2)); {586#false} is VALID [2018-11-14 18:52:00,542 INFO L273 TraceCheckUtils]: 15: Hoare triple {586#false} ~i~0 := 0; {586#false} is VALID [2018-11-14 18:52:00,542 INFO L273 TraceCheckUtils]: 16: Hoare triple {586#false} assume true; {586#false} is VALID [2018-11-14 18:52:00,542 INFO L273 TraceCheckUtils]: 17: Hoare triple {586#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {586#false} is VALID [2018-11-14 18:52:00,543 INFO L273 TraceCheckUtils]: 18: Hoare triple {586#false} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short7 := #t~mem6 == 0; {586#false} is VALID [2018-11-14 18:52:00,543 INFO L256 TraceCheckUtils]: 19: Hoare triple {586#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {586#false} is VALID [2018-11-14 18:52:00,543 INFO L273 TraceCheckUtils]: 20: Hoare triple {586#false} ~cond := #in~cond; {586#false} is VALID [2018-11-14 18:52:00,543 INFO L273 TraceCheckUtils]: 21: Hoare triple {586#false} assume ~cond == 0; {586#false} is VALID [2018-11-14 18:52:00,544 INFO L273 TraceCheckUtils]: 22: Hoare triple {586#false} assume !false; {586#false} is VALID [2018-11-14 18:52:00,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:52:00,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:52:00,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:52:00,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-14 18:52:00,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:52:00,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:52:00,633 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:52:00,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:52:00,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:52:00,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:52:00,635 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 3 states. [2018-11-14 18:52:00,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:00,780 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2018-11-14 18:52:00,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:52:00,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-14 18:52:00,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:52:00,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:52:00,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2018-11-14 18:52:00,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:52:00,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2018-11-14 18:52:00,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 62 transitions. [2018-11-14 18:52:00,872 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:52:00,875 INFO L225 Difference]: With dead ends: 64 [2018-11-14 18:52:00,875 INFO L226 Difference]: Without dead ends: 39 [2018-11-14 18:52:00,876 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:52:00,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-14 18:52:00,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-14 18:52:00,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:52:00,912 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2018-11-14 18:52:00,912 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2018-11-14 18:52:00,913 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2018-11-14 18:52:00,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:00,916 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-11-14 18:52:00,916 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-14 18:52:00,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:52:00,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:52:00,917 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2018-11-14 18:52:00,917 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2018-11-14 18:52:00,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:00,920 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-11-14 18:52:00,920 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-14 18:52:00,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:52:00,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:52:00,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:52:00,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:52:00,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 18:52:00,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-14 18:52:00,924 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 23 [2018-11-14 18:52:00,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:52:00,924 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-14 18:52:00,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:52:00,925 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-14 18:52:00,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 18:52:00,926 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:52:00,926 INFO L375 BasicCegarLoop]: trace histogram [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-14 18:52:00,926 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:52:00,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:52:00,927 INFO L82 PathProgramCache]: Analyzing trace with hash -995813500, now seen corresponding path program 1 times [2018-11-14 18:52:00,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:52:00,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:52:00,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:52:00,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:52:00,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:52:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:52:01,036 INFO L256 TraceCheckUtils]: 0: Hoare triple {802#true} call ULTIMATE.init(); {802#true} is VALID [2018-11-14 18:52:01,036 INFO L273 TraceCheckUtils]: 1: Hoare triple {802#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {802#true} is VALID [2018-11-14 18:52:01,036 INFO L273 TraceCheckUtils]: 2: Hoare triple {802#true} assume true; {802#true} is VALID [2018-11-14 18:52:01,036 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {802#true} {802#true} #86#return; {802#true} is VALID [2018-11-14 18:52:01,037 INFO L256 TraceCheckUtils]: 4: Hoare triple {802#true} call #t~ret8 := main(); {802#true} is VALID [2018-11-14 18:52:01,037 INFO L273 TraceCheckUtils]: 5: Hoare triple {802#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {802#true} is VALID [2018-11-14 18:52:01,037 INFO L273 TraceCheckUtils]: 6: Hoare triple {802#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4); {802#true} is VALID [2018-11-14 18:52:01,037 INFO L273 TraceCheckUtils]: 7: Hoare triple {802#true} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) == 0 then 1 else 0) != 0;~i~0 := 1; {802#true} is VALID [2018-11-14 18:52:01,038 INFO L273 TraceCheckUtils]: 8: Hoare triple {802#true} assume true; {802#true} is VALID [2018-11-14 18:52:01,038 INFO L273 TraceCheckUtils]: 9: Hoare triple {802#true} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 / 2 + 1 else ~CELLCOUNT~0 / 2));~j~0 := 2; {804#(<= 2 main_~j~0)} is VALID [2018-11-14 18:52:01,040 INFO L273 TraceCheckUtils]: 10: Hoare triple {804#(<= 2 main_~j~0)} assume true; {804#(<= 2 main_~j~0)} is VALID [2018-11-14 18:52:01,041 INFO L273 TraceCheckUtils]: 11: Hoare triple {804#(<= 2 main_~j~0)} assume !!(~j~0 >= 1); {804#(<= 2 main_~j~0)} is VALID [2018-11-14 18:52:01,041 INFO L273 TraceCheckUtils]: 12: Hoare triple {804#(<= 2 main_~j~0)} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 2 - ~j~0) * 4, 4); {804#(<= 2 main_~j~0)} is VALID [2018-11-14 18:52:01,042 INFO L273 TraceCheckUtils]: 13: Hoare triple {804#(<= 2 main_~j~0)} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {805#(<= 1 main_~j~0)} is VALID [2018-11-14 18:52:01,047 INFO L273 TraceCheckUtils]: 14: Hoare triple {805#(<= 1 main_~j~0)} assume true; {805#(<= 1 main_~j~0)} is VALID [2018-11-14 18:52:01,047 INFO L273 TraceCheckUtils]: 15: Hoare triple {805#(<= 1 main_~j~0)} assume !(~j~0 >= 1); {803#false} is VALID [2018-11-14 18:52:01,048 INFO L273 TraceCheckUtils]: 16: Hoare triple {803#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {803#false} is VALID [2018-11-14 18:52:01,048 INFO L273 TraceCheckUtils]: 17: Hoare triple {803#false} assume true; {803#false} is VALID [2018-11-14 18:52:01,048 INFO L273 TraceCheckUtils]: 18: Hoare triple {803#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 / 2 + 1 else ~CELLCOUNT~0 / 2)); {803#false} is VALID [2018-11-14 18:52:01,049 INFO L273 TraceCheckUtils]: 19: Hoare triple {803#false} ~i~0 := 0; {803#false} is VALID [2018-11-14 18:52:01,049 INFO L273 TraceCheckUtils]: 20: Hoare triple {803#false} assume true; {803#false} is VALID [2018-11-14 18:52:01,049 INFO L273 TraceCheckUtils]: 21: Hoare triple {803#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {803#false} is VALID [2018-11-14 18:52:01,050 INFO L273 TraceCheckUtils]: 22: Hoare triple {803#false} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short7 := #t~mem6 == 0; {803#false} is VALID [2018-11-14 18:52:01,050 INFO L256 TraceCheckUtils]: 23: Hoare triple {803#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {803#false} is VALID [2018-11-14 18:52:01,050 INFO L273 TraceCheckUtils]: 24: Hoare triple {803#false} ~cond := #in~cond; {803#false} is VALID [2018-11-14 18:52:01,051 INFO L273 TraceCheckUtils]: 25: Hoare triple {803#false} assume ~cond == 0; {803#false} is VALID [2018-11-14 18:52:01,051 INFO L273 TraceCheckUtils]: 26: Hoare triple {803#false} assume !false; {803#false} is VALID [2018-11-14 18:52:01,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:52:01,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:52:01,053 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-14 18:52:01,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:52:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:52:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:52:01,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:52:01,245 INFO L256 TraceCheckUtils]: 0: Hoare triple {802#true} call ULTIMATE.init(); {802#true} is VALID [2018-11-14 18:52:01,245 INFO L273 TraceCheckUtils]: 1: Hoare triple {802#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {802#true} is VALID [2018-11-14 18:52:01,246 INFO L273 TraceCheckUtils]: 2: Hoare triple {802#true} assume true; {802#true} is VALID [2018-11-14 18:52:01,246 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {802#true} {802#true} #86#return; {802#true} is VALID [2018-11-14 18:52:01,246 INFO L256 TraceCheckUtils]: 4: Hoare triple {802#true} call #t~ret8 := main(); {802#true} is VALID [2018-11-14 18:52:01,247 INFO L273 TraceCheckUtils]: 5: Hoare triple {802#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {802#true} is VALID [2018-11-14 18:52:01,247 INFO L273 TraceCheckUtils]: 6: Hoare triple {802#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4); {802#true} is VALID [2018-11-14 18:52:01,247 INFO L273 TraceCheckUtils]: 7: Hoare triple {802#true} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) == 0 then 1 else 0) != 0;~i~0 := 1; {802#true} is VALID [2018-11-14 18:52:01,247 INFO L273 TraceCheckUtils]: 8: Hoare triple {802#true} assume true; {802#true} is VALID [2018-11-14 18:52:01,253 INFO L273 TraceCheckUtils]: 9: Hoare triple {802#true} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 / 2 + 1 else ~CELLCOUNT~0 / 2));~j~0 := 2; {804#(<= 2 main_~j~0)} is VALID [2018-11-14 18:52:01,254 INFO L273 TraceCheckUtils]: 10: Hoare triple {804#(<= 2 main_~j~0)} assume true; {804#(<= 2 main_~j~0)} is VALID [2018-11-14 18:52:01,254 INFO L273 TraceCheckUtils]: 11: Hoare triple {804#(<= 2 main_~j~0)} assume !!(~j~0 >= 1); {804#(<= 2 main_~j~0)} is VALID [2018-11-14 18:52:01,256 INFO L273 TraceCheckUtils]: 12: Hoare triple {804#(<= 2 main_~j~0)} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 2 - ~j~0) * 4, 4); {804#(<= 2 main_~j~0)} is VALID [2018-11-14 18:52:01,258 INFO L273 TraceCheckUtils]: 13: Hoare triple {804#(<= 2 main_~j~0)} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {805#(<= 1 main_~j~0)} is VALID [2018-11-14 18:52:01,258 INFO L273 TraceCheckUtils]: 14: Hoare triple {805#(<= 1 main_~j~0)} assume true; {805#(<= 1 main_~j~0)} is VALID [2018-11-14 18:52:01,260 INFO L273 TraceCheckUtils]: 15: Hoare triple {805#(<= 1 main_~j~0)} assume !(~j~0 >= 1); {803#false} is VALID [2018-11-14 18:52:01,260 INFO L273 TraceCheckUtils]: 16: Hoare triple {803#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {803#false} is VALID [2018-11-14 18:52:01,260 INFO L273 TraceCheckUtils]: 17: Hoare triple {803#false} assume true; {803#false} is VALID [2018-11-14 18:52:01,260 INFO L273 TraceCheckUtils]: 18: Hoare triple {803#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 / 2 + 1 else ~CELLCOUNT~0 / 2)); {803#false} is VALID [2018-11-14 18:52:01,261 INFO L273 TraceCheckUtils]: 19: Hoare triple {803#false} ~i~0 := 0; {803#false} is VALID [2018-11-14 18:52:01,261 INFO L273 TraceCheckUtils]: 20: Hoare triple {803#false} assume true; {803#false} is VALID [2018-11-14 18:52:01,261 INFO L273 TraceCheckUtils]: 21: Hoare triple {803#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {803#false} is VALID [2018-11-14 18:52:01,262 INFO L273 TraceCheckUtils]: 22: Hoare triple {803#false} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short7 := #t~mem6 == 0; {803#false} is VALID [2018-11-14 18:52:01,262 INFO L256 TraceCheckUtils]: 23: Hoare triple {803#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {803#false} is VALID [2018-11-14 18:52:01,262 INFO L273 TraceCheckUtils]: 24: Hoare triple {803#false} ~cond := #in~cond; {803#false} is VALID [2018-11-14 18:52:01,263 INFO L273 TraceCheckUtils]: 25: Hoare triple {803#false} assume ~cond == 0; {803#false} is VALID [2018-11-14 18:52:01,263 INFO L273 TraceCheckUtils]: 26: Hoare triple {803#false} assume !false; {803#false} is VALID [2018-11-14 18:52:01,265 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:52:01,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:52:01,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-14 18:52:01,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-14 18:52:01,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:52:01,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:52:01,351 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:52:01,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:52:01,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:52:01,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:52:01,352 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 4 states. [2018-11-14 18:52:01,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:01,614 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2018-11-14 18:52:01,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:52:01,614 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-14 18:52:01,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:52:01,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:52:01,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2018-11-14 18:52:01,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:52:01,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2018-11-14 18:52:01,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 64 transitions. [2018-11-14 18:52:01,734 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:52:01,736 INFO L225 Difference]: With dead ends: 68 [2018-11-14 18:52:01,736 INFO L226 Difference]: Without dead ends: 41 [2018-11-14 18:52:01,737 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:52:01,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-14 18:52:01,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-14 18:52:01,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:52:01,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 41 states. [2018-11-14 18:52:01,825 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-14 18:52:01,825 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-14 18:52:01,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:01,827 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-14 18:52:01,827 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-14 18:52:01,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:52:01,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:52:01,828 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-14 18:52:01,828 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-14 18:52:01,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:01,831 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-14 18:52:01,831 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-14 18:52:01,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:52:01,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:52:01,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:52:01,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:52:01,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-14 18:52:01,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-11-14 18:52:01,835 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 27 [2018-11-14 18:52:01,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:52:01,835 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-11-14 18:52:01,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:52:01,835 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-14 18:52:01,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 18:52:01,836 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:52:01,837 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:52:01,837 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:52:01,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:52:01,837 INFO L82 PathProgramCache]: Analyzing trace with hash -2094472037, now seen corresponding path program 2 times [2018-11-14 18:52:01,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:52:01,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:52:01,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:52:01,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:52:01,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:52:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:52:01,981 INFO L256 TraceCheckUtils]: 0: Hoare triple {1113#true} call ULTIMATE.init(); {1113#true} is VALID [2018-11-14 18:52:01,982 INFO L273 TraceCheckUtils]: 1: Hoare triple {1113#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {1113#true} is VALID [2018-11-14 18:52:01,982 INFO L273 TraceCheckUtils]: 2: Hoare triple {1113#true} assume true; {1113#true} is VALID [2018-11-14 18:52:01,982 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1113#true} {1113#true} #86#return; {1113#true} is VALID [2018-11-14 18:52:01,982 INFO L256 TraceCheckUtils]: 4: Hoare triple {1113#true} call #t~ret8 := main(); {1113#true} is VALID [2018-11-14 18:52:01,983 INFO L273 TraceCheckUtils]: 5: Hoare triple {1113#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {1113#true} is VALID [2018-11-14 18:52:01,985 INFO L273 TraceCheckUtils]: 6: Hoare triple {1113#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4); {1115#(<= 2 main_~MINVAL~0)} is VALID [2018-11-14 18:52:02,003 INFO L273 TraceCheckUtils]: 7: Hoare triple {1115#(<= 2 main_~MINVAL~0)} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) == 0 then 1 else 0) != 0;~i~0 := 1; {1115#(<= 2 main_~MINVAL~0)} is VALID [2018-11-14 18:52:02,012 INFO L273 TraceCheckUtils]: 8: Hoare triple {1115#(<= 2 main_~MINVAL~0)} assume true; {1115#(<= 2 main_~MINVAL~0)} is VALID [2018-11-14 18:52:02,025 INFO L273 TraceCheckUtils]: 9: Hoare triple {1115#(<= 2 main_~MINVAL~0)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 / 2 + 1 else ~CELLCOUNT~0 / 2));~j~0 := 2; {1116#(<= main_~j~0 main_~MINVAL~0)} is VALID [2018-11-14 18:52:02,038 INFO L273 TraceCheckUtils]: 10: Hoare triple {1116#(<= main_~j~0 main_~MINVAL~0)} assume true; {1116#(<= main_~j~0 main_~MINVAL~0)} is VALID [2018-11-14 18:52:02,047 INFO L273 TraceCheckUtils]: 11: Hoare triple {1116#(<= main_~j~0 main_~MINVAL~0)} assume !!(~j~0 >= 1); {1116#(<= main_~j~0 main_~MINVAL~0)} is VALID [2018-11-14 18:52:02,047 INFO L273 TraceCheckUtils]: 12: Hoare triple {1116#(<= main_~j~0 main_~MINVAL~0)} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 2 - ~j~0) * 4, 4); {1116#(<= main_~j~0 main_~MINVAL~0)} is VALID [2018-11-14 18:52:02,049 INFO L273 TraceCheckUtils]: 13: Hoare triple {1116#(<= main_~j~0 main_~MINVAL~0)} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1117#(<= (+ main_~j~0 1) main_~MINVAL~0)} is VALID [2018-11-14 18:52:02,049 INFO L273 TraceCheckUtils]: 14: Hoare triple {1117#(<= (+ main_~j~0 1) main_~MINVAL~0)} assume true; {1117#(<= (+ main_~j~0 1) main_~MINVAL~0)} is VALID [2018-11-14 18:52:02,052 INFO L273 TraceCheckUtils]: 15: Hoare triple {1117#(<= (+ main_~j~0 1) main_~MINVAL~0)} assume !!(~j~0 >= 1); {1117#(<= (+ main_~j~0 1) main_~MINVAL~0)} is VALID [2018-11-14 18:52:02,055 INFO L273 TraceCheckUtils]: 16: Hoare triple {1117#(<= (+ main_~j~0 1) main_~MINVAL~0)} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 2 - ~j~0) * 4, 4); {1114#false} is VALID [2018-11-14 18:52:02,055 INFO L273 TraceCheckUtils]: 17: Hoare triple {1114#false} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1114#false} is VALID [2018-11-14 18:52:02,055 INFO L273 TraceCheckUtils]: 18: Hoare triple {1114#false} assume true; {1114#false} is VALID [2018-11-14 18:52:02,055 INFO L273 TraceCheckUtils]: 19: Hoare triple {1114#false} assume !(~j~0 >= 1); {1114#false} is VALID [2018-11-14 18:52:02,056 INFO L273 TraceCheckUtils]: 20: Hoare triple {1114#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1114#false} is VALID [2018-11-14 18:52:02,056 INFO L273 TraceCheckUtils]: 21: Hoare triple {1114#false} assume true; {1114#false} is VALID [2018-11-14 18:52:02,056 INFO L273 TraceCheckUtils]: 22: Hoare triple {1114#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 / 2 + 1 else ~CELLCOUNT~0 / 2)); {1114#false} is VALID [2018-11-14 18:52:02,056 INFO L273 TraceCheckUtils]: 23: Hoare triple {1114#false} ~i~0 := 0; {1114#false} is VALID [2018-11-14 18:52:02,057 INFO L273 TraceCheckUtils]: 24: Hoare triple {1114#false} assume true; {1114#false} is VALID [2018-11-14 18:52:02,057 INFO L273 TraceCheckUtils]: 25: Hoare triple {1114#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {1114#false} is VALID [2018-11-14 18:52:02,057 INFO L273 TraceCheckUtils]: 26: Hoare triple {1114#false} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short7 := #t~mem6 == 0; {1114#false} is VALID [2018-11-14 18:52:02,058 INFO L256 TraceCheckUtils]: 27: Hoare triple {1114#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {1114#false} is VALID [2018-11-14 18:52:02,058 INFO L273 TraceCheckUtils]: 28: Hoare triple {1114#false} ~cond := #in~cond; {1114#false} is VALID [2018-11-14 18:52:02,058 INFO L273 TraceCheckUtils]: 29: Hoare triple {1114#false} assume ~cond == 0; {1114#false} is VALID [2018-11-14 18:52:02,058 INFO L273 TraceCheckUtils]: 30: Hoare triple {1114#false} assume !false; {1114#false} is VALID [2018-11-14 18:52:02,060 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:52:02,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:52:02,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 18:52:02,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-14 18:52:02,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:52:02,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:52:02,107 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:52:02,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:52:02,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:52:02,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:52:02,108 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 5 states. [2018-11-14 18:52:02,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:02,360 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2018-11-14 18:52:02,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:52:02,360 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-14 18:52:02,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:52:02,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:52:02,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2018-11-14 18:52:02,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:52:02,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2018-11-14 18:52:02,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2018-11-14 18:52:02,440 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:52:02,443 INFO L225 Difference]: With dead ends: 73 [2018-11-14 18:52:02,443 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 18:52:02,444 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:52:02,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 18:52:02,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-14 18:52:02,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:52:02,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 41 states. [2018-11-14 18:52:02,503 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 41 states. [2018-11-14 18:52:02,503 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 41 states. [2018-11-14 18:52:02,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:02,505 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-14 18:52:02,505 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-14 18:52:02,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:52:02,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:52:02,506 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 42 states. [2018-11-14 18:52:02,507 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 42 states. [2018-11-14 18:52:02,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:02,509 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-14 18:52:02,509 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-14 18:52:02,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:52:02,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:52:02,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:52:02,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:52:02,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-14 18:52:02,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-14 18:52:02,513 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 31 [2018-11-14 18:52:02,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:52:02,513 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-14 18:52:02,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:52:02,513 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-14 18:52:02,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 18:52:02,514 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:52:02,514 INFO L375 BasicCegarLoop]: trace histogram [3, 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-14 18:52:02,515 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:52:02,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:52:02,515 INFO L82 PathProgramCache]: Analyzing trace with hash 920631581, now seen corresponding path program 1 times [2018-11-14 18:52:02,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:52:02,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:52:02,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:52:02,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:52:02,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:52:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:52:03,123 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 30 [2018-11-14 18:52:03,386 WARN L179 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2018-11-14 18:52:03,944 INFO L256 TraceCheckUtils]: 0: Hoare triple {1359#true} call ULTIMATE.init(); {1359#true} is VALID [2018-11-14 18:52:03,945 INFO L273 TraceCheckUtils]: 1: Hoare triple {1359#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {1359#true} is VALID [2018-11-14 18:52:03,945 INFO L273 TraceCheckUtils]: 2: Hoare triple {1359#true} assume true; {1359#true} is VALID [2018-11-14 18:52:03,945 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1359#true} {1359#true} #86#return; {1359#true} is VALID [2018-11-14 18:52:03,945 INFO L256 TraceCheckUtils]: 4: Hoare triple {1359#true} call #t~ret8 := main(); {1359#true} is VALID [2018-11-14 18:52:03,946 INFO L273 TraceCheckUtils]: 5: Hoare triple {1359#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {1359#true} is VALID [2018-11-14 18:52:03,947 INFO L273 TraceCheckUtils]: 6: Hoare triple {1359#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4); {1361#(and (<= 2 ~CELLCOUNT~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:03,948 INFO L273 TraceCheckUtils]: 7: Hoare triple {1361#(and (<= 2 ~CELLCOUNT~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) == 0 then 1 else 0) != 0;~i~0 := 1; {1362#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:03,948 INFO L273 TraceCheckUtils]: 8: Hoare triple {1362#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume true; {1362#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:03,950 INFO L273 TraceCheckUtils]: 9: Hoare triple {1362#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 / 2 + 1 else ~CELLCOUNT~0 / 2));~j~0 := 2; {1363#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (or (= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 main_~j~0)) (and (<= main_~j~0 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 main_~j~0)) (= main_~i~0 1))) (or (<= main_~MINVAL~0 main_~j~0) (not (= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 main_~j~0)))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 18:52:03,951 INFO L273 TraceCheckUtils]: 10: Hoare triple {1363#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (or (= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 main_~j~0)) (and (<= main_~j~0 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 main_~j~0)) (= main_~i~0 1))) (or (<= main_~MINVAL~0 main_~j~0) (not (= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 main_~j~0)))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} assume true; {1363#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (or (= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 main_~j~0)) (and (<= main_~j~0 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 main_~j~0)) (= main_~i~0 1))) (or (<= main_~MINVAL~0 main_~j~0) (not (= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 main_~j~0)))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 18:52:03,952 INFO L273 TraceCheckUtils]: 11: Hoare triple {1363#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (or (= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 main_~j~0)) (and (<= main_~j~0 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 main_~j~0)) (= main_~i~0 1))) (or (<= main_~MINVAL~0 main_~j~0) (not (= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 main_~j~0)))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} assume !!(~j~0 >= 1); {1363#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (or (= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 main_~j~0)) (and (<= main_~j~0 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 main_~j~0)) (= main_~i~0 1))) (or (<= main_~MINVAL~0 main_~j~0) (not (= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 main_~j~0)))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 18:52:03,954 INFO L273 TraceCheckUtils]: 12: Hoare triple {1363#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (or (= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 main_~j~0)) (and (<= main_~j~0 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 main_~j~0)) (= main_~i~0 1))) (or (<= main_~MINVAL~0 main_~j~0) (not (= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 main_~j~0)))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 2 - ~j~0) * 4, 4); {1364#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (or (= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 main_~j~0)) (and (<= main_~j~0 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 main_~j~0)) (= main_~i~0 1))) (= |main_~#volArray~0.offset| 0) (or (and (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)))) (<= main_~MINVAL~0 main_~j~0)) (not (= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 main_~j~0)))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 18:52:03,956 INFO L273 TraceCheckUtils]: 13: Hoare triple {1364#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (or (= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 main_~j~0)) (and (<= main_~j~0 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 main_~j~0)) (= main_~i~0 1))) (= |main_~#volArray~0.offset| 0) (or (and (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)))) (<= main_~MINVAL~0 main_~j~0)) (not (= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 main_~j~0)))) (< 0 (+ ~CELLCOUNT~0 1)))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1365#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= |main_~#volArray~0.offset| 0) (or (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) 0)) (and (= main_~i~0 1) (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0) 1) (* 4 ~CELLCOUNT~0)))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 18:52:03,958 INFO L273 TraceCheckUtils]: 14: Hoare triple {1365#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= |main_~#volArray~0.offset| 0) (or (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) 0)) (and (= main_~i~0 1) (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0) 1) (* 4 ~CELLCOUNT~0)))) (< 0 (+ ~CELLCOUNT~0 1)))} assume true; {1365#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= |main_~#volArray~0.offset| 0) (or (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) 0)) (and (= main_~i~0 1) (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0) 1) (* 4 ~CELLCOUNT~0)))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 18:52:03,959 INFO L273 TraceCheckUtils]: 15: Hoare triple {1365#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= |main_~#volArray~0.offset| 0) (or (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) 0)) (and (= main_~i~0 1) (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0) 1) (* 4 ~CELLCOUNT~0)))) (< 0 (+ ~CELLCOUNT~0 1)))} assume !!(~j~0 >= 1); {1365#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= |main_~#volArray~0.offset| 0) (or (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) 0)) (and (= main_~i~0 1) (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0) 1) (* 4 ~CELLCOUNT~0)))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 18:52:03,961 INFO L273 TraceCheckUtils]: 16: Hoare triple {1365#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= |main_~#volArray~0.offset| 0) (or (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) 0)) (and (= main_~i~0 1) (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0) 1) (* 4 ~CELLCOUNT~0)))) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 2 - ~j~0) * 4, 4); {1366#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (and (= main_~i~0 1) (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0) 1) (* 4 ~CELLCOUNT~0)))))} is VALID [2018-11-14 18:52:03,962 INFO L273 TraceCheckUtils]: 17: Hoare triple {1366#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (and (= main_~i~0 1) (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0) 1) (* 4 ~CELLCOUNT~0)))))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1366#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (and (= main_~i~0 1) (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0) 1) (* 4 ~CELLCOUNT~0)))))} is VALID [2018-11-14 18:52:03,963 INFO L273 TraceCheckUtils]: 18: Hoare triple {1366#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (and (= main_~i~0 1) (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0) 1) (* 4 ~CELLCOUNT~0)))))} assume true; {1366#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (and (= main_~i~0 1) (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0) 1) (* 4 ~CELLCOUNT~0)))))} is VALID [2018-11-14 18:52:03,964 INFO L273 TraceCheckUtils]: 19: Hoare triple {1366#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (and (= main_~i~0 1) (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0) 1) (* 4 ~CELLCOUNT~0)))))} assume !(~j~0 >= 1); {1366#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (and (= main_~i~0 1) (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0) 1) (* 4 ~CELLCOUNT~0)))))} is VALID [2018-11-14 18:52:03,966 INFO L273 TraceCheckUtils]: 20: Hoare triple {1366#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (and (= main_~i~0 1) (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0) 1) (* 4 ~CELLCOUNT~0)))))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1367#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (+ (* 4 ~CELLCOUNT~0) 7)) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0))))} is VALID [2018-11-14 18:52:03,967 INFO L273 TraceCheckUtils]: 21: Hoare triple {1367#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (+ (* 4 ~CELLCOUNT~0) 7)) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0))))} assume true; {1367#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (+ (* 4 ~CELLCOUNT~0) 7)) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0))))} is VALID [2018-11-14 18:52:03,969 INFO L273 TraceCheckUtils]: 22: Hoare triple {1367#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (+ (* 4 ~CELLCOUNT~0) 7)) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 / 2 + 1 else ~CELLCOUNT~0 / 2)); {1368#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} is VALID [2018-11-14 18:52:03,970 INFO L273 TraceCheckUtils]: 23: Hoare triple {1368#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} ~i~0 := 0; {1369#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-14 18:52:03,971 INFO L273 TraceCheckUtils]: 24: Hoare triple {1369#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= main_~i~0 0))} assume true; {1369#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-14 18:52:03,972 INFO L273 TraceCheckUtils]: 25: Hoare triple {1369#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {1370#(and |main_#t~short7| (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 18:52:03,973 INFO L273 TraceCheckUtils]: 26: Hoare triple {1370#(and |main_#t~short7| (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short7 := #t~mem6 == 0; {1360#false} is VALID [2018-11-14 18:52:03,973 INFO L256 TraceCheckUtils]: 27: Hoare triple {1360#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {1360#false} is VALID [2018-11-14 18:52:03,974 INFO L273 TraceCheckUtils]: 28: Hoare triple {1360#false} ~cond := #in~cond; {1360#false} is VALID [2018-11-14 18:52:03,974 INFO L273 TraceCheckUtils]: 29: Hoare triple {1360#false} assume ~cond == 0; {1360#false} is VALID [2018-11-14 18:52:03,974 INFO L273 TraceCheckUtils]: 30: Hoare triple {1360#false} assume !false; {1360#false} is VALID [2018-11-14 18:52:03,987 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:52:03,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:52:03,987 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-14 18:52:04,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:52:04,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:52:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:52:04,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:52:04,223 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 16 treesize of output 13 [2018-11-14 18:52:04,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-14 18:52:04,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:52:04,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:04,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:04,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-14 18:52:04,343 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 24 treesize of output 19 [2018-11-14 18:52:04,351 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:04,365 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 2 case distinctions, treesize of input 19 treesize of output 29 [2018-11-14 18:52:04,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-14 18:52:04,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:52:04,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-14 18:52:04,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:41 [2018-11-14 18:52:04,420 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:52:05,215 INFO L256 TraceCheckUtils]: 0: Hoare triple {1359#true} call ULTIMATE.init(); {1359#true} is VALID [2018-11-14 18:52:05,215 INFO L273 TraceCheckUtils]: 1: Hoare triple {1359#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {1359#true} is VALID [2018-11-14 18:52:05,215 INFO L273 TraceCheckUtils]: 2: Hoare triple {1359#true} assume true; {1359#true} is VALID [2018-11-14 18:52:05,215 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1359#true} {1359#true} #86#return; {1359#true} is VALID [2018-11-14 18:52:05,216 INFO L256 TraceCheckUtils]: 4: Hoare triple {1359#true} call #t~ret8 := main(); {1359#true} is VALID [2018-11-14 18:52:05,216 INFO L273 TraceCheckUtils]: 5: Hoare triple {1359#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {1359#true} is VALID [2018-11-14 18:52:05,217 INFO L273 TraceCheckUtils]: 6: Hoare triple {1359#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4); {1392#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:05,218 INFO L273 TraceCheckUtils]: 7: Hoare triple {1392#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) == 0 then 1 else 0) != 0;~i~0 := 1; {1396#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:05,218 INFO L273 TraceCheckUtils]: 8: Hoare triple {1396#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume true; {1396#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:05,219 INFO L273 TraceCheckUtils]: 9: Hoare triple {1396#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 / 2 + 1 else ~CELLCOUNT~0 / 2));~j~0 := 2; {1403#(and (= main_~j~0 2) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:05,220 INFO L273 TraceCheckUtils]: 10: Hoare triple {1403#(and (= main_~j~0 2) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume true; {1403#(and (= main_~j~0 2) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:05,228 INFO L273 TraceCheckUtils]: 11: Hoare triple {1403#(and (= main_~j~0 2) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~j~0 >= 1); {1403#(and (= main_~j~0 2) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:05,229 INFO L273 TraceCheckUtils]: 12: Hoare triple {1403#(and (= main_~j~0 2) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 2 - ~j~0) * 4, 4); {1413#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (- 8))) 2))} is VALID [2018-11-14 18:52:05,230 INFO L273 TraceCheckUtils]: 13: Hoare triple {1413#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (- 8))) 2))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1413#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (- 8))) 2))} is VALID [2018-11-14 18:52:05,231 INFO L273 TraceCheckUtils]: 14: Hoare triple {1413#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (- 8))) 2))} assume true; {1413#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (- 8))) 2))} is VALID [2018-11-14 18:52:05,232 INFO L273 TraceCheckUtils]: 15: Hoare triple {1413#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (- 8))) 2))} assume !!(~j~0 >= 1); {1413#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (- 8))) 2))} is VALID [2018-11-14 18:52:05,234 INFO L273 TraceCheckUtils]: 16: Hoare triple {1413#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (- 8))) 2))} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 2 - ~j~0) * 4, 4); {1426#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0)) (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 8)) 0)) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 2)))} is VALID [2018-11-14 18:52:05,237 INFO L273 TraceCheckUtils]: 17: Hoare triple {1426#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0)) (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 8)) 0)) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 2)))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1426#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0)) (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 8)) 0)) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 2)))} is VALID [2018-11-14 18:52:05,238 INFO L273 TraceCheckUtils]: 18: Hoare triple {1426#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0)) (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 8)) 0)) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 2)))} assume true; {1426#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0)) (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 8)) 0)) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 2)))} is VALID [2018-11-14 18:52:05,239 INFO L273 TraceCheckUtils]: 19: Hoare triple {1426#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0)) (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 8)) 0)) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 2)))} assume !(~j~0 >= 1); {1426#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0)) (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 8)) 0)) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 2)))} is VALID [2018-11-14 18:52:05,239 INFO L273 TraceCheckUtils]: 20: Hoare triple {1426#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0)) (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 8)) 0)) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 2)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1426#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0)) (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 8)) 0)) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 2)))} is VALID [2018-11-14 18:52:05,240 INFO L273 TraceCheckUtils]: 21: Hoare triple {1426#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0)) (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 8)) 0)) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 2)))} assume true; {1426#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0)) (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 8)) 0)) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 2)))} is VALID [2018-11-14 18:52:05,240 INFO L273 TraceCheckUtils]: 22: Hoare triple {1426#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0)) (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 8)) 0)) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 2)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 / 2 + 1 else ~CELLCOUNT~0 / 2)); {1426#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0)) (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 8)) 0)) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 2)))} is VALID [2018-11-14 18:52:05,241 INFO L273 TraceCheckUtils]: 23: Hoare triple {1426#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0)) (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 8)) 0)) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 2)))} ~i~0 := 0; {1448#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 8)) 0)) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 2) (= main_~i~0 0)) (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0) (= main_~i~0 0)))} is VALID [2018-11-14 18:52:05,241 INFO L273 TraceCheckUtils]: 24: Hoare triple {1448#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 8)) 0)) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 2) (= main_~i~0 0)) (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0) (= main_~i~0 0)))} assume true; {1448#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 8)) 0)) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 2) (= main_~i~0 0)) (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0) (= main_~i~0 0)))} is VALID [2018-11-14 18:52:05,243 INFO L273 TraceCheckUtils]: 25: Hoare triple {1448#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 8)) 0)) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 2) (= main_~i~0 0)) (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0) (= main_~i~0 0)))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {1455#(or (and (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0) (= main_~i~0 0)) (and |main_#t~short7| (exists ((v_prenex_1 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 8)) 0)) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 2) (= main_~i~0 0)))} is VALID [2018-11-14 18:52:05,244 INFO L273 TraceCheckUtils]: 26: Hoare triple {1455#(or (and (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0) (= main_~i~0 0)) (and |main_#t~short7| (exists ((v_prenex_1 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 8)) 0)) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 2) (= main_~i~0 0)))} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short7 := #t~mem6 == 0; {1459#|main_#t~short7|} is VALID [2018-11-14 18:52:05,245 INFO L256 TraceCheckUtils]: 27: Hoare triple {1459#|main_#t~short7|} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {1463#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 18:52:05,246 INFO L273 TraceCheckUtils]: 28: Hoare triple {1463#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1467#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 18:52:05,246 INFO L273 TraceCheckUtils]: 29: Hoare triple {1467#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {1360#false} is VALID [2018-11-14 18:52:05,247 INFO L273 TraceCheckUtils]: 30: Hoare triple {1360#false} assume !false; {1360#false} is VALID [2018-11-14 18:52:05,253 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:52:05,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:52:05,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-11-14 18:52:05,274 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2018-11-14 18:52:05,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:52:05,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-14 18:52:05,446 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:52:05,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-14 18:52:05,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-14 18:52:05,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2018-11-14 18:52:05,449 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 22 states. [2018-11-14 18:52:06,659 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2018-11-14 18:52:11,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:11,950 INFO L93 Difference]: Finished difference Result 171 states and 205 transitions. [2018-11-14 18:52:11,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-14 18:52:11,950 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2018-11-14 18:52:11,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:52:11,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 18:52:11,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 174 transitions. [2018-11-14 18:52:11,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 18:52:11,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 174 transitions. [2018-11-14 18:52:11,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 174 transitions. [2018-11-14 18:52:12,495 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:52:12,500 INFO L225 Difference]: With dead ends: 171 [2018-11-14 18:52:12,501 INFO L226 Difference]: Without dead ends: 140 [2018-11-14 18:52:12,502 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=338, Invalid=1642, Unknown=0, NotChecked=0, Total=1980 [2018-11-14 18:52:12,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-14 18:52:12,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 75. [2018-11-14 18:52:12,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:52:12,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand 75 states. [2018-11-14 18:52:12,637 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 75 states. [2018-11-14 18:52:12,637 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 75 states. [2018-11-14 18:52:12,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:12,645 INFO L93 Difference]: Finished difference Result 140 states and 167 transitions. [2018-11-14 18:52:12,645 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 167 transitions. [2018-11-14 18:52:12,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:52:12,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:52:12,646 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 140 states. [2018-11-14 18:52:12,646 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 140 states. [2018-11-14 18:52:12,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:12,653 INFO L93 Difference]: Finished difference Result 140 states and 167 transitions. [2018-11-14 18:52:12,653 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 167 transitions. [2018-11-14 18:52:12,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:52:12,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:52:12,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:52:12,654 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:52:12,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-14 18:52:12,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2018-11-14 18:52:12,657 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 31 [2018-11-14 18:52:12,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:52:12,657 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2018-11-14 18:52:12,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-14 18:52:12,658 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2018-11-14 18:52:12,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-14 18:52:12,659 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:52:12,659 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:52:12,659 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:52:12,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:52:12,660 INFO L82 PathProgramCache]: Analyzing trace with hash 750617608, now seen corresponding path program 1 times [2018-11-14 18:52:12,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:52:12,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:52:12,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:52:12,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:52:12,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:52:12,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:52:13,640 INFO L256 TraceCheckUtils]: 0: Hoare triple {2123#true} call ULTIMATE.init(); {2123#true} is VALID [2018-11-14 18:52:13,641 INFO L273 TraceCheckUtils]: 1: Hoare triple {2123#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {2123#true} is VALID [2018-11-14 18:52:13,641 INFO L273 TraceCheckUtils]: 2: Hoare triple {2123#true} assume true; {2123#true} is VALID [2018-11-14 18:52:13,641 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2123#true} {2123#true} #86#return; {2123#true} is VALID [2018-11-14 18:52:13,642 INFO L256 TraceCheckUtils]: 4: Hoare triple {2123#true} call #t~ret8 := main(); {2123#true} is VALID [2018-11-14 18:52:13,642 INFO L273 TraceCheckUtils]: 5: Hoare triple {2123#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {2123#true} is VALID [2018-11-14 18:52:13,643 INFO L273 TraceCheckUtils]: 6: Hoare triple {2123#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4); {2125#(<= 2 ~CELLCOUNT~0)} is VALID [2018-11-14 18:52:13,644 INFO L273 TraceCheckUtils]: 7: Hoare triple {2125#(<= 2 ~CELLCOUNT~0)} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) == 0 then 1 else 0) != 0;~i~0 := 1; {2126#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} is VALID [2018-11-14 18:52:13,645 INFO L273 TraceCheckUtils]: 8: Hoare triple {2126#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} assume true; {2126#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} is VALID [2018-11-14 18:52:13,645 INFO L273 TraceCheckUtils]: 9: Hoare triple {2126#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 / 2 + 1 else ~CELLCOUNT~0 / 2));~j~0 := 2; {2126#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} is VALID [2018-11-14 18:52:13,646 INFO L273 TraceCheckUtils]: 10: Hoare triple {2126#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} assume true; {2126#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} is VALID [2018-11-14 18:52:13,646 INFO L273 TraceCheckUtils]: 11: Hoare triple {2126#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} assume !!(~j~0 >= 1); {2126#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} is VALID [2018-11-14 18:52:13,647 INFO L273 TraceCheckUtils]: 12: Hoare triple {2126#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 2 - ~j~0) * 4, 4); {2126#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} is VALID [2018-11-14 18:52:13,648 INFO L273 TraceCheckUtils]: 13: Hoare triple {2126#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2126#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} is VALID [2018-11-14 18:52:13,649 INFO L273 TraceCheckUtils]: 14: Hoare triple {2126#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} assume true; {2126#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} is VALID [2018-11-14 18:52:13,650 INFO L273 TraceCheckUtils]: 15: Hoare triple {2126#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} assume !!(~j~0 >= 1); {2127#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (<= 1 main_~j~0) (= main_~i~0 1))} is VALID [2018-11-14 18:52:13,651 INFO L273 TraceCheckUtils]: 16: Hoare triple {2127#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (<= 1 main_~j~0) (= main_~i~0 1))} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 2 - ~j~0) * 4, 4); {2128#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (<= 1 main_~j~0) (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)))))} is VALID [2018-11-14 18:52:13,653 INFO L273 TraceCheckUtils]: 17: Hoare triple {2128#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (<= 1 main_~j~0) (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)))))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2129#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= main_~i~0 1) (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (- main_~j~0) (+ (- ~CELLCOUNT~0) 1))) (+ |main_~#volArray~0.offset| (* 8 main_~i~0))))) (<= 3 (+ main_~j~0 ~CELLCOUNT~0))) (<= 2 (+ main_~j~0 ~CELLCOUNT~0)) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 18:52:13,654 INFO L273 TraceCheckUtils]: 18: Hoare triple {2129#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= main_~i~0 1) (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (- main_~j~0) (+ (- ~CELLCOUNT~0) 1))) (+ |main_~#volArray~0.offset| (* 8 main_~i~0))))) (<= 3 (+ main_~j~0 ~CELLCOUNT~0))) (<= 2 (+ main_~j~0 ~CELLCOUNT~0)) (< 0 (+ ~CELLCOUNT~0 1)))} assume true; {2129#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= main_~i~0 1) (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (- main_~j~0) (+ (- ~CELLCOUNT~0) 1))) (+ |main_~#volArray~0.offset| (* 8 main_~i~0))))) (<= 3 (+ main_~j~0 ~CELLCOUNT~0))) (<= 2 (+ main_~j~0 ~CELLCOUNT~0)) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 18:52:13,656 INFO L273 TraceCheckUtils]: 19: Hoare triple {2129#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= main_~i~0 1) (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (- main_~j~0) (+ (- ~CELLCOUNT~0) 1))) (+ |main_~#volArray~0.offset| (* 8 main_~i~0))))) (<= 3 (+ main_~j~0 ~CELLCOUNT~0))) (<= 2 (+ main_~j~0 ~CELLCOUNT~0)) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~j~0 >= 1); {2130#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (- ~CELLCOUNT~0) 1)) (+ |main_~#volArray~0.offset| (* 8 main_~i~0))))) (<= 3 ~CELLCOUNT~0)) (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} is VALID [2018-11-14 18:52:13,658 INFO L273 TraceCheckUtils]: 20: Hoare triple {2130#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (- ~CELLCOUNT~0) 1)) (+ |main_~#volArray~0.offset| (* 8 main_~i~0))))) (<= 3 ~CELLCOUNT~0)) (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2131#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (or (<= (* 2 main_~i~0) (+ ~CELLCOUNT~0 1)) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 2 main_~i~0) (+ (- ~CELLCOUNT~0) (- 1)))) |main_~#volArray~0.offset|)))) (< 0 (+ ~CELLCOUNT~0 1)) (<= (* 2 main_~i~0) (+ ~CELLCOUNT~0 2)))} is VALID [2018-11-14 18:52:13,659 INFO L273 TraceCheckUtils]: 21: Hoare triple {2131#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (or (<= (* 2 main_~i~0) (+ ~CELLCOUNT~0 1)) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 2 main_~i~0) (+ (- ~CELLCOUNT~0) (- 1)))) |main_~#volArray~0.offset|)))) (< 0 (+ ~CELLCOUNT~0 1)) (<= (* 2 main_~i~0) (+ ~CELLCOUNT~0 2)))} assume true; {2131#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (or (<= (* 2 main_~i~0) (+ ~CELLCOUNT~0 1)) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 2 main_~i~0) (+ (- ~CELLCOUNT~0) (- 1)))) |main_~#volArray~0.offset|)))) (< 0 (+ ~CELLCOUNT~0 1)) (<= (* 2 main_~i~0) (+ ~CELLCOUNT~0 2)))} is VALID [2018-11-14 18:52:13,661 INFO L273 TraceCheckUtils]: 22: Hoare triple {2131#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (or (<= (* 2 main_~i~0) (+ ~CELLCOUNT~0 1)) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 2 main_~i~0) (+ (- ~CELLCOUNT~0) (- 1)))) |main_~#volArray~0.offset|)))) (< 0 (+ ~CELLCOUNT~0 1)) (<= (* 2 main_~i~0) (+ ~CELLCOUNT~0 2)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 / 2 + 1 else ~CELLCOUNT~0 / 2)); {2132#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} is VALID [2018-11-14 18:52:13,661 INFO L273 TraceCheckUtils]: 23: Hoare triple {2132#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} ~i~0 := 0; {2133#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-14 18:52:13,662 INFO L273 TraceCheckUtils]: 24: Hoare triple {2133#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} assume true; {2133#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-14 18:52:13,663 INFO L273 TraceCheckUtils]: 25: Hoare triple {2133#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {2133#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-14 18:52:13,664 INFO L273 TraceCheckUtils]: 26: Hoare triple {2133#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} assume #t~short7; {2133#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-14 18:52:13,665 INFO L256 TraceCheckUtils]: 27: Hoare triple {2133#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {2123#true} is VALID [2018-11-14 18:52:13,665 INFO L273 TraceCheckUtils]: 28: Hoare triple {2123#true} ~cond := #in~cond; {2123#true} is VALID [2018-11-14 18:52:13,665 INFO L273 TraceCheckUtils]: 29: Hoare triple {2123#true} assume !(~cond == 0); {2123#true} is VALID [2018-11-14 18:52:13,665 INFO L273 TraceCheckUtils]: 30: Hoare triple {2123#true} assume true; {2123#true} is VALID [2018-11-14 18:52:13,667 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {2123#true} {2133#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} #90#return; {2133#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-14 18:52:13,671 INFO L273 TraceCheckUtils]: 32: Hoare triple {2133#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} havoc #t~short7;havoc #t~mem6;havoc #t~mem5; {2133#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-14 18:52:13,673 INFO L273 TraceCheckUtils]: 33: Hoare triple {2133#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {2134#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} is VALID [2018-11-14 18:52:13,674 INFO L273 TraceCheckUtils]: 34: Hoare triple {2134#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} assume true; {2134#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} is VALID [2018-11-14 18:52:13,675 INFO L273 TraceCheckUtils]: 35: Hoare triple {2134#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {2134#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} is VALID [2018-11-14 18:52:13,676 INFO L273 TraceCheckUtils]: 36: Hoare triple {2134#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short7 := #t~mem6 == 0; {2135#|main_#t~short7|} is VALID [2018-11-14 18:52:13,677 INFO L256 TraceCheckUtils]: 37: Hoare triple {2135#|main_#t~short7|} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {2136#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 18:52:13,677 INFO L273 TraceCheckUtils]: 38: Hoare triple {2136#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2137#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-14 18:52:13,677 INFO L273 TraceCheckUtils]: 39: Hoare triple {2137#(not (= __VERIFIER_assert_~cond 0))} assume ~cond == 0; {2124#false} is VALID [2018-11-14 18:52:13,677 INFO L273 TraceCheckUtils]: 40: Hoare triple {2124#false} assume !false; {2124#false} is VALID [2018-11-14 18:52:13,685 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:52:13,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:52:13,685 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-14 18:52:13,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:52:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:52:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:52:13,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:52:13,884 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 16 treesize of output 13 [2018-11-14 18:52:13,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-14 18:52:13,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:52:13,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:13,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:52:13,902 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-11-14 18:52:13,905 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:52:15,216 INFO L256 TraceCheckUtils]: 0: Hoare triple {2123#true} call ULTIMATE.init(); {2123#true} is VALID [2018-11-14 18:52:15,216 INFO L273 TraceCheckUtils]: 1: Hoare triple {2123#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {2123#true} is VALID [2018-11-14 18:52:15,216 INFO L273 TraceCheckUtils]: 2: Hoare triple {2123#true} assume true; {2123#true} is VALID [2018-11-14 18:52:15,216 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2123#true} {2123#true} #86#return; {2123#true} is VALID [2018-11-14 18:52:15,216 INFO L256 TraceCheckUtils]: 4: Hoare triple {2123#true} call #t~ret8 := main(); {2123#true} is VALID [2018-11-14 18:52:15,217 INFO L273 TraceCheckUtils]: 5: Hoare triple {2123#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {2123#true} is VALID [2018-11-14 18:52:15,217 INFO L273 TraceCheckUtils]: 6: Hoare triple {2123#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4); {2123#true} is VALID [2018-11-14 18:52:15,217 INFO L273 TraceCheckUtils]: 7: Hoare triple {2123#true} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) == 0 then 1 else 0) != 0;~i~0 := 1; {2162#(= main_~i~0 1)} is VALID [2018-11-14 18:52:15,218 INFO L273 TraceCheckUtils]: 8: Hoare triple {2162#(= main_~i~0 1)} assume true; {2162#(= main_~i~0 1)} is VALID [2018-11-14 18:52:15,219 INFO L273 TraceCheckUtils]: 9: Hoare triple {2162#(= main_~i~0 1)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 / 2 + 1 else ~CELLCOUNT~0 / 2));~j~0 := 2; {2169#(and (= main_~i~0 1) (<= main_~j~0 2))} is VALID [2018-11-14 18:52:15,220 INFO L273 TraceCheckUtils]: 10: Hoare triple {2169#(and (= main_~i~0 1) (<= main_~j~0 2))} assume true; {2169#(and (= main_~i~0 1) (<= main_~j~0 2))} is VALID [2018-11-14 18:52:15,220 INFO L273 TraceCheckUtils]: 11: Hoare triple {2169#(and (= main_~i~0 1) (<= main_~j~0 2))} assume !!(~j~0 >= 1); {2169#(and (= main_~i~0 1) (<= main_~j~0 2))} is VALID [2018-11-14 18:52:15,221 INFO L273 TraceCheckUtils]: 12: Hoare triple {2169#(and (= main_~i~0 1) (<= main_~j~0 2))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 2 - ~j~0) * 4, 4); {2169#(and (= main_~i~0 1) (<= main_~j~0 2))} is VALID [2018-11-14 18:52:15,222 INFO L273 TraceCheckUtils]: 13: Hoare triple {2169#(and (= main_~i~0 1) (<= main_~j~0 2))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2182#(and (<= main_~j~0 1) (= main_~i~0 1))} is VALID [2018-11-14 18:52:15,223 INFO L273 TraceCheckUtils]: 14: Hoare triple {2182#(and (<= main_~j~0 1) (= main_~i~0 1))} assume true; {2182#(and (<= main_~j~0 1) (= main_~i~0 1))} is VALID [2018-11-14 18:52:15,224 INFO L273 TraceCheckUtils]: 15: Hoare triple {2182#(and (<= main_~j~0 1) (= main_~i~0 1))} assume !!(~j~0 >= 1); {2189#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= main_~i~0 1))} is VALID [2018-11-14 18:52:15,225 INFO L273 TraceCheckUtils]: 16: Hoare triple {2189#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= main_~i~0 1))} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 2 - ~j~0) * 4, 4); {2132#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} is VALID [2018-11-14 18:52:15,225 INFO L273 TraceCheckUtils]: 17: Hoare triple {2132#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2132#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} is VALID [2018-11-14 18:52:15,226 INFO L273 TraceCheckUtils]: 18: Hoare triple {2132#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} assume true; {2132#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} is VALID [2018-11-14 18:52:15,227 INFO L273 TraceCheckUtils]: 19: Hoare triple {2132#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} assume !(~j~0 >= 1); {2132#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} is VALID [2018-11-14 18:52:15,228 INFO L273 TraceCheckUtils]: 20: Hoare triple {2132#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2132#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} is VALID [2018-11-14 18:52:15,228 INFO L273 TraceCheckUtils]: 21: Hoare triple {2132#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} assume true; {2132#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} is VALID [2018-11-14 18:52:15,229 INFO L273 TraceCheckUtils]: 22: Hoare triple {2132#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 2 != 0 then ~CELLCOUNT~0 / 2 + 1 else ~CELLCOUNT~0 / 2)); {2132#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} is VALID [2018-11-14 18:52:15,229 INFO L273 TraceCheckUtils]: 23: Hoare triple {2132#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} ~i~0 := 0; {2133#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-14 18:52:15,230 INFO L273 TraceCheckUtils]: 24: Hoare triple {2133#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} assume true; {2133#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-14 18:52:15,230 INFO L273 TraceCheckUtils]: 25: Hoare triple {2133#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {2133#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-14 18:52:15,231 INFO L273 TraceCheckUtils]: 26: Hoare triple {2133#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} assume #t~short7; {2133#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-14 18:52:15,232 INFO L256 TraceCheckUtils]: 27: Hoare triple {2133#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {2226#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_1| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_1| Int)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ |v_main_~#volArray~0.offset_BEFORE_CALL_1| 4))))} is VALID [2018-11-14 18:52:15,233 INFO L273 TraceCheckUtils]: 28: Hoare triple {2226#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_1| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_1| Int)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ |v_main_~#volArray~0.offset_BEFORE_CALL_1| 4))))} ~cond := #in~cond; {2226#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_1| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_1| Int)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ |v_main_~#volArray~0.offset_BEFORE_CALL_1| 4))))} is VALID [2018-11-14 18:52:15,233 INFO L273 TraceCheckUtils]: 29: Hoare triple {2226#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_1| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_1| Int)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ |v_main_~#volArray~0.offset_BEFORE_CALL_1| 4))))} assume !(~cond == 0); {2226#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_1| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_1| Int)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ |v_main_~#volArray~0.offset_BEFORE_CALL_1| 4))))} is VALID [2018-11-14 18:52:15,234 INFO L273 TraceCheckUtils]: 30: Hoare triple {2226#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_1| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_1| Int)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ |v_main_~#volArray~0.offset_BEFORE_CALL_1| 4))))} assume true; {2226#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_1| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_1| Int)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ |v_main_~#volArray~0.offset_BEFORE_CALL_1| 4))))} is VALID [2018-11-14 18:52:15,235 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {2226#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_1| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_1| Int)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ |v_main_~#volArray~0.offset_BEFORE_CALL_1| 4))))} {2133#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} #90#return; {2133#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-14 18:52:15,236 INFO L273 TraceCheckUtils]: 32: Hoare triple {2133#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} havoc #t~short7;havoc #t~mem6;havoc #t~mem5; {2133#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-14 18:52:15,237 INFO L273 TraceCheckUtils]: 33: Hoare triple {2133#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {2245#(and (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))))} is VALID [2018-11-14 18:52:15,238 INFO L273 TraceCheckUtils]: 34: Hoare triple {2245#(and (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))))} assume true; {2245#(and (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))))} is VALID [2018-11-14 18:52:15,239 INFO L273 TraceCheckUtils]: 35: Hoare triple {2245#(and (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {2245#(and (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))))} is VALID [2018-11-14 18:52:15,240 INFO L273 TraceCheckUtils]: 36: Hoare triple {2245#(and (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))))} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short7 := #t~mem6 == 0; {2135#|main_#t~short7|} is VALID [2018-11-14 18:52:15,241 INFO L256 TraceCheckUtils]: 37: Hoare triple {2135#|main_#t~short7|} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {2258#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 18:52:15,242 INFO L273 TraceCheckUtils]: 38: Hoare triple {2258#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2262#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 18:52:15,242 INFO L273 TraceCheckUtils]: 39: Hoare triple {2262#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {2124#false} is VALID [2018-11-14 18:52:15,243 INFO L273 TraceCheckUtils]: 40: Hoare triple {2124#false} assume !false; {2124#false} is VALID [2018-11-14 18:52:15,248 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:52:15,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:52:15,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 23 [2018-11-14 18:52:15,269 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 41 [2018-11-14 18:52:15,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:52:15,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-14 18:52:15,350 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:52:15,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-14 18:52:15,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-14 18:52:15,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=427, Unknown=2, NotChecked=0, Total=506 [2018-11-14 18:52:15,351 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 23 states. [2018-11-14 18:52:16,075 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 23 [2018-11-14 18:52:30,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:30,646 INFO L93 Difference]: Finished difference Result 146 states and 169 transitions. [2018-11-14 18:52:30,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-14 18:52:30,646 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 41 [2018-11-14 18:52:30,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:52:30,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 18:52:30,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 141 transitions. [2018-11-14 18:52:30,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 18:52:30,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 141 transitions. [2018-11-14 18:52:30,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 141 transitions. [2018-11-14 18:52:30,888 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:52:30,892 INFO L225 Difference]: With dead ends: 146 [2018-11-14 18:52:30,893 INFO L226 Difference]: Without dead ends: 144 [2018-11-14 18:52:30,894 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=351, Invalid=1903, Unknown=2, NotChecked=0, Total=2256 [2018-11-14 18:52:30,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-14 18:52:31,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 106. [2018-11-14 18:52:31,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:52:31,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand 106 states. [2018-11-14 18:52:31,170 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 106 states. [2018-11-14 18:52:31,170 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 106 states. [2018-11-14 18:52:31,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:31,177 INFO L93 Difference]: Finished difference Result 144 states and 167 transitions. [2018-11-14 18:52:31,177 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 167 transitions. [2018-11-14 18:52:31,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:52:31,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:52:31,179 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 144 states. [2018-11-14 18:52:31,179 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 144 states. [2018-11-14 18:52:31,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:31,185 INFO L93 Difference]: Finished difference Result 144 states and 167 transitions. [2018-11-14 18:52:31,186 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 167 transitions. [2018-11-14 18:52:31,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:52:31,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:52:31,187 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:52:31,187 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:52:31,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-14 18:52:31,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2018-11-14 18:52:31,191 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 41 [2018-11-14 18:52:31,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:52:31,191 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2018-11-14 18:52:31,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-14 18:52:31,192 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2018-11-14 18:52:31,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-14 18:52:31,193 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:52:31,193 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:52:31,193 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:52:31,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:52:31,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1807030162, now seen corresponding path program 2 times [2018-11-14 18:52:31,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:52:31,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:52:31,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:52:31,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:52:31,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:52:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:52:31,834 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:83) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:128) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:151) 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:152) 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-14 18:52:31,840 INFO L168 Benchmark]: Toolchain (without parser) took 35766.60 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 1.6 GB in the end (delta: -220.6 MB). Peak memory consumption was 828.5 MB. Max. memory is 7.1 GB. [2018-11-14 18:52:31,842 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 18:52:31,842 INFO L168 Benchmark]: CACSL2BoogieTranslator took 365.03 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-14 18:52:31,843 INFO L168 Benchmark]: Boogie Preprocessor took 48.55 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 18:52:31,843 INFO L168 Benchmark]: RCFGBuilder took 784.82 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 743.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -772.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2018-11-14 18:52:31,844 INFO L168 Benchmark]: TraceAbstraction took 34563.41 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 305.7 MB). Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 541.8 MB). Peak memory consumption was 847.4 MB. Max. memory is 7.1 GB. [2018-11-14 18:52:31,848 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 365.03 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 48.55 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 784.82 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 743.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -772.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 34563.41 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 305.7 MB). Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 541.8 MB). Peak memory consumption was 847.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:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...