java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-tiling/skippedu_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:04:10,547 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:04:10,549 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:04:10,561 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:04:10,562 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:04:10,563 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:04:10,564 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:04:10,566 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:04:10,567 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:04:10,569 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:04:10,570 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:04:10,570 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:04:10,573 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:04:10,574 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:04:10,575 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:04:10,576 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:04:10,582 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:04:10,584 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:04:10,591 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:04:10,594 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:04:10,595 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:04:10,599 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:04:10,603 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:04:10,603 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:04:10,603 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:04:10,605 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:04:10,606 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:04:10,611 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:04:10,611 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:04:10,613 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:04:10,613 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:04:10,614 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:04:10,614 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:04:10,614 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:04:10,617 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:04:10,618 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:04:10,618 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 17:04:10,645 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:04:10,645 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:04:10,647 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:04:10,647 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:04:10,648 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:04:10,649 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:04:10,649 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:04:10,649 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:04:10,649 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:04:10,649 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:04:10,650 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:04:10,650 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:04:10,650 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:04:10,650 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:04:10,650 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:04:10,651 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:04:10,652 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:04:10,652 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:04:10,652 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:04:10,652 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:04:10,653 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:04:10,653 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:04:10,653 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:04:10,653 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:04:10,653 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:04:10,653 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:04:10,654 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:04:10,654 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:04:10,654 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:04:10,654 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:04:10,718 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:04:10,733 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:04:10,737 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:04:10,738 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:04:10,739 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:04:10,739 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/skippedu_false-unreach-call.i [2018-11-14 17:04:10,795 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/832dd9d6f/f331bedd63774c3481cd43a6210ae92d/FLAG63981afb2 [2018-11-14 17:04:11,245 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:04:11,245 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/skippedu_false-unreach-call.i [2018-11-14 17:04:11,252 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/832dd9d6f/f331bedd63774c3481cd43a6210ae92d/FLAG63981afb2 [2018-11-14 17:04:11,267 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/832dd9d6f/f331bedd63774c3481cd43a6210ae92d [2018-11-14 17:04:11,277 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:04:11,278 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:04:11,279 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:04:11,280 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:04:11,283 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:04:11,285 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:04:11" (1/1) ... [2018-11-14 17:04:11,288 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d59079a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:11, skipping insertion in model container [2018-11-14 17:04:11,288 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:04:11" (1/1) ... [2018-11-14 17:04:11,299 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:04:11,328 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:04:11,600 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:04:11,606 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:04:11,639 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:04:11,669 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:04:11,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:11 WrapperNode [2018-11-14 17:04:11,670 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:04:11,671 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:04:11,671 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:04:11,671 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:04:11,688 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:11" (1/1) ... [2018-11-14 17:04:11,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:11" (1/1) ... [2018-11-14 17:04:11,701 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:11" (1/1) ... [2018-11-14 17:04:11,701 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:11" (1/1) ... [2018-11-14 17:04:11,721 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:11" (1/1) ... [2018-11-14 17:04:11,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:11" (1/1) ... [2018-11-14 17:04:11,732 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:11" (1/1) ... [2018-11-14 17:04:11,735 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:04:11,735 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:04:11,735 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:04:11,736 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:04:11,737 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:11" (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 17:04:11,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:04:11,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:04:11,898 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:04:11,898 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:04:11,898 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:04:11,899 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 17:04:11,899 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:04:11,899 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:04:11,899 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:04:11,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:04:11,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:04:11,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 17:04:11,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 17:04:11,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:04:11,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:04:11,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 17:04:12,580 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:04:12,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:04:12 BoogieIcfgContainer [2018-11-14 17:04:12,581 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:04:12,582 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:04:12,582 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:04:12,585 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:04:12,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:04:11" (1/3) ... [2018-11-14 17:04:12,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f4e8200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:04:12, skipping insertion in model container [2018-11-14 17:04:12,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:11" (2/3) ... [2018-11-14 17:04:12,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f4e8200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:04:12, skipping insertion in model container [2018-11-14 17:04:12,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:04:12" (3/3) ... [2018-11-14 17:04:12,589 INFO L112 eAbstractionObserver]: Analyzing ICFG skippedu_false-unreach-call.i [2018-11-14 17:04:12,600 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:04:12,608 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:04:12,624 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:04:12,656 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:04:12,656 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:04:12,657 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:04:12,657 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:04:12,657 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:04:12,657 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:04:12,657 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:04:12,657 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:04:12,658 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:04:12,677 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-14 17:04:12,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 17:04:12,684 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:04:12,685 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:04:12,688 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:04:12,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:04:12,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1798653287, now seen corresponding path program 1 times [2018-11-14 17:04:12,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:04:12,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:04:12,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:04:12,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:04:12,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:04:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:04:12,884 INFO L256 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {35#true} is VALID [2018-11-14 17:04:12,888 INFO L273 TraceCheckUtils]: 1: Hoare triple {35#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {35#true} is VALID [2018-11-14 17:04:12,888 INFO L273 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-14 17:04:12,889 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #74#return; {35#true} is VALID [2018-11-14 17:04:12,889 INFO L256 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret7 := main(); {35#true} is VALID [2018-11-14 17:04:12,889 INFO L273 TraceCheckUtils]: 5: Hoare triple {35#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {35#true} is VALID [2018-11-14 17:04:12,890 INFO L273 TraceCheckUtils]: 6: Hoare triple {35#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~SIZE~0 * 4); {35#true} is VALID [2018-11-14 17:04:12,890 INFO L273 TraceCheckUtils]: 7: Hoare triple {35#true} assume !((if ~SIZE~0 < 0 && ~SIZE~0 % 2 != 0 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) != 0);assume (if (if ~SIZE~0 < 0 && ~SIZE~0 % 2 != 0 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) == 0 then 1 else 0) != 0;~i~0 := 1; {35#true} is VALID [2018-11-14 17:04:12,903 INFO L273 TraceCheckUtils]: 8: Hoare triple {35#true} assume !true; {36#false} is VALID [2018-11-14 17:04:12,904 INFO L273 TraceCheckUtils]: 9: Hoare triple {36#false} ~i~0 := 0; {36#false} is VALID [2018-11-14 17:04:12,905 INFO L273 TraceCheckUtils]: 10: Hoare triple {36#false} assume true; {36#false} is VALID [2018-11-14 17:04:12,905 INFO L273 TraceCheckUtils]: 11: Hoare triple {36#false} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {36#false} is VALID [2018-11-14 17:04:12,905 INFO L256 TraceCheckUtils]: 12: Hoare triple {36#false} call __VERIFIER_assert((if #t~mem6 <= ~i~0 then 1 else 0)); {36#false} is VALID [2018-11-14 17:04:12,906 INFO L273 TraceCheckUtils]: 13: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2018-11-14 17:04:12,906 INFO L273 TraceCheckUtils]: 14: Hoare triple {36#false} assume ~cond == 0; {36#false} is VALID [2018-11-14 17:04:12,906 INFO L273 TraceCheckUtils]: 15: Hoare triple {36#false} assume !false; {36#false} is VALID [2018-11-14 17:04:12,910 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 17:04:12,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:04:12,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:04:12,919 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 17:04:12,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:04:12,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:04:13,162 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:04:13,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:04:13,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:04:13,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:04:13,175 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2018-11-14 17:04:13,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:13,337 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2018-11-14 17:04:13,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:04:13,338 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 17:04:13,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:04:13,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:04:13,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 61 transitions. [2018-11-14 17:04:13,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:04:13,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 61 transitions. [2018-11-14 17:04:13,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 61 transitions. [2018-11-14 17:04:13,561 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:04:13,575 INFO L225 Difference]: With dead ends: 50 [2018-11-14 17:04:13,575 INFO L226 Difference]: Without dead ends: 26 [2018-11-14 17:04:13,579 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 17:04:13,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-14 17:04:13,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-14 17:04:13,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:04:13,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-14 17:04:13,659 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-14 17:04:13,659 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-14 17:04:13,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:13,664 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-14 17:04:13,664 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-14 17:04:13,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:04:13,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:04:13,665 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-14 17:04:13,665 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-14 17:04:13,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:13,670 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-14 17:04:13,670 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-14 17:04:13,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:04:13,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:04:13,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:04:13,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:04:13,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 17:04:13,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-11-14 17:04:13,677 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 16 [2018-11-14 17:04:13,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:04:13,677 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-14 17:04:13,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:04:13,678 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-14 17:04:13,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 17:04:13,679 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:04:13,679 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 17:04:13,679 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:04:13,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:04:13,680 INFO L82 PathProgramCache]: Analyzing trace with hash -542838627, now seen corresponding path program 1 times [2018-11-14 17:04:13,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:04:13,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:04:13,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:04:13,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:04:13,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:04:13,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:04:13,909 INFO L256 TraceCheckUtils]: 0: Hoare triple {186#true} call ULTIMATE.init(); {186#true} is VALID [2018-11-14 17:04:13,910 INFO L273 TraceCheckUtils]: 1: Hoare triple {186#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {186#true} is VALID [2018-11-14 17:04:13,910 INFO L273 TraceCheckUtils]: 2: Hoare triple {186#true} assume true; {186#true} is VALID [2018-11-14 17:04:13,910 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {186#true} {186#true} #74#return; {186#true} is VALID [2018-11-14 17:04:13,910 INFO L256 TraceCheckUtils]: 4: Hoare triple {186#true} call #t~ret7 := main(); {186#true} is VALID [2018-11-14 17:04:13,911 INFO L273 TraceCheckUtils]: 5: Hoare triple {186#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {186#true} is VALID [2018-11-14 17:04:13,914 INFO L273 TraceCheckUtils]: 6: Hoare triple {186#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~SIZE~0 * 4); {188#(<= 2 ~SIZE~0)} is VALID [2018-11-14 17:04:13,935 INFO L273 TraceCheckUtils]: 7: Hoare triple {188#(<= 2 ~SIZE~0)} assume !((if ~SIZE~0 < 0 && ~SIZE~0 % 2 != 0 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) != 0);assume (if (if ~SIZE~0 < 0 && ~SIZE~0 % 2 != 0 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) == 0 then 1 else 0) != 0;~i~0 := 1; {189#(and (= main_~i~0 1) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (<= 2 ~SIZE~0))} is VALID [2018-11-14 17:04:13,945 INFO L273 TraceCheckUtils]: 8: Hoare triple {189#(and (= main_~i~0 1) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (<= 2 ~SIZE~0))} assume true; {189#(and (= main_~i~0 1) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (<= 2 ~SIZE~0))} is VALID [2018-11-14 17:04:13,959 INFO L273 TraceCheckUtils]: 9: Hoare triple {189#(and (= main_~i~0 1) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (<= 2 ~SIZE~0))} assume !(~i~0 <= (if ~SIZE~0 < 0 && ~SIZE~0 % 2 != 0 then ~SIZE~0 / 2 + 1 else ~SIZE~0 / 2)); {187#false} is VALID [2018-11-14 17:04:13,960 INFO L273 TraceCheckUtils]: 10: Hoare triple {187#false} ~i~0 := 0; {187#false} is VALID [2018-11-14 17:04:13,960 INFO L273 TraceCheckUtils]: 11: Hoare triple {187#false} assume true; {187#false} is VALID [2018-11-14 17:04:13,960 INFO L273 TraceCheckUtils]: 12: Hoare triple {187#false} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {187#false} is VALID [2018-11-14 17:04:13,961 INFO L256 TraceCheckUtils]: 13: Hoare triple {187#false} call __VERIFIER_assert((if #t~mem6 <= ~i~0 then 1 else 0)); {187#false} is VALID [2018-11-14 17:04:13,961 INFO L273 TraceCheckUtils]: 14: Hoare triple {187#false} ~cond := #in~cond; {187#false} is VALID [2018-11-14 17:04:13,961 INFO L273 TraceCheckUtils]: 15: Hoare triple {187#false} assume ~cond == 0; {187#false} is VALID [2018-11-14 17:04:13,962 INFO L273 TraceCheckUtils]: 16: Hoare triple {187#false} assume !false; {187#false} is VALID [2018-11-14 17:04:13,964 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 17:04:13,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:04:13,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:04:13,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-14 17:04:13,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:04:13,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:04:14,064 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 17:04:14,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:04:14,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:04:14,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:04:14,066 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 4 states. [2018-11-14 17:04:14,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:14,740 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-11-14 17:04:14,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:04:14,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-14 17:04:14,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:04:14,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:04:14,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2018-11-14 17:04:14,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:04:14,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2018-11-14 17:04:14,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2018-11-14 17:04:14,851 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:04:14,854 INFO L225 Difference]: With dead ends: 44 [2018-11-14 17:04:14,854 INFO L226 Difference]: Without dead ends: 32 [2018-11-14 17:04:14,855 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 17:04:14,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-14 17:04:14,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2018-11-14 17:04:14,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:04:14,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 28 states. [2018-11-14 17:04:14,871 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 28 states. [2018-11-14 17:04:14,871 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 28 states. [2018-11-14 17:04:14,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:14,875 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2018-11-14 17:04:14,875 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-14 17:04:14,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:04:14,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:04:14,876 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 32 states. [2018-11-14 17:04:14,876 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 32 states. [2018-11-14 17:04:14,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:14,879 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2018-11-14 17:04:14,879 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-14 17:04:14,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:04:14,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:04:14,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:04:14,881 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:04:14,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 17:04:14,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-14 17:04:14,883 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 17 [2018-11-14 17:04:14,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:04:14,884 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-14 17:04:14,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:04:14,884 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-14 17:04:14,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 17:04:14,885 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:04:14,885 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 17:04:14,886 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:04:14,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:04:14,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1697775982, now seen corresponding path program 1 times [2018-11-14 17:04:14,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:04:14,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:04:14,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:04:14,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:04:14,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:04:14,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:04:15,801 INFO L256 TraceCheckUtils]: 0: Hoare triple {349#true} call ULTIMATE.init(); {349#true} is VALID [2018-11-14 17:04:15,802 INFO L273 TraceCheckUtils]: 1: Hoare triple {349#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {349#true} is VALID [2018-11-14 17:04:15,802 INFO L273 TraceCheckUtils]: 2: Hoare triple {349#true} assume true; {349#true} is VALID [2018-11-14 17:04:15,803 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {349#true} {349#true} #74#return; {349#true} is VALID [2018-11-14 17:04:15,803 INFO L256 TraceCheckUtils]: 4: Hoare triple {349#true} call #t~ret7 := main(); {349#true} is VALID [2018-11-14 17:04:15,804 INFO L273 TraceCheckUtils]: 5: Hoare triple {349#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {349#true} is VALID [2018-11-14 17:04:15,806 INFO L273 TraceCheckUtils]: 6: Hoare triple {349#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~SIZE~0 * 4); {351#(and (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 17:04:15,807 INFO L273 TraceCheckUtils]: 7: Hoare triple {351#(and (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} assume !((if ~SIZE~0 < 0 && ~SIZE~0 % 2 != 0 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) != 0);assume (if (if ~SIZE~0 < 0 && ~SIZE~0 % 2 != 0 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) == 0 then 1 else 0) != 0;~i~0 := 1; {352#(and (= main_~i~0 1) (< 0 (+ ~SIZE~0 1)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 17:04:15,815 INFO L273 TraceCheckUtils]: 8: Hoare triple {352#(and (= main_~i~0 1) (< 0 (+ ~SIZE~0 1)) (= |main_~#a~0.offset| 0))} assume true; {352#(and (= main_~i~0 1) (< 0 (+ ~SIZE~0 1)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 17:04:15,816 INFO L273 TraceCheckUtils]: 9: Hoare triple {352#(and (= main_~i~0 1) (< 0 (+ ~SIZE~0 1)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && ~SIZE~0 % 2 != 0 then ~SIZE~0 / 2 + 1 else ~SIZE~0 / 2));call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + (2 * ~i~0 - 2) * 4, 4); {353#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 17:04:15,817 INFO L273 TraceCheckUtils]: 10: Hoare triple {353#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume #t~mem3 > ~i~0;havoc #t~mem3;call write~int(2 * ~i~0 - 2, ~#a~0.base, ~#a~0.offset + (2 * ~i~0 - 2) * 4, 4); {354#(and (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 8 main_~i~0) (- 8)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 17:04:15,818 INFO L273 TraceCheckUtils]: 11: Hoare triple {354#(and (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 8 main_~i~0) (- 8)))) (= |main_~#a~0.offset| 0))} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + (2 * ~i~0 - 1) * 4, 4); {354#(and (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 8 main_~i~0) (- 8)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 17:04:15,819 INFO L273 TraceCheckUtils]: 12: Hoare triple {354#(and (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 8 main_~i~0) (- 8)))) (= |main_~#a~0.offset| 0))} assume !(#t~mem4 > ~i~0);havoc #t~mem4; {354#(and (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 8 main_~i~0) (- 8)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 17:04:15,820 INFO L273 TraceCheckUtils]: 13: Hoare triple {354#(and (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 8 main_~i~0) (- 8)))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {355#(and (or (and (not (= (* 2 (div ~SIZE~0 2)) ~SIZE~0)) (<= (+ (* 8 main_~i~0) |main_~#a~0.offset|) (+ (* 8 (div ~SIZE~0 2)) 15)) (< ~SIZE~0 0)) (<= (+ (* 8 main_~i~0) |main_~#a~0.offset|) (+ (* 8 (div ~SIZE~0 2)) 7)) (= 0 (select (select |#memory_int| |main_~#a~0.base|) 0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 17:04:15,821 INFO L273 TraceCheckUtils]: 14: Hoare triple {355#(and (or (and (not (= (* 2 (div ~SIZE~0 2)) ~SIZE~0)) (<= (+ (* 8 main_~i~0) |main_~#a~0.offset|) (+ (* 8 (div ~SIZE~0 2)) 15)) (< ~SIZE~0 0)) (<= (+ (* 8 main_~i~0) |main_~#a~0.offset|) (+ (* 8 (div ~SIZE~0 2)) 7)) (= 0 (select (select |#memory_int| |main_~#a~0.base|) 0))) (= |main_~#a~0.offset| 0))} assume true; {355#(and (or (and (not (= (* 2 (div ~SIZE~0 2)) ~SIZE~0)) (<= (+ (* 8 main_~i~0) |main_~#a~0.offset|) (+ (* 8 (div ~SIZE~0 2)) 15)) (< ~SIZE~0 0)) (<= (+ (* 8 main_~i~0) |main_~#a~0.offset|) (+ (* 8 (div ~SIZE~0 2)) 7)) (= 0 (select (select |#memory_int| |main_~#a~0.base|) 0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 17:04:15,823 INFO L273 TraceCheckUtils]: 15: Hoare triple {355#(and (or (and (not (= (* 2 (div ~SIZE~0 2)) ~SIZE~0)) (<= (+ (* 8 main_~i~0) |main_~#a~0.offset|) (+ (* 8 (div ~SIZE~0 2)) 15)) (< ~SIZE~0 0)) (<= (+ (* 8 main_~i~0) |main_~#a~0.offset|) (+ (* 8 (div ~SIZE~0 2)) 7)) (= 0 (select (select |#memory_int| |main_~#a~0.base|) 0))) (= |main_~#a~0.offset| 0))} assume !(~i~0 <= (if ~SIZE~0 < 0 && ~SIZE~0 % 2 != 0 then ~SIZE~0 / 2 + 1 else ~SIZE~0 / 2)); {356#(and (= |main_~#a~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#a~0.base|) 0)))} is VALID [2018-11-14 17:04:15,826 INFO L273 TraceCheckUtils]: 16: Hoare triple {356#(and (= |main_~#a~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#a~0.base|) 0)))} ~i~0 := 0; {357#(and (= 0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 17:04:15,827 INFO L273 TraceCheckUtils]: 17: Hoare triple {357#(and (= 0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume true; {357#(and (= 0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 17:04:15,830 INFO L273 TraceCheckUtils]: 18: Hoare triple {357#(and (= 0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {358#(and (= |main_#t~mem6| 0) (= main_~i~0 0))} is VALID [2018-11-14 17:04:15,831 INFO L256 TraceCheckUtils]: 19: Hoare triple {358#(and (= |main_#t~mem6| 0) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem6 <= ~i~0 then 1 else 0)); {359#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:04:15,832 INFO L273 TraceCheckUtils]: 20: Hoare triple {359#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {360#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-14 17:04:15,833 INFO L273 TraceCheckUtils]: 21: Hoare triple {360#(not (= __VERIFIER_assert_~cond 0))} assume ~cond == 0; {350#false} is VALID [2018-11-14 17:04:15,833 INFO L273 TraceCheckUtils]: 22: Hoare triple {350#false} assume !false; {350#false} is VALID [2018-11-14 17:04:15,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:04:15,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:04:15,838 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 17:04:15,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:04:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:04:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:04:15,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:04:16,287 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 11 treesize of output 8 [2018-11-14 17:04:16,294 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 8 treesize of output 7 [2018-11-14 17:04:16,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:04:16,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:16,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:16,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-14 17:04:16,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-14 17:04:16,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 3 [2018-11-14 17:04:16,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:04:16,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:16,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:04:16,495 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-14 17:04:16,506 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:04:16,596 INFO L256 TraceCheckUtils]: 0: Hoare triple {349#true} call ULTIMATE.init(); {349#true} is VALID [2018-11-14 17:04:16,596 INFO L273 TraceCheckUtils]: 1: Hoare triple {349#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {349#true} is VALID [2018-11-14 17:04:16,597 INFO L273 TraceCheckUtils]: 2: Hoare triple {349#true} assume true; {349#true} is VALID [2018-11-14 17:04:16,597 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {349#true} {349#true} #74#return; {349#true} is VALID [2018-11-14 17:04:16,597 INFO L256 TraceCheckUtils]: 4: Hoare triple {349#true} call #t~ret7 := main(); {349#true} is VALID [2018-11-14 17:04:16,598 INFO L273 TraceCheckUtils]: 5: Hoare triple {349#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {349#true} is VALID [2018-11-14 17:04:16,600 INFO L273 TraceCheckUtils]: 6: Hoare triple {349#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~SIZE~0 * 4); {382#(= |main_~#a~0.offset| 0)} is VALID [2018-11-14 17:04:16,601 INFO L273 TraceCheckUtils]: 7: Hoare triple {382#(= |main_~#a~0.offset| 0)} assume !((if ~SIZE~0 < 0 && ~SIZE~0 % 2 != 0 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) != 0);assume (if (if ~SIZE~0 < 0 && ~SIZE~0 % 2 != 0 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) == 0 then 1 else 0) != 0;~i~0 := 1; {353#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 17:04:16,603 INFO L273 TraceCheckUtils]: 8: Hoare triple {353#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume true; {353#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 17:04:16,604 INFO L273 TraceCheckUtils]: 9: Hoare triple {353#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && ~SIZE~0 % 2 != 0 then ~SIZE~0 / 2 + 1 else ~SIZE~0 / 2));call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + (2 * ~i~0 - 2) * 4, 4); {353#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 17:04:16,605 INFO L273 TraceCheckUtils]: 10: Hoare triple {353#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume #t~mem3 > ~i~0;havoc #t~mem3;call write~int(2 * ~i~0 - 2, ~#a~0.base, ~#a~0.offset + (2 * ~i~0 - 2) * 4, 4); {356#(and (= |main_~#a~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#a~0.base|) 0)))} is VALID [2018-11-14 17:04:16,607 INFO L273 TraceCheckUtils]: 11: Hoare triple {356#(and (= |main_~#a~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#a~0.base|) 0)))} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + (2 * ~i~0 - 1) * 4, 4); {356#(and (= |main_~#a~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#a~0.base|) 0)))} is VALID [2018-11-14 17:04:16,613 INFO L273 TraceCheckUtils]: 12: Hoare triple {356#(and (= |main_~#a~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#a~0.base|) 0)))} assume !(#t~mem4 > ~i~0);havoc #t~mem4; {356#(and (= |main_~#a~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#a~0.base|) 0)))} is VALID [2018-11-14 17:04:16,614 INFO L273 TraceCheckUtils]: 13: Hoare triple {356#(and (= |main_~#a~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#a~0.base|) 0)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {356#(and (= |main_~#a~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#a~0.base|) 0)))} is VALID [2018-11-14 17:04:16,615 INFO L273 TraceCheckUtils]: 14: Hoare triple {356#(and (= |main_~#a~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#a~0.base|) 0)))} assume true; {356#(and (= |main_~#a~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#a~0.base|) 0)))} is VALID [2018-11-14 17:04:16,615 INFO L273 TraceCheckUtils]: 15: Hoare triple {356#(and (= |main_~#a~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#a~0.base|) 0)))} assume !(~i~0 <= (if ~SIZE~0 < 0 && ~SIZE~0 % 2 != 0 then ~SIZE~0 / 2 + 1 else ~SIZE~0 / 2)); {356#(and (= |main_~#a~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#a~0.base|) 0)))} is VALID [2018-11-14 17:04:16,616 INFO L273 TraceCheckUtils]: 16: Hoare triple {356#(and (= |main_~#a~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#a~0.base|) 0)))} ~i~0 := 0; {357#(and (= 0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 17:04:16,617 INFO L273 TraceCheckUtils]: 17: Hoare triple {357#(and (= 0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume true; {357#(and (= 0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 17:04:16,619 INFO L273 TraceCheckUtils]: 18: Hoare triple {357#(and (= 0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {419#(and (<= |main_#t~mem6| 0) (= main_~i~0 0))} is VALID [2018-11-14 17:04:16,628 INFO L256 TraceCheckUtils]: 19: Hoare triple {419#(and (<= |main_#t~mem6| 0) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem6 <= ~i~0 then 1 else 0)); {423#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:04:16,629 INFO L273 TraceCheckUtils]: 20: Hoare triple {423#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {427#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:04:16,629 INFO L273 TraceCheckUtils]: 21: Hoare triple {427#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {350#false} is VALID [2018-11-14 17:04:16,630 INFO L273 TraceCheckUtils]: 22: Hoare triple {350#false} assume !false; {350#false} is VALID [2018-11-14 17:04:16,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:04:16,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:04:16,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2018-11-14 17:04:16,665 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-11-14 17:04:16,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:04:16,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 17:04:16,839 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:04:16,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 17:04:16,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 17:04:16,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-11-14 17:04:16,840 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 16 states. [2018-11-14 17:04:18,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:18,569 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2018-11-14 17:04:18,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 17:04:18,569 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-11-14 17:04:18,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:04:18,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 17:04:18,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 80 transitions. [2018-11-14 17:04:18,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 17:04:18,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 80 transitions. [2018-11-14 17:04:18,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 80 transitions. [2018-11-14 17:04:18,704 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:04:18,708 INFO L225 Difference]: With dead ends: 68 [2018-11-14 17:04:18,708 INFO L226 Difference]: Without dead ends: 66 [2018-11-14 17:04:18,709 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2018-11-14 17:04:18,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-14 17:04:18,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 43. [2018-11-14 17:04:18,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:04:18,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 43 states. [2018-11-14 17:04:18,793 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 43 states. [2018-11-14 17:04:18,794 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 43 states. [2018-11-14 17:04:18,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:18,801 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2018-11-14 17:04:18,801 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2018-11-14 17:04:18,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:04:18,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:04:18,802 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 66 states. [2018-11-14 17:04:18,803 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 66 states. [2018-11-14 17:04:18,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:04:18,808 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2018-11-14 17:04:18,808 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2018-11-14 17:04:18,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:04:18,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:04:18,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:04:18,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:04:18,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-14 17:04:18,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2018-11-14 17:04:18,813 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 23 [2018-11-14 17:04:18,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:04:18,813 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2018-11-14 17:04:18,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 17:04:18,813 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2018-11-14 17:04:18,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 17:04:18,814 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:04:18,815 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 17:04:18,815 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:04:18,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:04:18,815 INFO L82 PathProgramCache]: Analyzing trace with hash 2010385300, now seen corresponding path program 1 times [2018-11-14 17:04:18,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:04:18,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:04:18,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:04:18,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:04:18,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:04:18,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 17:04:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 17:04:18,878 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-14 17:04:18,921 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-14 17:04:18,921 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 17:04:18,921 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 17:04:18,922 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-14 17:04:18,922 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2018-11-14 17:04:18,922 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 17:04:18,922 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 17:04:18,922 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 17:04:18,922 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-14 17:04:18,922 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-14 17:04:18,923 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 17:04:18,923 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 17:04:18,923 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 17:04:18,923 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 17:04:18,923 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-14 17:04:18,923 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-14 17:04:18,923 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2018-11-14 17:04:18,924 WARN L170 areAnnotationChecker]: L5-1 has no Hoare annotation [2018-11-14 17:04:18,924 WARN L170 areAnnotationChecker]: L5-1 has no Hoare annotation [2018-11-14 17:04:18,924 WARN L170 areAnnotationChecker]: L5-3 has no Hoare annotation [2018-11-14 17:04:18,924 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 17:04:18,924 WARN L170 areAnnotationChecker]: L21-4 has no Hoare annotation [2018-11-14 17:04:18,924 WARN L170 areAnnotationChecker]: L21-4 has no Hoare annotation [2018-11-14 17:04:18,924 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 17:04:18,925 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 17:04:18,925 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2018-11-14 17:04:18,925 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2018-11-14 17:04:18,925 WARN L170 areAnnotationChecker]: L21-5 has no Hoare annotation [2018-11-14 17:04:18,925 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2018-11-14 17:04:18,925 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2018-11-14 17:04:18,925 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2018-11-14 17:04:18,925 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2018-11-14 17:04:18,925 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2018-11-14 17:04:18,926 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2018-11-14 17:04:18,926 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2018-11-14 17:04:18,926 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2018-11-14 17:04:18,926 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2018-11-14 17:04:18,926 WARN L170 areAnnotationChecker]: L33-5 has no Hoare annotation [2018-11-14 17:04:18,926 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2018-11-14 17:04:18,926 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2018-11-14 17:04:18,926 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-14 17:04:18,926 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-14 17:04:18,926 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2018-11-14 17:04:18,927 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 17:04:18,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 05:04:18 BoogieIcfgContainer [2018-11-14 17:04:18,929 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 17:04:18,931 INFO L168 Benchmark]: Toolchain (without parser) took 7653.38 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 712.0 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -326.5 MB). Peak memory consumption was 385.5 MB. Max. memory is 7.1 GB. [2018-11-14 17:04:18,933 INFO L168 Benchmark]: CDTParser took 0.20 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 17:04:18,933 INFO L168 Benchmark]: CACSL2BoogieTranslator took 390.92 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 17:04:18,934 INFO L168 Benchmark]: Boogie Preprocessor took 64.27 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 17:04:18,935 INFO L168 Benchmark]: RCFGBuilder took 845.60 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 712.0 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -742.4 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. [2018-11-14 17:04:18,936 INFO L168 Benchmark]: TraceAbstraction took 6347.67 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 405.3 MB). Peak memory consumption was 405.3 MB. Max. memory is 7.1 GB. [2018-11-14 17:04:18,939 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.20 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. * CACSL2BoogieTranslator took 390.92 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 64.27 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 845.60 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 712.0 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -742.4 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6347.67 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 405.3 MB). Peak memory consumption was 405.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L8] int SIZE; VAL [\old(SIZE)=10, SIZE=0] [L12] SIZE = __VERIFIER_nondet_int() [L13] COND TRUE SIZE > 1 [L15] int i; [L16] FCALL int a[SIZE]; VAL [\old(SIZE)=0, a={11:0}, SIZE=2] [L18] COND FALSE !(SIZE % 2 != 0) [L21] i = 1 VAL [\old(SIZE)=0, a={11:0}, i=1, SIZE=2] [L21] COND TRUE i <= SIZE/2 [L23] EXPR, FCALL a[2*i-2] VAL [\old(SIZE)=0, a={11:0}, a[2*i-2]=1, i=1, SIZE=2] [L23] COND FALSE !(a[2*i-2] > i) [L27] EXPR, FCALL a[2*i-1] VAL [\old(SIZE)=0, a={11:0}, a[2*i-1]=0, i=1, SIZE=2] [L27] COND FALSE !(a[2*i-1] > i) [L21] i++ VAL [\old(SIZE)=0, a={11:0}, i=2, SIZE=2] [L21] COND FALSE !(i <= SIZE/2) VAL [\old(SIZE)=0, a={11:0}, i=2, SIZE=2] [L33] i = 0 VAL [\old(SIZE)=0, a={11:0}, i=0, SIZE=2] [L33] COND TRUE i < SIZE [L35] EXPR, FCALL a[i] VAL [\old(SIZE)=0, a={11:0}, a[i]=1, i=0, SIZE=2] [L35] CALL __VERIFIER_assert( a[i] <= i ) VAL [\old(cond)=0, \old(SIZE)=0, SIZE=2] [L5] COND TRUE !(cond) VAL [\old(cond)=0, \old(SIZE)=0, cond=0, SIZE=2] [L5] __VERIFIER_error() VAL [\old(cond)=0, \old(SIZE)=0, cond=0, SIZE=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 32 locations, 1 error locations. UNSAFE Result, 6.2s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 3.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 80 SDtfs, 140 SDslu, 128 SDs, 0 SdLazy, 191 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 3 MinimizatonAttempts, 27 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 9949 SizeOfPredicates, 7 NumberOfNonLiveVariables, 82 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 0/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...