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/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-tiling/nr4_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:19:30,756 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:19:30,758 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:19:30,770 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:19:30,770 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:19:30,771 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:19:30,772 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:19:30,774 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:19:30,776 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:19:30,777 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:19:30,778 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:19:30,778 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:19:30,779 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:19:30,780 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:19:30,781 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:19:30,782 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:19:30,783 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:19:30,787 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:19:30,792 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:19:30,794 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:19:30,795 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:19:30,796 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:19:30,798 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:19:30,799 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:19:30,799 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:19:30,800 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:19:30,801 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:19:30,801 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:19:30,802 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:19:30,803 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:19:30,803 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:19:30,804 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:19:30,804 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:19:30,805 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:19:30,805 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:19:30,806 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:19:30,806 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-23 12:19:30,821 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:19:30,821 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:19:30,822 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:19:30,822 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:19:30,823 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:19:30,823 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:19:30,823 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:19:30,824 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:19:30,824 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:19:30,824 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:19:30,824 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:19:30,824 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:19:30,825 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:19:30,825 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:19:30,825 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:19:30,825 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:19:30,825 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:19:30,825 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:19:30,826 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:19:30,826 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:19:30,826 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:19:30,826 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:19:30,826 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:19:30,827 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:19:30,827 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:19:30,827 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:19:30,827 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:19:30,827 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:19:30,828 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:19:30,828 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:19:30,828 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:19:30,892 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:19:30,907 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:19:30,912 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:19:30,914 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:19:30,914 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:19:30,915 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/nr4_true-unreach-call.i [2018-11-23 12:19:30,979 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c416019d8/20e32401088243b59acb7569d78f88db/FLAG84df22ea4 [2018-11-23 12:19:31,424 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:19:31,425 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/nr4_true-unreach-call.i [2018-11-23 12:19:31,431 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c416019d8/20e32401088243b59acb7569d78f88db/FLAG84df22ea4 [2018-11-23 12:19:31,790 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c416019d8/20e32401088243b59acb7569d78f88db [2018-11-23 12:19:31,802 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:19:31,803 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:19:31,804 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:19:31,804 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:19:31,808 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:19:31,810 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:19:31" (1/1) ... [2018-11-23 12:19:31,813 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@316ae71d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:31, skipping insertion in model container [2018-11-23 12:19:31,813 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:19:31" (1/1) ... [2018-11-23 12:19:31,823 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:19:31,848 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:19:32,112 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:19:32,120 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:19:32,147 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:19:32,172 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:19:32,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:32 WrapperNode [2018-11-23 12:19:32,173 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:19:32,174 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:19:32,174 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:19:32,174 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:19:32,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:32" (1/1) ... [2018-11-23 12:19:32,190 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:32" (1/1) ... [2018-11-23 12:19:32,197 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:19:32,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:19:32,198 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:19:32,198 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:19:32,206 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:32" (1/1) ... [2018-11-23 12:19:32,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:32" (1/1) ... [2018-11-23 12:19:32,208 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:32" (1/1) ... [2018-11-23 12:19:32,208 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:32" (1/1) ... [2018-11-23 12:19:32,224 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:32" (1/1) ... [2018-11-23 12:19:32,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:32" (1/1) ... [2018-11-23 12:19:32,235 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:32" (1/1) ... [2018-11-23 12:19:32,237 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:19:32,238 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:19:32,238 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:19:32,238 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:19:32,239 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:32" (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-23 12:19:32,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:19:32,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:19:32,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:19:32,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:19:32,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:19:32,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:19:32,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:19:32,379 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:19:32,379 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:19:32,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:19:32,379 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:19:32,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:19:33,023 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:19:33,024 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:19:33,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:19:33 BoogieIcfgContainer [2018-11-23 12:19:33,024 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:19:33,025 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:19:33,026 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:19:33,029 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:19:33,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:19:31" (1/3) ... [2018-11-23 12:19:33,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d2dcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:19:33, skipping insertion in model container [2018-11-23 12:19:33,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:32" (2/3) ... [2018-11-23 12:19:33,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d2dcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:19:33, skipping insertion in model container [2018-11-23 12:19:33,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:19:33" (3/3) ... [2018-11-23 12:19:33,033 INFO L112 eAbstractionObserver]: Analyzing ICFG nr4_true-unreach-call.i [2018-11-23 12:19:33,042 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:19:33,050 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:19:33,067 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:19:33,100 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:19:33,101 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:19:33,101 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:19:33,101 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:19:33,103 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:19:33,103 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:19:33,103 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:19:33,103 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:19:33,104 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:19:33,123 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-23 12:19:33,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:19:33,130 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:33,131 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:19:33,133 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:33,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:33,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1453831941, now seen corresponding path program 1 times [2018-11-23 12:19:33,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:33,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:33,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:33,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:33,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:33,663 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-23 12:19:33,666 INFO L273 TraceCheckUtils]: 1: Hoare triple {34#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {34#true} is VALID [2018-11-23 12:19:33,667 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:19:33,667 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #83#return; {34#true} is VALID [2018-11-23 12:19:33,668 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret8 := main(); {34#true} is VALID [2018-11-23 12:19:33,668 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {34#true} is VALID [2018-11-23 12:19:33,668 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {34#true} is VALID [2018-11-23 12:19:33,669 INFO L273 TraceCheckUtils]: 7: Hoare triple {34#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {34#true} is VALID [2018-11-23 12:19:33,669 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#true} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {34#true} is VALID [2018-11-23 12:19:33,669 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#true} ~i~0 := 0; {34#true} is VALID [2018-11-23 12:19:33,670 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#true} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {34#true} is VALID [2018-11-23 12:19:33,677 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#true} assume #t~short7; {36#|main_#t~short7|} is VALID [2018-11-23 12:19:33,682 INFO L256 TraceCheckUtils]: 12: Hoare triple {36#|main_#t~short7|} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {37#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:19:33,683 INFO L273 TraceCheckUtils]: 13: Hoare triple {37#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {38#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 12:19:33,684 INFO L273 TraceCheckUtils]: 14: Hoare triple {38#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {35#false} is VALID [2018-11-23 12:19:33,685 INFO L273 TraceCheckUtils]: 15: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-23 12:19:33,688 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-23 12:19:33,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:19:33,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:19:33,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 12:19:33,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:33,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:19:33,917 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-23 12:19:33,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:19:33,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:19:33,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:19:33,931 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 5 states. [2018-11-23 12:19:34,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:34,523 INFO L93 Difference]: Finished difference Result 60 states and 81 transitions. [2018-11-23 12:19:34,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:19:34,523 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 12:19:34,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:19:34,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:19:34,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2018-11-23 12:19:34,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:19:34,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2018-11-23 12:19:34,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 81 transitions. [2018-11-23 12:19:35,142 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:35,154 INFO L225 Difference]: With dead ends: 60 [2018-11-23 12:19:35,154 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 12:19:35,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:19:35,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 12:19:35,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-23 12:19:35,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:19:35,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 30 states. [2018-11-23 12:19:35,219 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 30 states. [2018-11-23 12:19:35,219 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 30 states. [2018-11-23 12:19:35,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:35,223 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-23 12:19:35,223 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 12:19:35,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:35,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:35,224 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 31 states. [2018-11-23 12:19:35,225 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 31 states. [2018-11-23 12:19:35,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:35,229 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-23 12:19:35,229 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 12:19:35,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:35,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:35,230 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:19:35,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:19:35,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:19:35,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-11-23 12:19:35,235 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 16 [2018-11-23 12:19:35,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:19:35,236 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-23 12:19:35,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:19:35,236 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 12:19:35,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:19:35,237 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:35,238 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:19:35,238 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:35,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:35,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1455678983, now seen corresponding path program 1 times [2018-11-23 12:19:35,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:35,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:35,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:35,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:35,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:35,448 INFO L256 TraceCheckUtils]: 0: Hoare triple {222#true} call ULTIMATE.init(); {222#true} is VALID [2018-11-23 12:19:35,448 INFO L273 TraceCheckUtils]: 1: Hoare triple {222#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {222#true} is VALID [2018-11-23 12:19:35,449 INFO L273 TraceCheckUtils]: 2: Hoare triple {222#true} assume true; {222#true} is VALID [2018-11-23 12:19:35,449 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {222#true} {222#true} #83#return; {222#true} is VALID [2018-11-23 12:19:35,450 INFO L256 TraceCheckUtils]: 4: Hoare triple {222#true} call #t~ret8 := main(); {222#true} is VALID [2018-11-23 12:19:35,450 INFO L273 TraceCheckUtils]: 5: Hoare triple {222#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {222#true} is VALID [2018-11-23 12:19:35,467 INFO L273 TraceCheckUtils]: 6: Hoare triple {222#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {224#(<= 2 ~CELLCOUNT~0)} is VALID [2018-11-23 12:19:35,471 INFO L273 TraceCheckUtils]: 7: Hoare triple {224#(<= 2 ~CELLCOUNT~0)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {225#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} is VALID [2018-11-23 12:19:35,472 INFO L273 TraceCheckUtils]: 8: Hoare triple {225#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {223#false} is VALID [2018-11-23 12:19:35,472 INFO L273 TraceCheckUtils]: 9: Hoare triple {223#false} ~i~0 := 0; {223#false} is VALID [2018-11-23 12:19:35,472 INFO L273 TraceCheckUtils]: 10: Hoare triple {223#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {223#false} is VALID [2018-11-23 12:19:35,473 INFO L273 TraceCheckUtils]: 11: Hoare triple {223#false} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {223#false} is VALID [2018-11-23 12:19:35,473 INFO L256 TraceCheckUtils]: 12: Hoare triple {223#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {223#false} is VALID [2018-11-23 12:19:35,473 INFO L273 TraceCheckUtils]: 13: Hoare triple {223#false} ~cond := #in~cond; {223#false} is VALID [2018-11-23 12:19:35,474 INFO L273 TraceCheckUtils]: 14: Hoare triple {223#false} assume 0 == ~cond; {223#false} is VALID [2018-11-23 12:19:35,474 INFO L273 TraceCheckUtils]: 15: Hoare triple {223#false} assume !false; {223#false} is VALID [2018-11-23 12:19:35,475 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-23 12:19:35,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:19:35,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:19:35,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-23 12:19:35,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:35,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:19:35,500 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-23 12:19:35,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:19:35,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:19:35,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:19:35,502 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 4 states. [2018-11-23 12:19:35,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:35,718 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-23 12:19:35,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:19:35,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-23 12:19:35,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:19:35,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:19:35,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2018-11-23 12:19:35,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:19:35,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2018-11-23 12:19:35,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2018-11-23 12:19:35,843 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-23 12:19:35,845 INFO L225 Difference]: With dead ends: 52 [2018-11-23 12:19:35,846 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 12:19:35,847 INFO L631 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-23 12:19:35,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 12:19:35,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2018-11-23 12:19:35,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:19:35,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 31 states. [2018-11-23 12:19:35,891 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 31 states. [2018-11-23 12:19:35,891 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 31 states. [2018-11-23 12:19:35,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:35,894 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-11-23 12:19:35,894 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-23 12:19:35,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:35,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:35,895 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 35 states. [2018-11-23 12:19:35,895 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 35 states. [2018-11-23 12:19:35,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:35,898 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-11-23 12:19:35,898 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-23 12:19:35,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:35,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:35,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:19:35,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:19:35,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:19:35,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-23 12:19:35,902 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 16 [2018-11-23 12:19:35,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:19:35,902 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-23 12:19:35,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:19:35,902 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 12:19:35,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:19:35,903 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:35,904 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:19:35,904 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:35,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:35,904 INFO L82 PathProgramCache]: Analyzing trace with hash -2089835012, now seen corresponding path program 1 times [2018-11-23 12:19:35,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:35,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:35,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:35,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:35,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:35,981 INFO L256 TraceCheckUtils]: 0: Hoare triple {411#true} call ULTIMATE.init(); {411#true} is VALID [2018-11-23 12:19:35,981 INFO L273 TraceCheckUtils]: 1: Hoare triple {411#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {411#true} is VALID [2018-11-23 12:19:35,982 INFO L273 TraceCheckUtils]: 2: Hoare triple {411#true} assume true; {411#true} is VALID [2018-11-23 12:19:35,982 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {411#true} {411#true} #83#return; {411#true} is VALID [2018-11-23 12:19:35,982 INFO L256 TraceCheckUtils]: 4: Hoare triple {411#true} call #t~ret8 := main(); {411#true} is VALID [2018-11-23 12:19:35,982 INFO L273 TraceCheckUtils]: 5: Hoare triple {411#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {411#true} is VALID [2018-11-23 12:19:35,983 INFO L273 TraceCheckUtils]: 6: Hoare triple {411#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {411#true} is VALID [2018-11-23 12:19:35,983 INFO L273 TraceCheckUtils]: 7: Hoare triple {411#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {411#true} is VALID [2018-11-23 12:19:35,987 INFO L273 TraceCheckUtils]: 8: Hoare triple {411#true} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4));~j~0 := 4; {413#(<= 4 main_~j~0)} is VALID [2018-11-23 12:19:35,987 INFO L273 TraceCheckUtils]: 9: Hoare triple {413#(<= 4 main_~j~0)} assume !(~j~0 >= 1); {412#false} is VALID [2018-11-23 12:19:35,988 INFO L273 TraceCheckUtils]: 10: Hoare triple {412#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {412#false} is VALID [2018-11-23 12:19:35,988 INFO L273 TraceCheckUtils]: 11: Hoare triple {412#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {412#false} is VALID [2018-11-23 12:19:35,988 INFO L273 TraceCheckUtils]: 12: Hoare triple {412#false} ~i~0 := 0; {412#false} is VALID [2018-11-23 12:19:35,989 INFO L273 TraceCheckUtils]: 13: Hoare triple {412#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {412#false} is VALID [2018-11-23 12:19:35,989 INFO L273 TraceCheckUtils]: 14: Hoare triple {412#false} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {412#false} is VALID [2018-11-23 12:19:35,989 INFO L256 TraceCheckUtils]: 15: Hoare triple {412#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {412#false} is VALID [2018-11-23 12:19:35,990 INFO L273 TraceCheckUtils]: 16: Hoare triple {412#false} ~cond := #in~cond; {412#false} is VALID [2018-11-23 12:19:35,990 INFO L273 TraceCheckUtils]: 17: Hoare triple {412#false} assume 0 == ~cond; {412#false} is VALID [2018-11-23 12:19:35,991 INFO L273 TraceCheckUtils]: 18: Hoare triple {412#false} assume !false; {412#false} is VALID [2018-11-23 12:19:35,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:19:35,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:19:35,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:19:35,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:19:35,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:35,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:19:36,018 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:36,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:19:36,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:19:36,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:19:36,020 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 3 states. [2018-11-23 12:19:36,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:36,161 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-11-23 12:19:36,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:19:36,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:19:36,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:19:36,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:19:36,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:19:36,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:19:36,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:19:36,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2018-11-23 12:19:36,302 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-23 12:19:36,305 INFO L225 Difference]: With dead ends: 56 [2018-11-23 12:19:36,305 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:19:36,306 INFO L631 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-23 12:19:36,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:19:36,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-23 12:19:36,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:19:36,331 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2018-11-23 12:19:36,331 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2018-11-23 12:19:36,332 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2018-11-23 12:19:36,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:36,336 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-23 12:19:36,336 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-23 12:19:36,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:36,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:36,338 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2018-11-23 12:19:36,338 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2018-11-23 12:19:36,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:36,344 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-23 12:19:36,345 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-23 12:19:36,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:36,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:36,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:19:36,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:19:36,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:19:36,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-11-23 12:19:36,354 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2018-11-23 12:19:36,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:19:36,354 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-23 12:19:36,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:19:36,355 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:19:36,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:19:36,356 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:36,356 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:19:36,357 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:36,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:36,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1382648830, now seen corresponding path program 1 times [2018-11-23 12:19:36,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:36,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:36,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:36,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:36,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:36,489 INFO L256 TraceCheckUtils]: 0: Hoare triple {605#true} call ULTIMATE.init(); {605#true} is VALID [2018-11-23 12:19:36,489 INFO L273 TraceCheckUtils]: 1: Hoare triple {605#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {605#true} is VALID [2018-11-23 12:19:36,489 INFO L273 TraceCheckUtils]: 2: Hoare triple {605#true} assume true; {605#true} is VALID [2018-11-23 12:19:36,490 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {605#true} {605#true} #83#return; {605#true} is VALID [2018-11-23 12:19:36,490 INFO L256 TraceCheckUtils]: 4: Hoare triple {605#true} call #t~ret8 := main(); {605#true} is VALID [2018-11-23 12:19:36,490 INFO L273 TraceCheckUtils]: 5: Hoare triple {605#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {605#true} is VALID [2018-11-23 12:19:36,491 INFO L273 TraceCheckUtils]: 6: Hoare triple {605#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {607#(<= main_~MINVAL~0 2)} is VALID [2018-11-23 12:19:36,492 INFO L273 TraceCheckUtils]: 7: Hoare triple {607#(<= main_~MINVAL~0 2)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {607#(<= main_~MINVAL~0 2)} is VALID [2018-11-23 12:19:36,492 INFO L273 TraceCheckUtils]: 8: Hoare triple {607#(<= main_~MINVAL~0 2)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4));~j~0 := 4; {608#(<= (+ main_~MINVAL~0 2) main_~j~0)} is VALID [2018-11-23 12:19:36,495 INFO L273 TraceCheckUtils]: 9: Hoare triple {608#(<= (+ main_~MINVAL~0 2) main_~j~0)} assume !!(~j~0 >= 1); {608#(<= (+ main_~MINVAL~0 2) main_~j~0)} is VALID [2018-11-23 12:19:36,496 INFO L273 TraceCheckUtils]: 10: Hoare triple {608#(<= (+ main_~MINVAL~0 2) main_~j~0)} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - ~j~0), 4); {606#false} is VALID [2018-11-23 12:19:36,497 INFO L273 TraceCheckUtils]: 11: Hoare triple {606#false} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {606#false} is VALID [2018-11-23 12:19:36,497 INFO L273 TraceCheckUtils]: 12: Hoare triple {606#false} assume !(~j~0 >= 1); {606#false} is VALID [2018-11-23 12:19:36,497 INFO L273 TraceCheckUtils]: 13: Hoare triple {606#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {606#false} is VALID [2018-11-23 12:19:36,498 INFO L273 TraceCheckUtils]: 14: Hoare triple {606#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {606#false} is VALID [2018-11-23 12:19:36,498 INFO L273 TraceCheckUtils]: 15: Hoare triple {606#false} ~i~0 := 0; {606#false} is VALID [2018-11-23 12:19:36,498 INFO L273 TraceCheckUtils]: 16: Hoare triple {606#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {606#false} is VALID [2018-11-23 12:19:36,498 INFO L273 TraceCheckUtils]: 17: Hoare triple {606#false} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {606#false} is VALID [2018-11-23 12:19:36,499 INFO L256 TraceCheckUtils]: 18: Hoare triple {606#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {606#false} is VALID [2018-11-23 12:19:36,499 INFO L273 TraceCheckUtils]: 19: Hoare triple {606#false} ~cond := #in~cond; {606#false} is VALID [2018-11-23 12:19:36,499 INFO L273 TraceCheckUtils]: 20: Hoare triple {606#false} assume 0 == ~cond; {606#false} is VALID [2018-11-23 12:19:36,500 INFO L273 TraceCheckUtils]: 21: Hoare triple {606#false} assume !false; {606#false} is VALID [2018-11-23 12:19:36,501 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-23 12:19:36,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:19:36,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:19:36,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-23 12:19:36,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:36,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:19:36,562 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:36,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:19:36,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:19:36,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:19:36,563 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 4 states. [2018-11-23 12:19:36,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:36,732 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2018-11-23 12:19:36,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:19:36,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-23 12:19:36,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:19:36,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:19:36,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2018-11-23 12:19:36,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:19:36,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2018-11-23 12:19:36,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 54 transitions. [2018-11-23 12:19:36,838 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:36,840 INFO L225 Difference]: With dead ends: 57 [2018-11-23 12:19:36,840 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:19:36,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:19:36,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:19:36,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 12:19:36,895 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:19:36,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-23 12:19:36,895 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-23 12:19:36,895 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-23 12:19:36,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:36,897 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:19:36,897 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:19:36,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:36,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:36,898 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-23 12:19:36,898 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-23 12:19:36,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:36,901 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:19:36,901 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:19:36,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:36,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:36,902 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:19:36,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:19:36,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:19:36,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 12:19:36,904 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 22 [2018-11-23 12:19:36,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:19:36,904 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 12:19:36,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:19:36,905 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 12:19:36,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:19:36,906 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:36,906 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:19:36,906 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:36,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:36,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1124483392, now seen corresponding path program 1 times [2018-11-23 12:19:36,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:36,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:36,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:36,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:36,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:37,022 INFO L256 TraceCheckUtils]: 0: Hoare triple {805#true} call ULTIMATE.init(); {805#true} is VALID [2018-11-23 12:19:37,023 INFO L273 TraceCheckUtils]: 1: Hoare triple {805#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {805#true} is VALID [2018-11-23 12:19:37,023 INFO L273 TraceCheckUtils]: 2: Hoare triple {805#true} assume true; {805#true} is VALID [2018-11-23 12:19:37,023 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {805#true} {805#true} #83#return; {805#true} is VALID [2018-11-23 12:19:37,023 INFO L256 TraceCheckUtils]: 4: Hoare triple {805#true} call #t~ret8 := main(); {805#true} is VALID [2018-11-23 12:19:37,024 INFO L273 TraceCheckUtils]: 5: Hoare triple {805#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {805#true} is VALID [2018-11-23 12:19:37,024 INFO L273 TraceCheckUtils]: 6: Hoare triple {805#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {805#true} is VALID [2018-11-23 12:19:37,024 INFO L273 TraceCheckUtils]: 7: Hoare triple {805#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {805#true} is VALID [2018-11-23 12:19:37,027 INFO L273 TraceCheckUtils]: 8: Hoare triple {805#true} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4));~j~0 := 4; {807#(<= 4 main_~j~0)} is VALID [2018-11-23 12:19:37,027 INFO L273 TraceCheckUtils]: 9: Hoare triple {807#(<= 4 main_~j~0)} assume !!(~j~0 >= 1); {807#(<= 4 main_~j~0)} is VALID [2018-11-23 12:19:37,031 INFO L273 TraceCheckUtils]: 10: Hoare triple {807#(<= 4 main_~j~0)} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - ~j~0), 4); {807#(<= 4 main_~j~0)} is VALID [2018-11-23 12:19:37,034 INFO L273 TraceCheckUtils]: 11: Hoare triple {807#(<= 4 main_~j~0)} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {808#(<= 3 main_~j~0)} is VALID [2018-11-23 12:19:37,034 INFO L273 TraceCheckUtils]: 12: Hoare triple {808#(<= 3 main_~j~0)} assume !(~j~0 >= 1); {806#false} is VALID [2018-11-23 12:19:37,035 INFO L273 TraceCheckUtils]: 13: Hoare triple {806#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {806#false} is VALID [2018-11-23 12:19:37,035 INFO L273 TraceCheckUtils]: 14: Hoare triple {806#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {806#false} is VALID [2018-11-23 12:19:37,035 INFO L273 TraceCheckUtils]: 15: Hoare triple {806#false} ~i~0 := 0; {806#false} is VALID [2018-11-23 12:19:37,036 INFO L273 TraceCheckUtils]: 16: Hoare triple {806#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {806#false} is VALID [2018-11-23 12:19:37,036 INFO L273 TraceCheckUtils]: 17: Hoare triple {806#false} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {806#false} is VALID [2018-11-23 12:19:37,036 INFO L256 TraceCheckUtils]: 18: Hoare triple {806#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {806#false} is VALID [2018-11-23 12:19:37,037 INFO L273 TraceCheckUtils]: 19: Hoare triple {806#false} ~cond := #in~cond; {806#false} is VALID [2018-11-23 12:19:37,037 INFO L273 TraceCheckUtils]: 20: Hoare triple {806#false} assume 0 == ~cond; {806#false} is VALID [2018-11-23 12:19:37,037 INFO L273 TraceCheckUtils]: 21: Hoare triple {806#false} assume !false; {806#false} is VALID [2018-11-23 12:19:37,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:19:37,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:19:37,039 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-23 12:19:37,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:37,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:37,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:37,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:19:37,360 INFO L256 TraceCheckUtils]: 0: Hoare triple {805#true} call ULTIMATE.init(); {805#true} is VALID [2018-11-23 12:19:37,360 INFO L273 TraceCheckUtils]: 1: Hoare triple {805#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {805#true} is VALID [2018-11-23 12:19:37,360 INFO L273 TraceCheckUtils]: 2: Hoare triple {805#true} assume true; {805#true} is VALID [2018-11-23 12:19:37,361 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {805#true} {805#true} #83#return; {805#true} is VALID [2018-11-23 12:19:37,361 INFO L256 TraceCheckUtils]: 4: Hoare triple {805#true} call #t~ret8 := main(); {805#true} is VALID [2018-11-23 12:19:37,361 INFO L273 TraceCheckUtils]: 5: Hoare triple {805#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {805#true} is VALID [2018-11-23 12:19:37,361 INFO L273 TraceCheckUtils]: 6: Hoare triple {805#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {805#true} is VALID [2018-11-23 12:19:37,362 INFO L273 TraceCheckUtils]: 7: Hoare triple {805#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {805#true} is VALID [2018-11-23 12:19:37,362 INFO L273 TraceCheckUtils]: 8: Hoare triple {805#true} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4));~j~0 := 4; {807#(<= 4 main_~j~0)} is VALID [2018-11-23 12:19:37,366 INFO L273 TraceCheckUtils]: 9: Hoare triple {807#(<= 4 main_~j~0)} assume !!(~j~0 >= 1); {807#(<= 4 main_~j~0)} is VALID [2018-11-23 12:19:37,369 INFO L273 TraceCheckUtils]: 10: Hoare triple {807#(<= 4 main_~j~0)} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - ~j~0), 4); {807#(<= 4 main_~j~0)} is VALID [2018-11-23 12:19:37,374 INFO L273 TraceCheckUtils]: 11: Hoare triple {807#(<= 4 main_~j~0)} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {808#(<= 3 main_~j~0)} is VALID [2018-11-23 12:19:37,374 INFO L273 TraceCheckUtils]: 12: Hoare triple {808#(<= 3 main_~j~0)} assume !(~j~0 >= 1); {806#false} is VALID [2018-11-23 12:19:37,375 INFO L273 TraceCheckUtils]: 13: Hoare triple {806#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {806#false} is VALID [2018-11-23 12:19:37,375 INFO L273 TraceCheckUtils]: 14: Hoare triple {806#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {806#false} is VALID [2018-11-23 12:19:37,375 INFO L273 TraceCheckUtils]: 15: Hoare triple {806#false} ~i~0 := 0; {806#false} is VALID [2018-11-23 12:19:37,375 INFO L273 TraceCheckUtils]: 16: Hoare triple {806#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {806#false} is VALID [2018-11-23 12:19:37,376 INFO L273 TraceCheckUtils]: 17: Hoare triple {806#false} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {806#false} is VALID [2018-11-23 12:19:37,376 INFO L256 TraceCheckUtils]: 18: Hoare triple {806#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {806#false} is VALID [2018-11-23 12:19:37,376 INFO L273 TraceCheckUtils]: 19: Hoare triple {806#false} ~cond := #in~cond; {806#false} is VALID [2018-11-23 12:19:37,376 INFO L273 TraceCheckUtils]: 20: Hoare triple {806#false} assume 0 == ~cond; {806#false} is VALID [2018-11-23 12:19:37,377 INFO L273 TraceCheckUtils]: 21: Hoare triple {806#false} assume !false; {806#false} is VALID [2018-11-23 12:19:37,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:19:37,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:19:37,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-23 12:19:37,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-23 12:19:37,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:37,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:19:37,434 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:37,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:19:37,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:19:37,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:19:37,435 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2018-11-23 12:19:37,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:37,795 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2018-11-23 12:19:37,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:19:37,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-23 12:19:37,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:19:37,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:19:37,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2018-11-23 12:19:37,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:19:37,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2018-11-23 12:19:37,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 58 transitions. [2018-11-23 12:19:38,003 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:38,005 INFO L225 Difference]: With dead ends: 61 [2018-11-23 12:19:38,005 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 12:19:38,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 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-23 12:19:38,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 12:19:38,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-11-23 12:19:38,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:19:38,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 35 states. [2018-11-23 12:19:38,072 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 35 states. [2018-11-23 12:19:38,073 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 35 states. [2018-11-23 12:19:38,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:38,074 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-23 12:19:38,075 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-23 12:19:38,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:38,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:38,075 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 37 states. [2018-11-23 12:19:38,076 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 37 states. [2018-11-23 12:19:38,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:38,078 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-23 12:19:38,078 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-23 12:19:38,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:38,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:38,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:19:38,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:19:38,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:19:38,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-23 12:19:38,081 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 22 [2018-11-23 12:19:38,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:19:38,081 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-23 12:19:38,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:19:38,082 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 12:19:38,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:19:38,083 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:38,083 INFO L402 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] [2018-11-23 12:19:38,083 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:38,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:38,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1448609222, now seen corresponding path program 1 times [2018-11-23 12:19:38,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:38,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:38,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:38,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:38,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:38,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:38,183 INFO L256 TraceCheckUtils]: 0: Hoare triple {1080#true} call ULTIMATE.init(); {1080#true} is VALID [2018-11-23 12:19:38,184 INFO L273 TraceCheckUtils]: 1: Hoare triple {1080#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {1080#true} is VALID [2018-11-23 12:19:38,184 INFO L273 TraceCheckUtils]: 2: Hoare triple {1080#true} assume true; {1080#true} is VALID [2018-11-23 12:19:38,185 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1080#true} {1080#true} #83#return; {1080#true} is VALID [2018-11-23 12:19:38,185 INFO L256 TraceCheckUtils]: 4: Hoare triple {1080#true} call #t~ret8 := main(); {1080#true} is VALID [2018-11-23 12:19:38,185 INFO L273 TraceCheckUtils]: 5: Hoare triple {1080#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {1080#true} is VALID [2018-11-23 12:19:38,185 INFO L273 TraceCheckUtils]: 6: Hoare triple {1080#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {1080#true} is VALID [2018-11-23 12:19:38,186 INFO L273 TraceCheckUtils]: 7: Hoare triple {1080#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {1080#true} is VALID [2018-11-23 12:19:38,199 INFO L273 TraceCheckUtils]: 8: Hoare triple {1080#true} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4));~j~0 := 4; {1082#(<= 4 main_~j~0)} is VALID [2018-11-23 12:19:38,200 INFO L273 TraceCheckUtils]: 9: Hoare triple {1082#(<= 4 main_~j~0)} assume !!(~j~0 >= 1); {1082#(<= 4 main_~j~0)} is VALID [2018-11-23 12:19:38,201 INFO L273 TraceCheckUtils]: 10: Hoare triple {1082#(<= 4 main_~j~0)} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - ~j~0), 4); {1082#(<= 4 main_~j~0)} is VALID [2018-11-23 12:19:38,204 INFO L273 TraceCheckUtils]: 11: Hoare triple {1082#(<= 4 main_~j~0)} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1083#(<= 3 main_~j~0)} is VALID [2018-11-23 12:19:38,205 INFO L273 TraceCheckUtils]: 12: Hoare triple {1083#(<= 3 main_~j~0)} assume !!(~j~0 >= 1); {1083#(<= 3 main_~j~0)} is VALID [2018-11-23 12:19:38,205 INFO L273 TraceCheckUtils]: 13: Hoare triple {1083#(<= 3 main_~j~0)} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - ~j~0), 4); {1083#(<= 3 main_~j~0)} is VALID [2018-11-23 12:19:38,207 INFO L273 TraceCheckUtils]: 14: Hoare triple {1083#(<= 3 main_~j~0)} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1084#(<= 2 main_~j~0)} is VALID [2018-11-23 12:19:38,208 INFO L273 TraceCheckUtils]: 15: Hoare triple {1084#(<= 2 main_~j~0)} assume !(~j~0 >= 1); {1081#false} is VALID [2018-11-23 12:19:38,208 INFO L273 TraceCheckUtils]: 16: Hoare triple {1081#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1081#false} is VALID [2018-11-23 12:19:38,208 INFO L273 TraceCheckUtils]: 17: Hoare triple {1081#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {1081#false} is VALID [2018-11-23 12:19:38,209 INFO L273 TraceCheckUtils]: 18: Hoare triple {1081#false} ~i~0 := 0; {1081#false} is VALID [2018-11-23 12:19:38,209 INFO L273 TraceCheckUtils]: 19: Hoare triple {1081#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {1081#false} is VALID [2018-11-23 12:19:38,209 INFO L273 TraceCheckUtils]: 20: Hoare triple {1081#false} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {1081#false} is VALID [2018-11-23 12:19:38,210 INFO L256 TraceCheckUtils]: 21: Hoare triple {1081#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {1081#false} is VALID [2018-11-23 12:19:38,210 INFO L273 TraceCheckUtils]: 22: Hoare triple {1081#false} ~cond := #in~cond; {1081#false} is VALID [2018-11-23 12:19:38,210 INFO L273 TraceCheckUtils]: 23: Hoare triple {1081#false} assume 0 == ~cond; {1081#false} is VALID [2018-11-23 12:19:38,211 INFO L273 TraceCheckUtils]: 24: Hoare triple {1081#false} assume !false; {1081#false} is VALID [2018-11-23 12:19:38,212 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:19:38,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:19:38,212 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-23 12:19:38,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:38,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:38,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:19:38,396 INFO L256 TraceCheckUtils]: 0: Hoare triple {1080#true} call ULTIMATE.init(); {1080#true} is VALID [2018-11-23 12:19:38,397 INFO L273 TraceCheckUtils]: 1: Hoare triple {1080#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {1080#true} is VALID [2018-11-23 12:19:38,397 INFO L273 TraceCheckUtils]: 2: Hoare triple {1080#true} assume true; {1080#true} is VALID [2018-11-23 12:19:38,397 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1080#true} {1080#true} #83#return; {1080#true} is VALID [2018-11-23 12:19:38,398 INFO L256 TraceCheckUtils]: 4: Hoare triple {1080#true} call #t~ret8 := main(); {1080#true} is VALID [2018-11-23 12:19:38,398 INFO L273 TraceCheckUtils]: 5: Hoare triple {1080#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {1080#true} is VALID [2018-11-23 12:19:38,399 INFO L273 TraceCheckUtils]: 6: Hoare triple {1080#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {1106#(<= main_~MINVAL~0 2)} is VALID [2018-11-23 12:19:38,400 INFO L273 TraceCheckUtils]: 7: Hoare triple {1106#(<= main_~MINVAL~0 2)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {1106#(<= main_~MINVAL~0 2)} is VALID [2018-11-23 12:19:38,400 INFO L273 TraceCheckUtils]: 8: Hoare triple {1106#(<= main_~MINVAL~0 2)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4));~j~0 := 4; {1113#(and (<= 4 main_~j~0) (<= main_~MINVAL~0 2))} is VALID [2018-11-23 12:19:38,401 INFO L273 TraceCheckUtils]: 9: Hoare triple {1113#(and (<= 4 main_~j~0) (<= main_~MINVAL~0 2))} assume !!(~j~0 >= 1); {1113#(and (<= 4 main_~j~0) (<= main_~MINVAL~0 2))} is VALID [2018-11-23 12:19:38,402 INFO L273 TraceCheckUtils]: 10: Hoare triple {1113#(and (<= 4 main_~j~0) (<= main_~MINVAL~0 2))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - ~j~0), 4); {1113#(and (<= 4 main_~j~0) (<= main_~MINVAL~0 2))} is VALID [2018-11-23 12:19:38,403 INFO L273 TraceCheckUtils]: 11: Hoare triple {1113#(and (<= 4 main_~j~0) (<= main_~MINVAL~0 2))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1123#(and (<= main_~MINVAL~0 2) (<= 3 main_~j~0))} is VALID [2018-11-23 12:19:38,404 INFO L273 TraceCheckUtils]: 12: Hoare triple {1123#(and (<= main_~MINVAL~0 2) (<= 3 main_~j~0))} assume !!(~j~0 >= 1); {1123#(and (<= main_~MINVAL~0 2) (<= 3 main_~j~0))} is VALID [2018-11-23 12:19:38,405 INFO L273 TraceCheckUtils]: 13: Hoare triple {1123#(and (<= main_~MINVAL~0 2) (<= 3 main_~j~0))} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - ~j~0), 4); {1081#false} is VALID [2018-11-23 12:19:38,405 INFO L273 TraceCheckUtils]: 14: Hoare triple {1081#false} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1081#false} is VALID [2018-11-23 12:19:38,406 INFO L273 TraceCheckUtils]: 15: Hoare triple {1081#false} assume !(~j~0 >= 1); {1081#false} is VALID [2018-11-23 12:19:38,406 INFO L273 TraceCheckUtils]: 16: Hoare triple {1081#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1081#false} is VALID [2018-11-23 12:19:38,406 INFO L273 TraceCheckUtils]: 17: Hoare triple {1081#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {1081#false} is VALID [2018-11-23 12:19:38,407 INFO L273 TraceCheckUtils]: 18: Hoare triple {1081#false} ~i~0 := 0; {1081#false} is VALID [2018-11-23 12:19:38,407 INFO L273 TraceCheckUtils]: 19: Hoare triple {1081#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {1081#false} is VALID [2018-11-23 12:19:38,407 INFO L273 TraceCheckUtils]: 20: Hoare triple {1081#false} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {1081#false} is VALID [2018-11-23 12:19:38,408 INFO L256 TraceCheckUtils]: 21: Hoare triple {1081#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {1081#false} is VALID [2018-11-23 12:19:38,408 INFO L273 TraceCheckUtils]: 22: Hoare triple {1081#false} ~cond := #in~cond; {1081#false} is VALID [2018-11-23 12:19:38,408 INFO L273 TraceCheckUtils]: 23: Hoare triple {1081#false} assume 0 == ~cond; {1081#false} is VALID [2018-11-23 12:19:38,408 INFO L273 TraceCheckUtils]: 24: Hoare triple {1081#false} assume !false; {1081#false} is VALID [2018-11-23 12:19:38,410 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:19:38,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:19:38,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 12:19:38,429 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-23 12:19:38,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:38,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:19:38,467 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:38,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:19:38,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:19:38,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:19:38,469 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 8 states. [2018-11-23 12:19:38,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:38,775 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2018-11-23 12:19:38,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:19:38,776 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-23 12:19:38,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:19:38,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:19:38,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2018-11-23 12:19:38,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:19:38,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2018-11-23 12:19:38,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 62 transitions. [2018-11-23 12:19:38,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-23 12:19:38,873 INFO L225 Difference]: With dead ends: 66 [2018-11-23 12:19:38,873 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:19:38,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:19:38,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:19:39,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-23 12:19:39,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:19:39,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2018-11-23 12:19:39,012 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2018-11-23 12:19:39,012 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2018-11-23 12:19:39,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:39,015 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 12:19:39,015 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 12:19:39,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:39,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:39,016 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2018-11-23 12:19:39,016 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2018-11-23 12:19:39,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:39,018 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 12:19:39,018 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 12:19:39,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:39,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:39,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:19:39,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:19:39,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:19:39,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-23 12:19:39,021 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 25 [2018-11-23 12:19:39,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:19:39,022 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-23 12:19:39,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:19:39,022 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:19:39,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:19:39,023 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:39,023 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:19:39,023 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:39,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:39,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1147324352, now seen corresponding path program 2 times [2018-11-23 12:19:39,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:39,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:39,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:39,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:39,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:39,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:39,150 INFO L256 TraceCheckUtils]: 0: Hoare triple {1388#true} call ULTIMATE.init(); {1388#true} is VALID [2018-11-23 12:19:39,150 INFO L273 TraceCheckUtils]: 1: Hoare triple {1388#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {1388#true} is VALID [2018-11-23 12:19:39,150 INFO L273 TraceCheckUtils]: 2: Hoare triple {1388#true} assume true; {1388#true} is VALID [2018-11-23 12:19:39,150 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1388#true} {1388#true} #83#return; {1388#true} is VALID [2018-11-23 12:19:39,151 INFO L256 TraceCheckUtils]: 4: Hoare triple {1388#true} call #t~ret8 := main(); {1388#true} is VALID [2018-11-23 12:19:39,151 INFO L273 TraceCheckUtils]: 5: Hoare triple {1388#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {1388#true} is VALID [2018-11-23 12:19:39,152 INFO L273 TraceCheckUtils]: 6: Hoare triple {1388#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {1390#(<= 2 main_~MINVAL~0)} is VALID [2018-11-23 12:19:39,152 INFO L273 TraceCheckUtils]: 7: Hoare triple {1390#(<= 2 main_~MINVAL~0)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {1390#(<= 2 main_~MINVAL~0)} is VALID [2018-11-23 12:19:39,152 INFO L273 TraceCheckUtils]: 8: Hoare triple {1390#(<= 2 main_~MINVAL~0)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4));~j~0 := 4; {1390#(<= 2 main_~MINVAL~0)} is VALID [2018-11-23 12:19:39,172 INFO L273 TraceCheckUtils]: 9: Hoare triple {1390#(<= 2 main_~MINVAL~0)} assume !!(~j~0 >= 1); {1390#(<= 2 main_~MINVAL~0)} is VALID [2018-11-23 12:19:39,178 INFO L273 TraceCheckUtils]: 10: Hoare triple {1390#(<= 2 main_~MINVAL~0)} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - ~j~0), 4); {1390#(<= 2 main_~MINVAL~0)} is VALID [2018-11-23 12:19:39,178 INFO L273 TraceCheckUtils]: 11: Hoare triple {1390#(<= 2 main_~MINVAL~0)} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1390#(<= 2 main_~MINVAL~0)} is VALID [2018-11-23 12:19:39,179 INFO L273 TraceCheckUtils]: 12: Hoare triple {1390#(<= 2 main_~MINVAL~0)} assume !!(~j~0 >= 1); {1390#(<= 2 main_~MINVAL~0)} is VALID [2018-11-23 12:19:39,179 INFO L273 TraceCheckUtils]: 13: Hoare triple {1390#(<= 2 main_~MINVAL~0)} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - ~j~0), 4); {1390#(<= 2 main_~MINVAL~0)} is VALID [2018-11-23 12:19:39,180 INFO L273 TraceCheckUtils]: 14: Hoare triple {1390#(<= 2 main_~MINVAL~0)} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1390#(<= 2 main_~MINVAL~0)} is VALID [2018-11-23 12:19:39,180 INFO L273 TraceCheckUtils]: 15: Hoare triple {1390#(<= 2 main_~MINVAL~0)} assume !!(~j~0 >= 1); {1390#(<= 2 main_~MINVAL~0)} is VALID [2018-11-23 12:19:39,181 INFO L273 TraceCheckUtils]: 16: Hoare triple {1390#(<= 2 main_~MINVAL~0)} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - ~j~0), 4); {1391#(<= 2 main_~j~0)} is VALID [2018-11-23 12:19:39,181 INFO L273 TraceCheckUtils]: 17: Hoare triple {1391#(<= 2 main_~j~0)} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1392#(<= 1 main_~j~0)} is VALID [2018-11-23 12:19:39,182 INFO L273 TraceCheckUtils]: 18: Hoare triple {1392#(<= 1 main_~j~0)} assume !(~j~0 >= 1); {1389#false} is VALID [2018-11-23 12:19:39,182 INFO L273 TraceCheckUtils]: 19: Hoare triple {1389#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1389#false} is VALID [2018-11-23 12:19:39,182 INFO L273 TraceCheckUtils]: 20: Hoare triple {1389#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {1389#false} is VALID [2018-11-23 12:19:39,183 INFO L273 TraceCheckUtils]: 21: Hoare triple {1389#false} ~i~0 := 0; {1389#false} is VALID [2018-11-23 12:19:39,183 INFO L273 TraceCheckUtils]: 22: Hoare triple {1389#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {1389#false} is VALID [2018-11-23 12:19:39,183 INFO L273 TraceCheckUtils]: 23: Hoare triple {1389#false} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {1389#false} is VALID [2018-11-23 12:19:39,184 INFO L256 TraceCheckUtils]: 24: Hoare triple {1389#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {1389#false} is VALID [2018-11-23 12:19:39,184 INFO L273 TraceCheckUtils]: 25: Hoare triple {1389#false} ~cond := #in~cond; {1389#false} is VALID [2018-11-23 12:19:39,185 INFO L273 TraceCheckUtils]: 26: Hoare triple {1389#false} assume 0 == ~cond; {1389#false} is VALID [2018-11-23 12:19:39,185 INFO L273 TraceCheckUtils]: 27: Hoare triple {1389#false} assume !false; {1389#false} is VALID [2018-11-23 12:19:39,187 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 12:19:39,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:19:39,187 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-23 12:19:39,205 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:19:39,251 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:19:39,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:19:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:39,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:19:39,420 INFO L256 TraceCheckUtils]: 0: Hoare triple {1388#true} call ULTIMATE.init(); {1388#true} is VALID [2018-11-23 12:19:39,421 INFO L273 TraceCheckUtils]: 1: Hoare triple {1388#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {1388#true} is VALID [2018-11-23 12:19:39,421 INFO L273 TraceCheckUtils]: 2: Hoare triple {1388#true} assume true; {1388#true} is VALID [2018-11-23 12:19:39,422 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1388#true} {1388#true} #83#return; {1388#true} is VALID [2018-11-23 12:19:39,422 INFO L256 TraceCheckUtils]: 4: Hoare triple {1388#true} call #t~ret8 := main(); {1388#true} is VALID [2018-11-23 12:19:39,423 INFO L273 TraceCheckUtils]: 5: Hoare triple {1388#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {1388#true} is VALID [2018-11-23 12:19:39,424 INFO L273 TraceCheckUtils]: 6: Hoare triple {1388#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {1390#(<= 2 main_~MINVAL~0)} is VALID [2018-11-23 12:19:39,424 INFO L273 TraceCheckUtils]: 7: Hoare triple {1390#(<= 2 main_~MINVAL~0)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {1390#(<= 2 main_~MINVAL~0)} is VALID [2018-11-23 12:19:39,429 INFO L273 TraceCheckUtils]: 8: Hoare triple {1390#(<= 2 main_~MINVAL~0)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4));~j~0 := 4; {1390#(<= 2 main_~MINVAL~0)} is VALID [2018-11-23 12:19:39,430 INFO L273 TraceCheckUtils]: 9: Hoare triple {1390#(<= 2 main_~MINVAL~0)} assume !!(~j~0 >= 1); {1390#(<= 2 main_~MINVAL~0)} is VALID [2018-11-23 12:19:39,430 INFO L273 TraceCheckUtils]: 10: Hoare triple {1390#(<= 2 main_~MINVAL~0)} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - ~j~0), 4); {1390#(<= 2 main_~MINVAL~0)} is VALID [2018-11-23 12:19:39,431 INFO L273 TraceCheckUtils]: 11: Hoare triple {1390#(<= 2 main_~MINVAL~0)} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1390#(<= 2 main_~MINVAL~0)} is VALID [2018-11-23 12:19:39,432 INFO L273 TraceCheckUtils]: 12: Hoare triple {1390#(<= 2 main_~MINVAL~0)} assume !!(~j~0 >= 1); {1390#(<= 2 main_~MINVAL~0)} is VALID [2018-11-23 12:19:39,439 INFO L273 TraceCheckUtils]: 13: Hoare triple {1390#(<= 2 main_~MINVAL~0)} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - ~j~0), 4); {1390#(<= 2 main_~MINVAL~0)} is VALID [2018-11-23 12:19:39,440 INFO L273 TraceCheckUtils]: 14: Hoare triple {1390#(<= 2 main_~MINVAL~0)} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1390#(<= 2 main_~MINVAL~0)} is VALID [2018-11-23 12:19:39,440 INFO L273 TraceCheckUtils]: 15: Hoare triple {1390#(<= 2 main_~MINVAL~0)} assume !!(~j~0 >= 1); {1390#(<= 2 main_~MINVAL~0)} is VALID [2018-11-23 12:19:39,445 INFO L273 TraceCheckUtils]: 16: Hoare triple {1390#(<= 2 main_~MINVAL~0)} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - ~j~0), 4); {1391#(<= 2 main_~j~0)} is VALID [2018-11-23 12:19:39,446 INFO L273 TraceCheckUtils]: 17: Hoare triple {1391#(<= 2 main_~j~0)} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1392#(<= 1 main_~j~0)} is VALID [2018-11-23 12:19:39,446 INFO L273 TraceCheckUtils]: 18: Hoare triple {1392#(<= 1 main_~j~0)} assume !(~j~0 >= 1); {1389#false} is VALID [2018-11-23 12:19:39,446 INFO L273 TraceCheckUtils]: 19: Hoare triple {1389#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1389#false} is VALID [2018-11-23 12:19:39,447 INFO L273 TraceCheckUtils]: 20: Hoare triple {1389#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {1389#false} is VALID [2018-11-23 12:19:39,447 INFO L273 TraceCheckUtils]: 21: Hoare triple {1389#false} ~i~0 := 0; {1389#false} is VALID [2018-11-23 12:19:39,447 INFO L273 TraceCheckUtils]: 22: Hoare triple {1389#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {1389#false} is VALID [2018-11-23 12:19:39,447 INFO L273 TraceCheckUtils]: 23: Hoare triple {1389#false} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {1389#false} is VALID [2018-11-23 12:19:39,447 INFO L256 TraceCheckUtils]: 24: Hoare triple {1389#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {1389#false} is VALID [2018-11-23 12:19:39,448 INFO L273 TraceCheckUtils]: 25: Hoare triple {1389#false} ~cond := #in~cond; {1389#false} is VALID [2018-11-23 12:19:39,448 INFO L273 TraceCheckUtils]: 26: Hoare triple {1389#false} assume 0 == ~cond; {1389#false} is VALID [2018-11-23 12:19:39,448 INFO L273 TraceCheckUtils]: 27: Hoare triple {1389#false} assume !false; {1389#false} is VALID [2018-11-23 12:19:39,449 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 12:19:39,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:19:39,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-23 12:19:39,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-23 12:19:39,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:39,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:19:39,495 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:39,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:19:39,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:19:39,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:19:39,497 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2018-11-23 12:19:39,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:39,708 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2018-11-23 12:19:39,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:19:39,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-23 12:19:39,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:19:39,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:19:39,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2018-11-23 12:19:39,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:19:39,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2018-11-23 12:19:39,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2018-11-23 12:19:39,801 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-23 12:19:39,802 INFO L225 Difference]: With dead ends: 71 [2018-11-23 12:19:39,802 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 12:19:39,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:19:39,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 12:19:39,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-23 12:19:39,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:19:39,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 41 states. [2018-11-23 12:19:39,866 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-23 12:19:39,867 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-23 12:19:39,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:39,869 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-11-23 12:19:39,869 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-23 12:19:39,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:39,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:39,869 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-23 12:19:39,869 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-23 12:19:39,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:39,871 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-11-23 12:19:39,871 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-23 12:19:39,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:39,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:39,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:19:39,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:19:39,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:19:39,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-23 12:19:39,874 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 28 [2018-11-23 12:19:39,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:19:39,874 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-23 12:19:39,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:19:39,874 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-23 12:19:39,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:19:39,875 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:39,875 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:19:39,875 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:39,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:39,876 INFO L82 PathProgramCache]: Analyzing trace with hash 401597370, now seen corresponding path program 2 times [2018-11-23 12:19:39,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:39,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:39,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:39,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:19:39,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:40,604 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 33 [2018-11-23 12:19:41,623 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 35 [2018-11-23 12:19:41,788 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 24 [2018-11-23 12:19:42,282 INFO L256 TraceCheckUtils]: 0: Hoare triple {1716#true} call ULTIMATE.init(); {1716#true} is VALID [2018-11-23 12:19:42,282 INFO L273 TraceCheckUtils]: 1: Hoare triple {1716#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {1716#true} is VALID [2018-11-23 12:19:42,283 INFO L273 TraceCheckUtils]: 2: Hoare triple {1716#true} assume true; {1716#true} is VALID [2018-11-23 12:19:42,283 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1716#true} {1716#true} #83#return; {1716#true} is VALID [2018-11-23 12:19:42,283 INFO L256 TraceCheckUtils]: 4: Hoare triple {1716#true} call #t~ret8 := main(); {1716#true} is VALID [2018-11-23 12:19:42,283 INFO L273 TraceCheckUtils]: 5: Hoare triple {1716#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {1716#true} is VALID [2018-11-23 12:19:42,285 INFO L273 TraceCheckUtils]: 6: Hoare triple {1716#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {1718#(and (<= 2 ~CELLCOUNT~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:42,286 INFO L273 TraceCheckUtils]: 7: Hoare triple {1718#(and (<= 2 ~CELLCOUNT~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {1719#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:42,288 INFO L273 TraceCheckUtils]: 8: Hoare triple {1719#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4));~j~0 := 4; {1720#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 4 main_~j~0) (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 2) main_~j~0) (<= main_~j~0 4) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 16 main_~i~0))))} is VALID [2018-11-23 12:19:42,289 INFO L273 TraceCheckUtils]: 9: Hoare triple {1720#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 4 main_~j~0) (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 2) main_~j~0) (<= main_~j~0 4) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 16 main_~i~0))))} assume !!(~j~0 >= 1); {1720#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 4 main_~j~0) (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 2) main_~j~0) (<= main_~j~0 4) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 16 main_~i~0))))} is VALID [2018-11-23 12:19:42,290 INFO L273 TraceCheckUtils]: 10: Hoare triple {1720#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 4 main_~j~0) (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 2) main_~j~0) (<= main_~j~0 4) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 16 main_~i~0))))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - ~j~0), 4); {1721#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 2) main_~j~0) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 16 main_~i~0))))} is VALID [2018-11-23 12:19:42,291 INFO L273 TraceCheckUtils]: 11: Hoare triple {1721#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 2) main_~j~0) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 16 main_~i~0))))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1722#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (<= (+ main_~j~0 1) (div (+ (- 0) (+ |main_~#volArray~0.offset| (* 16 main_~i~0))) 4)) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 2) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 0)))} is VALID [2018-11-23 12:19:42,308 INFO L273 TraceCheckUtils]: 12: Hoare triple {1722#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (<= (+ main_~j~0 1) (div (+ (- 0) (+ |main_~#volArray~0.offset| (* 16 main_~i~0))) 4)) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 2) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 0)))} assume !!(~j~0 >= 1); {1722#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (<= (+ main_~j~0 1) (div (+ (- 0) (+ |main_~#volArray~0.offset| (* 16 main_~i~0))) 4)) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 2) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 0)))} is VALID [2018-11-23 12:19:42,322 INFO L273 TraceCheckUtils]: 13: Hoare triple {1722#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (<= (+ main_~j~0 1) (div (+ (- 0) (+ |main_~#volArray~0.offset| (* 16 main_~i~0))) 4)) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 2) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 0)))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - ~j~0), 4); {1722#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (<= (+ main_~j~0 1) (div (+ (- 0) (+ |main_~#volArray~0.offset| (* 16 main_~i~0))) 4)) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 2) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 0)))} is VALID [2018-11-23 12:19:42,336 INFO L273 TraceCheckUtils]: 14: Hoare triple {1722#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (<= (+ main_~j~0 1) (div (+ (- 0) (+ |main_~#volArray~0.offset| (* 16 main_~i~0))) 4)) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 2) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 0)))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1723#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 2) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 0)))} is VALID [2018-11-23 12:19:42,350 INFO L273 TraceCheckUtils]: 15: Hoare triple {1723#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 2) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 0)))} assume !!(~j~0 >= 1); {1723#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 2) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 0)))} is VALID [2018-11-23 12:19:42,359 INFO L273 TraceCheckUtils]: 16: Hoare triple {1723#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 2) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 0)))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - ~j~0), 4); {1724#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:42,362 INFO L273 TraceCheckUtils]: 17: Hoare triple {1724#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1725#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (or (= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) (* 4 main_~j~0)) (<= (+ main_~MINVAL~0 2) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) 0))))} is VALID [2018-11-23 12:19:42,363 INFO L273 TraceCheckUtils]: 18: Hoare triple {1725#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (or (= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) (* 4 main_~j~0)) (<= (+ main_~MINVAL~0 2) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) 0))))} assume !!(~j~0 >= 1); {1725#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (or (= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) (* 4 main_~j~0)) (<= (+ main_~MINVAL~0 2) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) 0))))} is VALID [2018-11-23 12:19:42,369 INFO L273 TraceCheckUtils]: 19: Hoare triple {1725#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (or (= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) (* 4 main_~j~0)) (<= (+ main_~MINVAL~0 2) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) 0))))} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - ~j~0), 4); {1726#(and (or (and (= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) (* 4 main_~j~0)) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0))))) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:42,370 INFO L273 TraceCheckUtils]: 20: Hoare triple {1726#(and (or (and (= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) (* 4 main_~j~0)) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0))))) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1727#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (or (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:42,370 INFO L273 TraceCheckUtils]: 21: Hoare triple {1727#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (or (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !(~j~0 >= 1); {1727#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (or (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:42,371 INFO L273 TraceCheckUtils]: 22: Hoare triple {1727#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (or (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1728#(and (or (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (<= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) 31)) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (< 1 main_~i~0) (and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0))))} is VALID [2018-11-23 12:19:42,372 INFO L273 TraceCheckUtils]: 23: Hoare triple {1728#(and (or (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (<= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) 31)) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (< 1 main_~i~0) (and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {1729#(and (or (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:42,373 INFO L273 TraceCheckUtils]: 24: Hoare triple {1729#(and (or (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= |main_~#volArray~0.offset| 0))} ~i~0 := 0; {1730#(and (or (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-23 12:19:42,373 INFO L273 TraceCheckUtils]: 25: Hoare triple {1730#(and (or (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))) (= |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 + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {1731#(and (or |main_#t~short7| (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-23 12:19:42,374 INFO L273 TraceCheckUtils]: 26: Hoare triple {1731#(and (or |main_#t~short7| (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {1732#|main_#t~short7|} is VALID [2018-11-23 12:19:42,375 INFO L256 TraceCheckUtils]: 27: Hoare triple {1732#|main_#t~short7|} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {1733#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:19:42,376 INFO L273 TraceCheckUtils]: 28: Hoare triple {1733#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1734#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 12:19:42,376 INFO L273 TraceCheckUtils]: 29: Hoare triple {1734#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1717#false} is VALID [2018-11-23 12:19:42,377 INFO L273 TraceCheckUtils]: 30: Hoare triple {1717#false} assume !false; {1717#false} is VALID [2018-11-23 12:19:42,385 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:19:42,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:19:42,386 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:19:42,403 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:19:42,421 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:19:42,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:19:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:42,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:19:42,648 INFO L478 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 18 treesize of output 15 [2018-11-23 12:19:42,657 INFO L478 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 15 treesize of output 14 [2018-11-23 12:19:42,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:19:42,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:19:42,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:19:42,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-11-23 12:19:42,777 INFO L478 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 31 treesize of output 26 [2018-11-23 12:19:42,783 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:42,785 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:42,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 56 [2018-11-23 12:19:42,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:19:42,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:19:42,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:19:42,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:39 [2018-11-23 12:19:43,133 INFO L478 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 45 treesize of output 38 [2018-11-23 12:19:43,142 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:43,143 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:43,144 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:43,145 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:43,147 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:43,149 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:43,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 143 [2018-11-23 12:19:43,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:19:43,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:19:43,193 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-23 12:19:43,193 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:58 [2018-11-23 12:19:43,518 INFO L478 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 48 treesize of output 39 [2018-11-23 12:19:43,535 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:43,536 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:43,537 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:43,538 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:43,540 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:43,542 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:43,544 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:43,546 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:43,548 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:43,550 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:43,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 177 [2018-11-23 12:19:43,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:19:43,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:19:43,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 12:19:43,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:67, output treesize:63 [2018-11-23 12:19:43,670 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:19:43,670 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_12|, main_~j~0, v_main_~j~0_13, v_main_~j~0_14]. (let ((.cse0 (select |v_#memory_int_12| |main_~#volArray~0.base|))) (and (= (select .cse0 |main_~#volArray~0.offset|) 4) (= (store |v_#memory_int_12| |main_~#volArray~0.base| (store .cse0 (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16) 0)) |#memory_int|) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= v_main_~j~0_13 (select .cse0 (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_13) 16))) (<= v_main_~j~0_13 3) (= v_main_~j~0_14 (select .cse0 (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_14) 16))) (<= (+ v_main_~j~0_14 1) v_main_~j~0_13) (<= (+ main_~j~0 1) v_main_~j~0_14))) [2018-11-23 12:19:43,671 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~j~0_13, main_~j~0, v_main_~j~0_14]. (let ((.cse0 (select |#memory_int| |main_~#volArray~0.base|))) (and (<= main_~MINVAL~0 2) (= v_main_~j~0_13 (select .cse0 (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_13) 16))) (= (select .cse0 (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) 0) (= |main_~#volArray~0.offset| 0) (<= v_main_~j~0_13 3) (= (select .cse0 |main_~#volArray~0.offset|) 4) (= v_main_~j~0_14 (select .cse0 (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_14) 16))) (<= (+ v_main_~j~0_14 1) v_main_~j~0_13) (<= (+ main_~j~0 1) v_main_~j~0_14))) [2018-11-23 12:19:44,197 INFO L256 TraceCheckUtils]: 0: Hoare triple {1716#true} call ULTIMATE.init(); {1716#true} is VALID [2018-11-23 12:19:44,198 INFO L273 TraceCheckUtils]: 1: Hoare triple {1716#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {1716#true} is VALID [2018-11-23 12:19:44,198 INFO L273 TraceCheckUtils]: 2: Hoare triple {1716#true} assume true; {1716#true} is VALID [2018-11-23 12:19:44,198 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1716#true} {1716#true} #83#return; {1716#true} is VALID [2018-11-23 12:19:44,198 INFO L256 TraceCheckUtils]: 4: Hoare triple {1716#true} call #t~ret8 := main(); {1716#true} is VALID [2018-11-23 12:19:44,199 INFO L273 TraceCheckUtils]: 5: Hoare triple {1716#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {1716#true} is VALID [2018-11-23 12:19:44,202 INFO L273 TraceCheckUtils]: 6: Hoare triple {1716#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {1756#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:44,202 INFO L273 TraceCheckUtils]: 7: Hoare triple {1756#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {1760#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:44,203 INFO L273 TraceCheckUtils]: 8: Hoare triple {1760#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4));~j~0 := 4; {1764#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= main_~j~0 4))} is VALID [2018-11-23 12:19:44,203 INFO L273 TraceCheckUtils]: 9: Hoare triple {1764#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= main_~j~0 4))} assume !!(~j~0 >= 1); {1764#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= main_~j~0 4))} is VALID [2018-11-23 12:19:44,204 INFO L273 TraceCheckUtils]: 10: Hoare triple {1764#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= main_~j~0 4))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - ~j~0), 4); {1771#(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| (* 16 main_~i~0) (* (- 4) main_~j~0))) main_~j~0) (= main_~j~0 4))} is VALID [2018-11-23 12:19:44,205 INFO L273 TraceCheckUtils]: 11: Hoare triple {1771#(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| (* 16 main_~i~0) (* (- 4) main_~j~0))) main_~j~0) (= main_~j~0 4))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1775#(and (<= main_~MINVAL~0 2) (<= main_~j~0 3) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= 4 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))))} is VALID [2018-11-23 12:19:44,206 INFO L273 TraceCheckUtils]: 12: Hoare triple {1775#(and (<= main_~MINVAL~0 2) (<= main_~j~0 3) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= 4 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))))} assume !!(~j~0 >= 1); {1775#(and (<= main_~MINVAL~0 2) (<= main_~j~0 3) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= 4 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))))} is VALID [2018-11-23 12:19:44,207 INFO L273 TraceCheckUtils]: 13: Hoare triple {1775#(and (<= main_~MINVAL~0 2) (<= main_~j~0 3) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= 4 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - ~j~0), 4); {1782#(and (<= main_~MINVAL~0 2) (<= main_~j~0 3) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (* (- 4) main_~j~0))) main_~j~0) (= 4 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))))} is VALID [2018-11-23 12:19:44,209 INFO L273 TraceCheckUtils]: 14: Hoare triple {1782#(and (<= main_~MINVAL~0 2) (<= main_~j~0 3) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (* (- 4) main_~j~0))) main_~j~0) (= 4 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1786#(and (exists ((v_main_~j~0_13 Int)) (and (<= (+ main_~j~0 1) v_main_~j~0_13) (<= v_main_~j~0_13 3) (= v_main_~j~0_13 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (* (- 4) v_main_~j~0_13)))))) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= 4 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))))} is VALID [2018-11-23 12:19:44,211 INFO L273 TraceCheckUtils]: 15: Hoare triple {1786#(and (exists ((v_main_~j~0_13 Int)) (and (<= (+ main_~j~0 1) v_main_~j~0_13) (<= v_main_~j~0_13 3) (= v_main_~j~0_13 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (* (- 4) v_main_~j~0_13)))))) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= 4 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))))} assume !!(~j~0 >= 1); {1786#(and (exists ((v_main_~j~0_13 Int)) (and (<= (+ main_~j~0 1) v_main_~j~0_13) (<= v_main_~j~0_13 3) (= v_main_~j~0_13 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (* (- 4) v_main_~j~0_13)))))) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= 4 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))))} is VALID [2018-11-23 12:19:44,213 INFO L273 TraceCheckUtils]: 16: Hoare triple {1786#(and (exists ((v_main_~j~0_13 Int)) (and (<= (+ main_~j~0 1) v_main_~j~0_13) (<= v_main_~j~0_13 3) (= v_main_~j~0_13 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (* (- 4) v_main_~j~0_13)))))) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= 4 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - ~j~0), 4); {1793#(and (exists ((v_main_~j~0_13 Int)) (and (<= (+ main_~j~0 1) v_main_~j~0_13) (<= v_main_~j~0_13 3) (= v_main_~j~0_13 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (* (- 4) v_main_~j~0_13)))))) (<= 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| (* 16 main_~i~0) (* (- 4) main_~j~0))) main_~j~0) (= 4 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))))} is VALID [2018-11-23 12:19:44,216 INFO L273 TraceCheckUtils]: 17: Hoare triple {1793#(and (exists ((v_main_~j~0_13 Int)) (and (<= (+ main_~j~0 1) v_main_~j~0_13) (<= v_main_~j~0_13 3) (= v_main_~j~0_13 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (* (- 4) v_main_~j~0_13)))))) (<= 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| (* 16 main_~i~0) (* (- 4) main_~j~0))) main_~j~0) (= 4 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1797#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_main_~j~0_14 Int) (v_main_~j~0_13 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (* (- 4) v_main_~j~0_14))) v_main_~j~0_14) (<= v_main_~j~0_13 3) (<= (+ v_main_~j~0_14 1) v_main_~j~0_13) (= v_main_~j~0_13 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (* (- 4) v_main_~j~0_13)))) (<= (+ main_~j~0 1) v_main_~j~0_14))) (= 4 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))))} is VALID [2018-11-23 12:19:44,217 INFO L273 TraceCheckUtils]: 18: Hoare triple {1797#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_main_~j~0_14 Int) (v_main_~j~0_13 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (* (- 4) v_main_~j~0_14))) v_main_~j~0_14) (<= v_main_~j~0_13 3) (<= (+ v_main_~j~0_14 1) v_main_~j~0_13) (= v_main_~j~0_13 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (* (- 4) v_main_~j~0_13)))) (<= (+ main_~j~0 1) v_main_~j~0_14))) (= 4 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))))} assume !!(~j~0 >= 1); {1797#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_main_~j~0_14 Int) (v_main_~j~0_13 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (* (- 4) v_main_~j~0_14))) v_main_~j~0_14) (<= v_main_~j~0_13 3) (<= (+ v_main_~j~0_14 1) v_main_~j~0_13) (= v_main_~j~0_13 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (* (- 4) v_main_~j~0_13)))) (<= (+ main_~j~0 1) v_main_~j~0_14))) (= 4 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))))} is VALID [2018-11-23 12:19:44,221 INFO L273 TraceCheckUtils]: 19: Hoare triple {1797#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_main_~j~0_14 Int) (v_main_~j~0_13 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (* (- 4) v_main_~j~0_14))) v_main_~j~0_14) (<= v_main_~j~0_13 3) (<= (+ v_main_~j~0_14 1) v_main_~j~0_13) (= v_main_~j~0_13 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (* (- 4) v_main_~j~0_13)))) (<= (+ main_~j~0 1) v_main_~j~0_14))) (= 4 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))))} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - ~j~0), 4); {1804#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int) (v_main_~j~0_14 Int) (v_main_~j~0_13 Int)) (and (= v_main_~j~0_13 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_13) 16))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) 0) (<= v_main_~j~0_13 3) (= v_main_~j~0_14 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_14) 16))) (<= (+ v_main_~j~0_14 1) v_main_~j~0_13) (<= (+ main_~j~0 1) v_main_~j~0_14))) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 4))} is VALID [2018-11-23 12:19:44,222 INFO L273 TraceCheckUtils]: 20: Hoare triple {1804#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int) (v_main_~j~0_14 Int) (v_main_~j~0_13 Int)) (and (= v_main_~j~0_13 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_13) 16))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) 0) (<= v_main_~j~0_13 3) (= v_main_~j~0_14 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_14) 16))) (<= (+ v_main_~j~0_14 1) v_main_~j~0_13) (<= (+ main_~j~0 1) v_main_~j~0_14))) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 4))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1804#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int) (v_main_~j~0_14 Int) (v_main_~j~0_13 Int)) (and (= v_main_~j~0_13 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_13) 16))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) 0) (<= v_main_~j~0_13 3) (= v_main_~j~0_14 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_14) 16))) (<= (+ v_main_~j~0_14 1) v_main_~j~0_13) (<= (+ main_~j~0 1) v_main_~j~0_14))) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 4))} is VALID [2018-11-23 12:19:44,224 INFO L273 TraceCheckUtils]: 21: Hoare triple {1804#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int) (v_main_~j~0_14 Int) (v_main_~j~0_13 Int)) (and (= v_main_~j~0_13 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_13) 16))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) 0) (<= v_main_~j~0_13 3) (= v_main_~j~0_14 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_14) 16))) (<= (+ v_main_~j~0_14 1) v_main_~j~0_13) (<= (+ main_~j~0 1) v_main_~j~0_14))) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 4))} assume !(~j~0 >= 1); {1804#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int) (v_main_~j~0_14 Int) (v_main_~j~0_13 Int)) (and (= v_main_~j~0_13 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_13) 16))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) 0) (<= v_main_~j~0_13 3) (= v_main_~j~0_14 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_14) 16))) (<= (+ v_main_~j~0_14 1) v_main_~j~0_13) (<= (+ main_~j~0 1) v_main_~j~0_14))) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 4))} is VALID [2018-11-23 12:19:44,230 INFO L273 TraceCheckUtils]: 22: Hoare triple {1804#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int) (v_main_~j~0_14 Int) (v_main_~j~0_13 Int)) (and (= v_main_~j~0_13 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_13) 16))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) 0) (<= v_main_~j~0_13 3) (= v_main_~j~0_14 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_14) 16))) (<= (+ v_main_~j~0_14 1) v_main_~j~0_13) (<= (+ main_~j~0 1) v_main_~j~0_14))) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1804#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int) (v_main_~j~0_14 Int) (v_main_~j~0_13 Int)) (and (= v_main_~j~0_13 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_13) 16))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) 0) (<= v_main_~j~0_13 3) (= v_main_~j~0_14 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_14) 16))) (<= (+ v_main_~j~0_14 1) v_main_~j~0_13) (<= (+ main_~j~0 1) v_main_~j~0_14))) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 4))} is VALID [2018-11-23 12:19:44,231 INFO L273 TraceCheckUtils]: 23: Hoare triple {1804#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int) (v_main_~j~0_14 Int) (v_main_~j~0_13 Int)) (and (= v_main_~j~0_13 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_13) 16))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) 0) (<= v_main_~j~0_13 3) (= v_main_~j~0_14 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_14) 16))) (<= (+ v_main_~j~0_14 1) v_main_~j~0_13) (<= (+ main_~j~0 1) v_main_~j~0_14))) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 4))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {1804#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int) (v_main_~j~0_14 Int) (v_main_~j~0_13 Int)) (and (= v_main_~j~0_13 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_13) 16))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) 0) (<= v_main_~j~0_13 3) (= v_main_~j~0_14 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_14) 16))) (<= (+ v_main_~j~0_14 1) v_main_~j~0_13) (<= (+ main_~j~0 1) v_main_~j~0_14))) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 4))} is VALID [2018-11-23 12:19:44,232 INFO L273 TraceCheckUtils]: 24: Hoare triple {1804#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int) (v_main_~j~0_14 Int) (v_main_~j~0_13 Int)) (and (= v_main_~j~0_13 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_13) 16))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) 0) (<= v_main_~j~0_13 3) (= v_main_~j~0_14 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_14) 16))) (<= (+ v_main_~j~0_14 1) v_main_~j~0_13) (<= (+ main_~j~0 1) v_main_~j~0_14))) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 4))} ~i~0 := 0; {1820#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int) (v_main_~j~0_14 Int) (v_main_~j~0_13 Int)) (and (= v_main_~j~0_13 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_13) 16))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) 0) (<= v_main_~j~0_13 3) (= v_main_~j~0_14 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_14) 16))) (<= (+ v_main_~j~0_14 1) v_main_~j~0_13) (<= (+ main_~j~0 1) v_main_~j~0_14))) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 4) (= main_~i~0 0))} is VALID [2018-11-23 12:19:44,233 INFO L273 TraceCheckUtils]: 25: Hoare triple {1820#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int) (v_main_~j~0_14 Int) (v_main_~j~0_13 Int)) (and (= v_main_~j~0_13 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_13) 16))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) 0) (<= v_main_~j~0_13 3) (= v_main_~j~0_14 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_14) 16))) (<= (+ v_main_~j~0_14 1) v_main_~j~0_13) (<= (+ main_~j~0 1) v_main_~j~0_14))) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 4) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {1732#|main_#t~short7|} is VALID [2018-11-23 12:19:44,233 INFO L273 TraceCheckUtils]: 26: Hoare triple {1732#|main_#t~short7|} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {1717#false} is VALID [2018-11-23 12:19:44,233 INFO L256 TraceCheckUtils]: 27: Hoare triple {1717#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {1717#false} is VALID [2018-11-23 12:19:44,234 INFO L273 TraceCheckUtils]: 28: Hoare triple {1717#false} ~cond := #in~cond; {1717#false} is VALID [2018-11-23 12:19:44,234 INFO L273 TraceCheckUtils]: 29: Hoare triple {1717#false} assume 0 == ~cond; {1717#false} is VALID [2018-11-23 12:19:44,234 INFO L273 TraceCheckUtils]: 30: Hoare triple {1717#false} assume !false; {1717#false} is VALID [2018-11-23 12:19:44,243 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:19:44,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:19:44,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14] total 30 [2018-11-23 12:19:44,270 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 31 [2018-11-23 12:19:44,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:44,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 12:19:44,365 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-23 12:19:44,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 12:19:44,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 12:19:44,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=729, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:19:44,367 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 30 states. [2018-11-23 12:19:49,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:49,261 INFO L93 Difference]: Finished difference Result 109 states and 128 transitions. [2018-11-23 12:19:49,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 12:19:49,261 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 31 [2018-11-23 12:19:49,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:19:49,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:19:49,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 105 transitions. [2018-11-23 12:19:49,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:19:49,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 105 transitions. [2018-11-23 12:19:49,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 105 transitions. [2018-11-23 12:19:49,545 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:49,548 INFO L225 Difference]: With dead ends: 109 [2018-11-23 12:19:49,549 INFO L226 Difference]: Without dead ends: 93 [2018-11-23 12:19:49,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=357, Invalid=1713, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 12:19:49,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-23 12:19:49,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 59. [2018-11-23 12:19:49,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:19:49,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 59 states. [2018-11-23 12:19:49,735 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 59 states. [2018-11-23 12:19:49,735 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 59 states. [2018-11-23 12:19:49,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:49,740 INFO L93 Difference]: Finished difference Result 93 states and 110 transitions. [2018-11-23 12:19:49,740 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 110 transitions. [2018-11-23 12:19:49,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:49,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:49,741 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 93 states. [2018-11-23 12:19:49,741 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 93 states. [2018-11-23 12:19:49,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:49,745 INFO L93 Difference]: Finished difference Result 93 states and 110 transitions. [2018-11-23 12:19:49,745 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 110 transitions. [2018-11-23 12:19:49,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:49,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:49,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:19:49,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:19:49,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 12:19:49,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2018-11-23 12:19:49,748 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 31 [2018-11-23 12:19:49,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:19:49,748 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2018-11-23 12:19:49,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 12:19:49,749 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-11-23 12:19:49,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 12:19:49,750 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:49,750 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 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, 1] [2018-11-23 12:19:49,750 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:49,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:49,750 INFO L82 PathProgramCache]: Analyzing trace with hash 890139769, now seen corresponding path program 1 times [2018-11-23 12:19:49,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:49,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:49,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:49,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:19:49,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:49,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:51,476 INFO L256 TraceCheckUtils]: 0: Hoare triple {2287#true} call ULTIMATE.init(); {2287#true} is VALID [2018-11-23 12:19:51,476 INFO L273 TraceCheckUtils]: 1: Hoare triple {2287#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {2287#true} is VALID [2018-11-23 12:19:51,477 INFO L273 TraceCheckUtils]: 2: Hoare triple {2287#true} assume true; {2287#true} is VALID [2018-11-23 12:19:51,477 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2287#true} {2287#true} #83#return; {2287#true} is VALID [2018-11-23 12:19:51,477 INFO L256 TraceCheckUtils]: 4: Hoare triple {2287#true} call #t~ret8 := main(); {2287#true} is VALID [2018-11-23 12:19:51,477 INFO L273 TraceCheckUtils]: 5: Hoare triple {2287#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {2287#true} is VALID [2018-11-23 12:19:51,479 INFO L273 TraceCheckUtils]: 6: Hoare triple {2287#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {2289#(and (<= 2 ~CELLCOUNT~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:51,480 INFO L273 TraceCheckUtils]: 7: Hoare triple {2289#(and (<= 2 ~CELLCOUNT~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {2290#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:51,481 INFO L273 TraceCheckUtils]: 8: Hoare triple {2290#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4));~j~0 := 4; {2291#(and (<= 4 main_~j~0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 2) main_~j~0) (<= main_~j~0 4) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:51,482 INFO L273 TraceCheckUtils]: 9: Hoare triple {2291#(and (<= 4 main_~j~0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 2) main_~j~0) (<= main_~j~0 4) (< 0 (+ ~CELLCOUNT~0 1)))} assume !!(~j~0 >= 1); {2291#(and (<= 4 main_~j~0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 2) main_~j~0) (<= main_~j~0 4) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:51,483 INFO L273 TraceCheckUtils]: 10: Hoare triple {2291#(and (<= 4 main_~j~0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 2) main_~j~0) (<= main_~j~0 4) (< 0 (+ ~CELLCOUNT~0 1)))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - ~j~0), 4); {2291#(and (<= 4 main_~j~0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 2) main_~j~0) (<= main_~j~0 4) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:51,484 INFO L273 TraceCheckUtils]: 11: Hoare triple {2291#(and (<= 4 main_~j~0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 2) main_~j~0) (<= main_~j~0 4) (< 0 (+ ~CELLCOUNT~0 1)))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2292#(and (<= (+ main_~MINVAL~0 1) main_~j~0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) (+ (* 4 main_~j~0) 4)) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:51,485 INFO L273 TraceCheckUtils]: 12: Hoare triple {2292#(and (<= (+ main_~MINVAL~0 1) main_~j~0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) (+ (* 4 main_~j~0) 4)) (< 0 (+ ~CELLCOUNT~0 1)))} assume !!(~j~0 >= 1); {2292#(and (<= (+ main_~MINVAL~0 1) main_~j~0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) (+ (* 4 main_~j~0) 4)) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:51,486 INFO L273 TraceCheckUtils]: 13: Hoare triple {2292#(and (<= (+ main_~MINVAL~0 1) main_~j~0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) (+ (* 4 main_~j~0) 4)) (< 0 (+ ~CELLCOUNT~0 1)))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - ~j~0), 4); {2293#(and (<= (+ main_~MINVAL~0 1) main_~j~0) (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) (+ (* 4 main_~j~0) 4)) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:51,488 INFO L273 TraceCheckUtils]: 14: Hoare triple {2293#(and (<= (+ main_~MINVAL~0 1) main_~j~0) (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) (+ (* 4 main_~j~0) 4)) (< 0 (+ ~CELLCOUNT~0 1)))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2294#(and (<= (+ main_~MINVAL~0 1) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 4)) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:51,489 INFO L273 TraceCheckUtils]: 15: Hoare triple {2294#(and (<= (+ main_~MINVAL~0 1) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 4)) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} assume !!(~j~0 >= 1); {2294#(and (<= (+ main_~MINVAL~0 1) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 4)) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:51,491 INFO L273 TraceCheckUtils]: 16: Hoare triple {2294#(and (<= (+ main_~MINVAL~0 1) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 4)) (= main_~i~0 1) (= |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 + 4 * (4 * ~i~0 - ~j~0), 4); {2295#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 4)) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:51,492 INFO L273 TraceCheckUtils]: 17: Hoare triple {2295#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 4)) (< 0 (+ ~CELLCOUNT~0 1)))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2296#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (or (<= (+ main_~MINVAL~0 1) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) 4)) (= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) (+ (* 4 main_~j~0) 4))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:51,493 INFO L273 TraceCheckUtils]: 18: Hoare triple {2296#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (or (<= (+ main_~MINVAL~0 1) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) 4)) (= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) (+ (* 4 main_~j~0) 4))) (< 0 (+ ~CELLCOUNT~0 1)))} assume !!(~j~0 >= 1); {2296#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (or (<= (+ main_~MINVAL~0 1) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) 4)) (= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) (+ (* 4 main_~j~0) 4))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:51,495 INFO L273 TraceCheckUtils]: 19: Hoare triple {2296#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (or (<= (+ main_~MINVAL~0 1) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) 4)) (= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) (+ (* 4 main_~j~0) 4))) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - ~j~0), 4); {2297#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 4)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)))) (= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) (+ (* 4 main_~j~0) 4)))))} is VALID [2018-11-23 12:19:51,496 INFO L273 TraceCheckUtils]: 20: Hoare triple {2297#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 4)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)))) (= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) (+ (* 4 main_~j~0) 4)))))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2298#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 4)) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 4))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:51,497 INFO L273 TraceCheckUtils]: 21: Hoare triple {2298#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 4)) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 4))) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~j~0 >= 1); {2298#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 4)) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 4))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:51,501 INFO L273 TraceCheckUtils]: 22: Hoare triple {2298#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 4)) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 4))) (< 0 (+ ~CELLCOUNT~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2299#(and (= |main_~#volArray~0.offset| 0) (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 4)) (and (<= (* 4 main_~i~0) (+ ~CELLCOUNT~0 2)) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4)))) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 4))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:51,502 INFO L273 TraceCheckUtils]: 23: Hoare triple {2299#(and (= |main_~#volArray~0.offset| 0) (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 4)) (and (<= (* 4 main_~i~0) (+ ~CELLCOUNT~0 2)) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4)))) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 4))) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {2300#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 4)) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 4))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:51,509 INFO L273 TraceCheckUtils]: 24: Hoare triple {2300#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 4)) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 4))) (= |main_~#volArray~0.offset| 0))} ~i~0 := 0; {2301#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 4)) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 4))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-23 12:19:51,509 INFO L273 TraceCheckUtils]: 25: Hoare triple {2301#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 4)) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 4))) (= |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 + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {2301#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 4)) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 4))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-23 12:19:51,510 INFO L273 TraceCheckUtils]: 26: Hoare triple {2301#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 4)) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 4))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} assume #t~short7; {2301#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 4)) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 4))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-23 12:19:51,510 INFO L256 TraceCheckUtils]: 27: Hoare triple {2301#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 4)) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 4))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {2287#true} is VALID [2018-11-23 12:19:51,510 INFO L273 TraceCheckUtils]: 28: Hoare triple {2287#true} ~cond := #in~cond; {2287#true} is VALID [2018-11-23 12:19:51,510 INFO L273 TraceCheckUtils]: 29: Hoare triple {2287#true} assume !(0 == ~cond); {2287#true} is VALID [2018-11-23 12:19:51,511 INFO L273 TraceCheckUtils]: 30: Hoare triple {2287#true} assume true; {2287#true} is VALID [2018-11-23 12:19:51,511 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {2287#true} {2301#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 4)) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 4))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} #87#return; {2301#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 4)) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 4))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-23 12:19:51,512 INFO L273 TraceCheckUtils]: 32: Hoare triple {2301#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 4)) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 4))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} havoc #t~short7;havoc #t~mem6;havoc #t~mem5; {2301#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 4)) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 4))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-23 12:19:51,513 INFO L273 TraceCheckUtils]: 33: Hoare triple {2301#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 4)) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 4))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2302#(and (or (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:51,514 INFO L273 TraceCheckUtils]: 34: Hoare triple {2302#(and (or (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {2303#(and (or |main_#t~short7| (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:51,515 INFO L273 TraceCheckUtils]: 35: Hoare triple {2303#(and (or |main_#t~short7| (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))) (= |main_~#volArray~0.offset| 0))} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {2304#|main_#t~short7|} is VALID [2018-11-23 12:19:51,516 INFO L256 TraceCheckUtils]: 36: Hoare triple {2304#|main_#t~short7|} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {2305#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:19:51,516 INFO L273 TraceCheckUtils]: 37: Hoare triple {2305#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2306#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 12:19:51,517 INFO L273 TraceCheckUtils]: 38: Hoare triple {2306#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2288#false} is VALID [2018-11-23 12:19:51,517 INFO L273 TraceCheckUtils]: 39: Hoare triple {2288#false} assume !false; {2288#false} is VALID [2018-11-23 12:19:51,524 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:19:51,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:19:51,524 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:19:51,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:51,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:51,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:19:51,732 INFO L478 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 18 treesize of output 15 [2018-11-23 12:19:51,737 INFO L478 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 15 treesize of output 14 [2018-11-23 12:19:51,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:19:51,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:19:51,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:19:51,754 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-11-23 12:19:51,870 INFO L478 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 31 treesize of output 26 [2018-11-23 12:19:51,877 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:51,892 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:51,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 56 [2018-11-23 12:19:51,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:19:51,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:19:51,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:19:51,985 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:39 [2018-11-23 12:19:52,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-11-23 12:19:52,238 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:52,240 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:52,242 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:52,244 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:52,249 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:52,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 99 [2018-11-23 12:19:52,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:19:52,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:19:52,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 12:19:52,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2018-11-23 12:19:52,335 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:19:52,336 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_15|, main_~j~0, v_main_~j~0_17]. (let ((.cse0 (select |v_#memory_int_15| |main_~#volArray~0.base|))) (and (= v_main_~j~0_17 (select .cse0 (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_17) 16))) (= (select .cse0 (+ |main_~#volArray~0.offset| 4)) 3) (<= main_~MINVAL~0 2) (<= (+ main_~j~0 1) v_main_~j~0_17) (= |#memory_int| (store |v_#memory_int_15| |main_~#volArray~0.base| (store .cse0 (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16) 0))) (= |main_~#volArray~0.offset| 0) (<= v_main_~j~0_17 2))) [2018-11-23 12:19:52,336 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~j~0, v_main_~j~0_17]. (let ((.cse0 (select |#memory_int| |main_~#volArray~0.base|))) (and (<= main_~MINVAL~0 2) (<= (+ main_~j~0 1) v_main_~j~0_17) (= (select .cse0 (+ |main_~#volArray~0.offset| 4)) 3) (= (select .cse0 (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) 0) (= |main_~#volArray~0.offset| 0) (= v_main_~j~0_17 (select .cse0 (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_17) 16))) (<= v_main_~j~0_17 2))) [2018-11-23 12:19:53,182 INFO L256 TraceCheckUtils]: 0: Hoare triple {2287#true} call ULTIMATE.init(); {2287#true} is VALID [2018-11-23 12:19:53,183 INFO L273 TraceCheckUtils]: 1: Hoare triple {2287#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {2287#true} is VALID [2018-11-23 12:19:53,183 INFO L273 TraceCheckUtils]: 2: Hoare triple {2287#true} assume true; {2287#true} is VALID [2018-11-23 12:19:53,183 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2287#true} {2287#true} #83#return; {2287#true} is VALID [2018-11-23 12:19:53,183 INFO L256 TraceCheckUtils]: 4: Hoare triple {2287#true} call #t~ret8 := main(); {2287#true} is VALID [2018-11-23 12:19:53,183 INFO L273 TraceCheckUtils]: 5: Hoare triple {2287#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {2287#true} is VALID [2018-11-23 12:19:53,184 INFO L273 TraceCheckUtils]: 6: Hoare triple {2287#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {2328#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:53,185 INFO L273 TraceCheckUtils]: 7: Hoare triple {2328#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) then 1 else 0);~i~0 := 1; {2332#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:53,185 INFO L273 TraceCheckUtils]: 8: Hoare triple {2332#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4));~j~0 := 4; {2336#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= main_~j~0 4))} is VALID [2018-11-23 12:19:53,185 INFO L273 TraceCheckUtils]: 9: Hoare triple {2336#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= main_~j~0 4))} assume !!(~j~0 >= 1); {2336#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= main_~j~0 4))} is VALID [2018-11-23 12:19:53,186 INFO L273 TraceCheckUtils]: 10: Hoare triple {2336#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= main_~j~0 4))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - ~j~0), 4); {2336#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= main_~j~0 4))} is VALID [2018-11-23 12:19:53,187 INFO L273 TraceCheckUtils]: 11: Hoare triple {2336#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= main_~j~0 4))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2346#(and (<= main_~MINVAL~0 2) (= 3 main_~j~0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:53,187 INFO L273 TraceCheckUtils]: 12: Hoare triple {2346#(and (<= main_~MINVAL~0 2) (= 3 main_~j~0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~j~0 >= 1); {2346#(and (<= main_~MINVAL~0 2) (= 3 main_~j~0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:53,188 INFO L273 TraceCheckUtils]: 13: Hoare triple {2346#(and (<= main_~MINVAL~0 2) (= 3 main_~j~0) (= 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 + 4 * (4 * ~i~0 - ~j~0), 4); {2353#(and (<= main_~MINVAL~0 2) (= 3 main_~j~0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (* (- 4) main_~j~0))) main_~j~0))} is VALID [2018-11-23 12:19:53,189 INFO L273 TraceCheckUtils]: 14: Hoare triple {2353#(and (<= main_~MINVAL~0 2) (= 3 main_~j~0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (* (- 4) main_~j~0))) main_~j~0))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2357#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= main_~j~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12))) 3))} is VALID [2018-11-23 12:19:53,190 INFO L273 TraceCheckUtils]: 15: Hoare triple {2357#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= main_~j~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12))) 3))} assume !!(~j~0 >= 1); {2357#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= main_~j~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12))) 3))} is VALID [2018-11-23 12:19:53,192 INFO L273 TraceCheckUtils]: 16: Hoare triple {2357#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= main_~j~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12))) 3))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - ~j~0), 4); {2364#(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| (* 16 main_~i~0) (* (- 4) main_~j~0))) main_~j~0) (<= main_~j~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12))) 3))} is VALID [2018-11-23 12:19:53,193 INFO L273 TraceCheckUtils]: 17: Hoare triple {2364#(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| (* 16 main_~i~0) (* (- 4) main_~j~0))) main_~j~0) (<= main_~j~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12))) 3))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2368#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_main_~j~0_17 Int)) (and (<= (+ main_~j~0 1) v_main_~j~0_17) (= v_main_~j~0_17 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_17) (* 16 main_~i~0)))) (<= v_main_~j~0_17 2))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12))) 3))} is VALID [2018-11-23 12:19:53,195 INFO L273 TraceCheckUtils]: 18: Hoare triple {2368#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_main_~j~0_17 Int)) (and (<= (+ main_~j~0 1) v_main_~j~0_17) (= v_main_~j~0_17 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_17) (* 16 main_~i~0)))) (<= v_main_~j~0_17 2))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12))) 3))} assume !!(~j~0 >= 1); {2368#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_main_~j~0_17 Int)) (and (<= (+ main_~j~0 1) v_main_~j~0_17) (= v_main_~j~0_17 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_17) (* 16 main_~i~0)))) (<= v_main_~j~0_17 2))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12))) 3))} is VALID [2018-11-23 12:19:53,197 INFO L273 TraceCheckUtils]: 19: Hoare triple {2368#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_main_~j~0_17 Int)) (and (<= (+ main_~j~0 1) v_main_~j~0_17) (= v_main_~j~0_17 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_17) (* 16 main_~i~0)))) (<= v_main_~j~0_17 2))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12))) 3))} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (4 * ~i~0 - ~j~0), 4); {2375#(and (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 3) (= |main_~#volArray~0.offset| 0) (exists ((v_main_~j~0_17 Int) (main_~j~0 Int)) (and (<= (+ main_~j~0 1) v_main_~j~0_17) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) 0) (= v_main_~j~0_17 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_17) 16))) (<= v_main_~j~0_17 2))))} is VALID [2018-11-23 12:19:53,199 INFO L273 TraceCheckUtils]: 20: Hoare triple {2375#(and (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 3) (= |main_~#volArray~0.offset| 0) (exists ((v_main_~j~0_17 Int) (main_~j~0 Int)) (and (<= (+ main_~j~0 1) v_main_~j~0_17) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) 0) (= v_main_~j~0_17 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_17) 16))) (<= v_main_~j~0_17 2))))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2375#(and (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 3) (= |main_~#volArray~0.offset| 0) (exists ((v_main_~j~0_17 Int) (main_~j~0 Int)) (and (<= (+ main_~j~0 1) v_main_~j~0_17) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) 0) (= v_main_~j~0_17 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_17) 16))) (<= v_main_~j~0_17 2))))} is VALID [2018-11-23 12:19:53,200 INFO L273 TraceCheckUtils]: 21: Hoare triple {2375#(and (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 3) (= |main_~#volArray~0.offset| 0) (exists ((v_main_~j~0_17 Int) (main_~j~0 Int)) (and (<= (+ main_~j~0 1) v_main_~j~0_17) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) 0) (= v_main_~j~0_17 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_17) 16))) (<= v_main_~j~0_17 2))))} assume !(~j~0 >= 1); {2375#(and (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 3) (= |main_~#volArray~0.offset| 0) (exists ((v_main_~j~0_17 Int) (main_~j~0 Int)) (and (<= (+ main_~j~0 1) v_main_~j~0_17) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) 0) (= v_main_~j~0_17 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_17) 16))) (<= v_main_~j~0_17 2))))} is VALID [2018-11-23 12:19:53,201 INFO L273 TraceCheckUtils]: 22: Hoare triple {2375#(and (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 3) (= |main_~#volArray~0.offset| 0) (exists ((v_main_~j~0_17 Int) (main_~j~0 Int)) (and (<= (+ main_~j~0 1) v_main_~j~0_17) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) 0) (= v_main_~j~0_17 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_17) 16))) (<= v_main_~j~0_17 2))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2375#(and (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 3) (= |main_~#volArray~0.offset| 0) (exists ((v_main_~j~0_17 Int) (main_~j~0 Int)) (and (<= (+ main_~j~0 1) v_main_~j~0_17) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) 0) (= v_main_~j~0_17 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_17) 16))) (<= v_main_~j~0_17 2))))} is VALID [2018-11-23 12:19:53,203 INFO L273 TraceCheckUtils]: 23: Hoare triple {2375#(and (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 3) (= |main_~#volArray~0.offset| 0) (exists ((v_main_~j~0_17 Int) (main_~j~0 Int)) (and (<= (+ main_~j~0 1) v_main_~j~0_17) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) 0) (= v_main_~j~0_17 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_17) 16))) (<= v_main_~j~0_17 2))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 4 then 1 + ~CELLCOUNT~0 / 4 else ~CELLCOUNT~0 / 4)); {2375#(and (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 3) (= |main_~#volArray~0.offset| 0) (exists ((v_main_~j~0_17 Int) (main_~j~0 Int)) (and (<= (+ main_~j~0 1) v_main_~j~0_17) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) 0) (= v_main_~j~0_17 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_17) 16))) (<= v_main_~j~0_17 2))))} is VALID [2018-11-23 12:19:53,205 INFO L273 TraceCheckUtils]: 24: Hoare triple {2375#(and (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 3) (= |main_~#volArray~0.offset| 0) (exists ((v_main_~j~0_17 Int) (main_~j~0 Int)) (and (<= (+ main_~j~0 1) v_main_~j~0_17) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) 0) (= v_main_~j~0_17 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_17) 16))) (<= v_main_~j~0_17 2))))} ~i~0 := 0; {2391#(and (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 3) (= |main_~#volArray~0.offset| 0) (exists ((v_main_~j~0_17 Int) (main_~j~0 Int)) (and (<= (+ main_~j~0 1) v_main_~j~0_17) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) 0) (= v_main_~j~0_17 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_17) 16))) (<= v_main_~j~0_17 2))) (= main_~i~0 0))} is VALID [2018-11-23 12:19:53,207 INFO L273 TraceCheckUtils]: 25: Hoare triple {2391#(and (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 3) (= |main_~#volArray~0.offset| 0) (exists ((v_main_~j~0_17 Int) (main_~j~0 Int)) (and (<= (+ main_~j~0 1) v_main_~j~0_17) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) 0) (= v_main_~j~0_17 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_17) 16))) (<= v_main_~j~0_17 2))) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {2391#(and (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 3) (= |main_~#volArray~0.offset| 0) (exists ((v_main_~j~0_17 Int) (main_~j~0 Int)) (and (<= (+ main_~j~0 1) v_main_~j~0_17) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) 0) (= v_main_~j~0_17 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_17) 16))) (<= v_main_~j~0_17 2))) (= main_~i~0 0))} is VALID [2018-11-23 12:19:53,209 INFO L273 TraceCheckUtils]: 26: Hoare triple {2391#(and (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 3) (= |main_~#volArray~0.offset| 0) (exists ((v_main_~j~0_17 Int) (main_~j~0 Int)) (and (<= (+ main_~j~0 1) v_main_~j~0_17) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) 0) (= v_main_~j~0_17 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_17) 16))) (<= v_main_~j~0_17 2))) (= main_~i~0 0))} assume #t~short7; {2391#(and (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 3) (= |main_~#volArray~0.offset| 0) (exists ((v_main_~j~0_17 Int) (main_~j~0 Int)) (and (<= (+ main_~j~0 1) v_main_~j~0_17) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) 0) (= v_main_~j~0_17 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_17) 16))) (<= v_main_~j~0_17 2))) (= main_~i~0 0))} is VALID [2018-11-23 12:19:53,211 INFO L256 TraceCheckUtils]: 27: Hoare triple {2391#(and (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 3) (= |main_~#volArray~0.offset| 0) (exists ((v_main_~j~0_17 Int) (main_~j~0 Int)) (and (<= (+ main_~j~0 1) v_main_~j~0_17) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) 0) (= v_main_~j~0_17 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_17) 16))) (<= v_main_~j~0_17 2))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {2401#(exists ((v_main_~j~0_17 Int) (main_~j~0 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* (- 4) main_~j~0) 16))) (= 3 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)) (<= (+ main_~j~0 1) v_main_~j~0_17) (= v_main_~j~0_17 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* (- 4) v_main_~j~0_17) 16))) (<= v_main_~j~0_17 2)))} is VALID [2018-11-23 12:19:53,212 INFO L273 TraceCheckUtils]: 28: Hoare triple {2401#(exists ((v_main_~j~0_17 Int) (main_~j~0 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* (- 4) main_~j~0) 16))) (= 3 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)) (<= (+ main_~j~0 1) v_main_~j~0_17) (= v_main_~j~0_17 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* (- 4) v_main_~j~0_17) 16))) (<= v_main_~j~0_17 2)))} ~cond := #in~cond; {2401#(exists ((v_main_~j~0_17 Int) (main_~j~0 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* (- 4) main_~j~0) 16))) (= 3 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)) (<= (+ main_~j~0 1) v_main_~j~0_17) (= v_main_~j~0_17 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* (- 4) v_main_~j~0_17) 16))) (<= v_main_~j~0_17 2)))} is VALID [2018-11-23 12:19:53,212 INFO L273 TraceCheckUtils]: 29: Hoare triple {2401#(exists ((v_main_~j~0_17 Int) (main_~j~0 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* (- 4) main_~j~0) 16))) (= 3 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)) (<= (+ main_~j~0 1) v_main_~j~0_17) (= v_main_~j~0_17 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* (- 4) v_main_~j~0_17) 16))) (<= v_main_~j~0_17 2)))} assume !(0 == ~cond); {2401#(exists ((v_main_~j~0_17 Int) (main_~j~0 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* (- 4) main_~j~0) 16))) (= 3 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)) (<= (+ main_~j~0 1) v_main_~j~0_17) (= v_main_~j~0_17 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* (- 4) v_main_~j~0_17) 16))) (<= v_main_~j~0_17 2)))} is VALID [2018-11-23 12:19:53,212 INFO L273 TraceCheckUtils]: 30: Hoare triple {2401#(exists ((v_main_~j~0_17 Int) (main_~j~0 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* (- 4) main_~j~0) 16))) (= 3 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)) (<= (+ main_~j~0 1) v_main_~j~0_17) (= v_main_~j~0_17 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* (- 4) v_main_~j~0_17) 16))) (<= v_main_~j~0_17 2)))} assume true; {2401#(exists ((v_main_~j~0_17 Int) (main_~j~0 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* (- 4) main_~j~0) 16))) (= 3 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)) (<= (+ main_~j~0 1) v_main_~j~0_17) (= v_main_~j~0_17 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* (- 4) v_main_~j~0_17) 16))) (<= v_main_~j~0_17 2)))} is VALID [2018-11-23 12:19:53,213 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {2401#(exists ((v_main_~j~0_17 Int) (main_~j~0 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* (- 4) main_~j~0) 16))) (= 3 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)) (<= (+ main_~j~0 1) v_main_~j~0_17) (= v_main_~j~0_17 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* (- 4) v_main_~j~0_17) 16))) (<= v_main_~j~0_17 2)))} {2391#(and (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 3) (= |main_~#volArray~0.offset| 0) (exists ((v_main_~j~0_17 Int) (main_~j~0 Int)) (and (<= (+ main_~j~0 1) v_main_~j~0_17) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) 0) (= v_main_~j~0_17 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_17) 16))) (<= v_main_~j~0_17 2))) (= main_~i~0 0))} #87#return; {2391#(and (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 3) (= |main_~#volArray~0.offset| 0) (exists ((v_main_~j~0_17 Int) (main_~j~0 Int)) (and (<= (+ main_~j~0 1) v_main_~j~0_17) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) 0) (= v_main_~j~0_17 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_17) 16))) (<= v_main_~j~0_17 2))) (= main_~i~0 0))} is VALID [2018-11-23 12:19:53,215 INFO L273 TraceCheckUtils]: 32: Hoare triple {2391#(and (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 3) (= |main_~#volArray~0.offset| 0) (exists ((v_main_~j~0_17 Int) (main_~j~0 Int)) (and (<= (+ main_~j~0 1) v_main_~j~0_17) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) 0) (= v_main_~j~0_17 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_17) 16))) (<= v_main_~j~0_17 2))) (= main_~i~0 0))} havoc #t~short7;havoc #t~mem6;havoc #t~mem5; {2391#(and (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 3) (= |main_~#volArray~0.offset| 0) (exists ((v_main_~j~0_17 Int) (main_~j~0 Int)) (and (<= (+ main_~j~0 1) v_main_~j~0_17) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) 0) (= v_main_~j~0_17 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_17) 16))) (<= v_main_~j~0_17 2))) (= main_~i~0 0))} is VALID [2018-11-23 12:19:53,216 INFO L273 TraceCheckUtils]: 33: Hoare triple {2391#(and (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 3) (= |main_~#volArray~0.offset| 0) (exists ((v_main_~j~0_17 Int) (main_~j~0 Int)) (and (<= (+ main_~j~0 1) v_main_~j~0_17) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) 0) (= v_main_~j~0_17 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_17) 16))) (<= v_main_~j~0_17 2))) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2420#(and (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 3) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_main_~j~0_17 Int) (main_~j~0 Int)) (and (<= (+ main_~j~0 1) v_main_~j~0_17) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) 0) (= v_main_~j~0_17 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_17) 16))) (<= v_main_~j~0_17 2))))} is VALID [2018-11-23 12:19:53,218 INFO L273 TraceCheckUtils]: 34: Hoare triple {2420#(and (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 3) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_main_~j~0_17 Int) (main_~j~0 Int)) (and (<= (+ main_~j~0 1) v_main_~j~0_17) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) 0) (= v_main_~j~0_17 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_17) 16))) (<= v_main_~j~0_17 2))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {2304#|main_#t~short7|} is VALID [2018-11-23 12:19:53,219 INFO L273 TraceCheckUtils]: 35: Hoare triple {2304#|main_#t~short7|} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {2288#false} is VALID [2018-11-23 12:19:53,219 INFO L256 TraceCheckUtils]: 36: Hoare triple {2288#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {2288#false} is VALID [2018-11-23 12:19:53,219 INFO L273 TraceCheckUtils]: 37: Hoare triple {2288#false} ~cond := #in~cond; {2288#false} is VALID [2018-11-23 12:19:53,219 INFO L273 TraceCheckUtils]: 38: Hoare triple {2288#false} assume 0 == ~cond; {2288#false} is VALID [2018-11-23 12:19:53,220 INFO L273 TraceCheckUtils]: 39: Hoare triple {2288#false} assume !false; {2288#false} is VALID [2018-11-23 12:19:53,229 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:19:53,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:19:53,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 32 [2018-11-23 12:19:53,249 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40 [2018-11-23 12:19:53,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:53,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 12:19:53,439 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:53,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 12:19:53,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 12:19:53,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=850, Unknown=0, NotChecked=0, Total=992 [2018-11-23 12:19:53,440 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 32 states. [2018-11-23 12:19:58,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:58,197 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2018-11-23 12:19:58,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 12:19:58,197 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40 [2018-11-23 12:19:58,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:19:58,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:19:58,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 103 transitions. [2018-11-23 12:19:58,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:19:58,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 103 transitions. [2018-11-23 12:19:58,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 103 transitions. [2018-11-23 12:19:58,386 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:58,389 INFO L225 Difference]: With dead ends: 105 [2018-11-23 12:19:58,389 INFO L226 Difference]: Without dead ends: 89 [2018-11-23 12:19:58,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 699 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=404, Invalid=2248, Unknown=0, NotChecked=0, Total=2652 [2018-11-23 12:19:58,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-23 12:19:58,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2018-11-23 12:19:58,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:19:58,633 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 78 states. [2018-11-23 12:19:58,633 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 78 states. [2018-11-23 12:19:58,633 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 78 states. [2018-11-23 12:19:58,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:58,637 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2018-11-23 12:19:58,637 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2018-11-23 12:19:58,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:58,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:58,638 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 89 states. [2018-11-23 12:19:58,638 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 89 states. [2018-11-23 12:19:58,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:58,641 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2018-11-23 12:19:58,641 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2018-11-23 12:19:58,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:58,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:58,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:19:58,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:19:58,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-23 12:19:58,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2018-11-23 12:19:58,644 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 40 [2018-11-23 12:19:58,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:19:58,644 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2018-11-23 12:19:58,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 12:19:58,645 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2018-11-23 12:19:58,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 12:19:58,645 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:58,645 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:19:58,646 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:58,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:58,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1554540967, now seen corresponding path program 3 times [2018-11-23 12:19:58,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:58,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:58,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:58,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:58,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:59,554 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: zero is neutral element of plus operator at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:87) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:154) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) 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:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) 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-23 12:19:59,561 INFO L168 Benchmark]: Toolchain (without parser) took 27758.54 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -528.5 MB). Peak memory consumption was 536.8 MB. Max. memory is 7.1 GB. [2018-11-23 12:19:59,562 INFO L168 Benchmark]: CDTParser took 0.26 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-23 12:19:59,563 INFO L168 Benchmark]: CACSL2BoogieTranslator took 369.09 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-23 12:19:59,563 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.70 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-23 12:19:59,564 INFO L168 Benchmark]: Boogie Preprocessor took 39.41 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-23 12:19:59,564 INFO L168 Benchmark]: RCFGBuilder took 787.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 727.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -761.9 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-23 12:19:59,565 INFO L168 Benchmark]: TraceAbstraction took 26533.63 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 337.6 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 222.8 MB). Peak memory consumption was 560.4 MB. Max. memory is 7.1 GB. [2018-11-23 12:19:59,568 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.26 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 369.09 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 Procedure Inliner took 23.70 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. * Boogie Preprocessor took 39.41 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 787.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 727.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -761.9 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26533.63 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 337.6 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 222.8 MB). Peak memory consumption was 560.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: zero is neutral element of plus operator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: zero is neutral element of plus operator: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:87) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...