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/nr5_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:19:34,445 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:19:34,447 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:19:34,464 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:19:34,465 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:19:34,466 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:19:34,467 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:19:34,469 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:19:34,471 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:19:34,472 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:19:34,473 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:19:34,474 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:19:34,474 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:19:34,475 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:19:34,477 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:19:34,478 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:19:34,478 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:19:34,484 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:19:34,488 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:19:34,490 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:19:34,493 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:19:34,494 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:19:34,503 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:19:34,503 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:19:34,503 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:19:34,505 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:19:34,509 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:19:34,510 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:19:34,513 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:19:34,514 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:19:34,515 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:19:34,515 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:19:34,516 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:19:34,516 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:19:34,519 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:19:34,519 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:19:34,521 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:34,538 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:19:34,541 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:19:34,542 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:19:34,542 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:19:34,542 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:19:34,543 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:19:34,543 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:19:34,543 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:19:34,543 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:19:34,545 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:19:34,545 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:19:34,546 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:19:34,546 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:19:34,546 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:19:34,546 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:19:34,546 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:19:34,547 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:19:34,547 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:19:34,547 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:19:34,547 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:19:34,547 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:19:34,548 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:19:34,548 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:19:34,548 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:19:34,548 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:19:34,548 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:19:34,550 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:19:34,550 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:19:34,550 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:19:34,551 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:19:34,551 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:19:34,623 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:19:34,644 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:19:34,648 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:19:34,650 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:19:34,650 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:19:34,651 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/nr5_true-unreach-call.i [2018-11-23 12:19:34,723 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d86de6640/5eaf3de267934ba09573a4b0dad682d4/FLAG2d29b55be [2018-11-23 12:19:35,221 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:19:35,222 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/nr5_true-unreach-call.i [2018-11-23 12:19:35,229 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d86de6640/5eaf3de267934ba09573a4b0dad682d4/FLAG2d29b55be [2018-11-23 12:19:35,554 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d86de6640/5eaf3de267934ba09573a4b0dad682d4 [2018-11-23 12:19:35,564 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:19:35,565 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:19:35,566 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:19:35,566 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:19:35,570 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:19:35,572 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:19:35" (1/1) ... [2018-11-23 12:19:35,575 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2690c4ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:35, skipping insertion in model container [2018-11-23 12:19:35,575 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:19:35" (1/1) ... [2018-11-23 12:19:35,586 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:19:35,609 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:19:35,882 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:19:35,891 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:19:35,935 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:19:35,966 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:19:35,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:35 WrapperNode [2018-11-23 12:19:35,967 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:19:35,968 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:19:35,968 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:19:35,969 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:19:35,979 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:35" (1/1) ... [2018-11-23 12:19:35,991 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:35" (1/1) ... [2018-11-23 12:19:36,001 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:19:36,002 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:19:36,002 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:19:36,002 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:19:36,013 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:35" (1/1) ... [2018-11-23 12:19:36,013 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:35" (1/1) ... [2018-11-23 12:19:36,015 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:35" (1/1) ... [2018-11-23 12:19:36,016 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:35" (1/1) ... [2018-11-23 12:19:36,036 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:35" (1/1) ... [2018-11-23 12:19:36,048 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:35" (1/1) ... [2018-11-23 12:19:36,050 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:35" (1/1) ... [2018-11-23 12:19:36,052 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:19:36,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:19:36,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:19:36,053 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:19:36,054 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:35" (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:36,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:19:36,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:19:36,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:19:36,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:19:36,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:19:36,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:19:36,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:19:36,182 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:19:36,182 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:19:36,182 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:19:36,183 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:19:36,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:19:36,858 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:19:36,859 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:19:36,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:19:36 BoogieIcfgContainer [2018-11-23 12:19:36,860 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:19:36,861 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:19:36,861 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:19:36,864 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:19:36,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:19:35" (1/3) ... [2018-11-23 12:19:36,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ee9199c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:19:36, skipping insertion in model container [2018-11-23 12:19:36,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:35" (2/3) ... [2018-11-23 12:19:36,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ee9199c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:19:36, skipping insertion in model container [2018-11-23 12:19:36,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:19:36" (3/3) ... [2018-11-23 12:19:36,869 INFO L112 eAbstractionObserver]: Analyzing ICFG nr5_true-unreach-call.i [2018-11-23 12:19:36,880 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:19:36,887 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:19:36,907 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:19:36,941 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:19:36,942 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:19:36,943 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:19:36,943 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:19:36,944 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:19:36,944 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:19:36,944 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:19:36,945 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:19:36,945 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:19:36,964 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-23 12:19:36,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:19:36,971 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:36,972 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:36,975 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:36,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:36,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1453831941, now seen corresponding path program 1 times [2018-11-23 12:19:36,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:36,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:37,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:37,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:37,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:37,566 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-23 12:19:37,570 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:37,571 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:19:37,572 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #83#return; {34#true} is VALID [2018-11-23 12:19:37,572 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret8 := main(); {34#true} is VALID [2018-11-23 12:19:37,573 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:37,573 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {34#true} is VALID [2018-11-23 12:19:37,573 INFO L273 TraceCheckUtils]: 7: Hoare triple {34#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) then 1 else 0);~i~0 := 1; {34#true} is VALID [2018-11-23 12:19:37,574 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#true} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then 1 + ~CELLCOUNT~0 / 5 else ~CELLCOUNT~0 / 5)); {34#true} is VALID [2018-11-23 12:19:37,574 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#true} ~i~0 := 0; {34#true} is VALID [2018-11-23 12:19:37,574 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:37,579 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#true} assume #t~short7; {36#|main_#t~short7|} is VALID [2018-11-23 12:19:37,580 INFO L256 TraceCheckUtils]: 12: Hoare triple {36#|main_#t~short7|} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {37#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2018-11-23 12:19:37,585 INFO L273 TraceCheckUtils]: 13: Hoare triple {37#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {38#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:19:37,588 INFO L273 TraceCheckUtils]: 14: Hoare triple {38#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {35#false} is VALID [2018-11-23 12:19:37,588 INFO L273 TraceCheckUtils]: 15: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-23 12:19:37,591 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:37,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:19:37,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:19:37,598 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 12:19:37,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:37,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:19:37,703 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:37,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:19:37,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:19:37,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:19:37,714 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 5 states. [2018-11-23 12:19:38,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:38,266 INFO L93 Difference]: Finished difference Result 60 states and 81 transitions. [2018-11-23 12:19:38,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:19:38,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 12:19:38,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:19:38,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:19:38,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2018-11-23 12:19:38,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:19:38,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2018-11-23 12:19:38,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 81 transitions. [2018-11-23 12:19:38,813 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:38,827 INFO L225 Difference]: With dead ends: 60 [2018-11-23 12:19:38,827 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 12:19:38,831 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:38,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 12:19:38,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-23 12:19:38,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:19:38,876 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 30 states. [2018-11-23 12:19:38,877 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 30 states. [2018-11-23 12:19:38,877 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 30 states. [2018-11-23 12:19:38,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:38,883 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-23 12:19:38,883 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 12:19:38,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:38,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:38,884 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 31 states. [2018-11-23 12:19:38,885 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 31 states. [2018-11-23 12:19:38,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:38,889 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-23 12:19:38,889 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 12:19:38,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:38,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:38,890 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:19:38,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:19:38,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:19:38,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-11-23 12:19:38,896 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 16 [2018-11-23 12:19:38,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:19:38,896 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-23 12:19:38,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:19:38,897 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 12:19:38,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:19:38,898 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:38,898 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:38,898 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:38,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:38,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1455678983, now seen corresponding path program 1 times [2018-11-23 12:19:38,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:38,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:38,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:38,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:38,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:39,097 INFO L256 TraceCheckUtils]: 0: Hoare triple {222#true} call ULTIMATE.init(); {222#true} is VALID [2018-11-23 12:19:39,097 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:39,098 INFO L273 TraceCheckUtils]: 2: Hoare triple {222#true} assume true; {222#true} is VALID [2018-11-23 12:19:39,098 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {222#true} {222#true} #83#return; {222#true} is VALID [2018-11-23 12:19:39,099 INFO L256 TraceCheckUtils]: 4: Hoare triple {222#true} call #t~ret8 := main(); {222#true} is VALID [2018-11-23 12:19:39,099 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:39,101 INFO L273 TraceCheckUtils]: 6: Hoare triple {222#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {224#(<= 2 ~CELLCOUNT~0)} is VALID [2018-11-23 12:19:39,105 INFO L273 TraceCheckUtils]: 7: Hoare triple {224#(<= 2 ~CELLCOUNT~0)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) then 1 else 0);~i~0 := 1; {225#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-23 12:19:39,107 INFO L273 TraceCheckUtils]: 8: Hoare triple {225#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then 1 + ~CELLCOUNT~0 / 5 else ~CELLCOUNT~0 / 5)); {223#false} is VALID [2018-11-23 12:19:39,107 INFO L273 TraceCheckUtils]: 9: Hoare triple {223#false} ~i~0 := 0; {223#false} is VALID [2018-11-23 12:19:39,107 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:39,108 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:39,108 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:39,108 INFO L273 TraceCheckUtils]: 13: Hoare triple {223#false} ~cond := #in~cond; {223#false} is VALID [2018-11-23 12:19:39,109 INFO L273 TraceCheckUtils]: 14: Hoare triple {223#false} assume 0 == ~cond; {223#false} is VALID [2018-11-23 12:19:39,109 INFO L273 TraceCheckUtils]: 15: Hoare triple {223#false} assume !false; {223#false} is VALID [2018-11-23 12:19:39,111 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:39,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:19:39,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:19:39,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-23 12:19:39,113 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:39,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:19:39,152 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:39,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:19:39,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:19:39,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:19:39,154 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 4 states. [2018-11-23 12:19:39,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:39,399 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-23 12:19:39,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:19:39,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-23 12:19:39,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:19:39,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:19:39,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2018-11-23 12:19:39,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:19:39,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2018-11-23 12:19:39,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2018-11-23 12:19:39,503 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:39,507 INFO L225 Difference]: With dead ends: 52 [2018-11-23 12:19:39,507 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 12:19:39,508 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:39,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 12:19:39,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2018-11-23 12:19:39,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:19:39,550 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 31 states. [2018-11-23 12:19:39,550 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 31 states. [2018-11-23 12:19:39,550 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 31 states. [2018-11-23 12:19:39,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:39,555 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-11-23 12:19:39,555 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-23 12:19:39,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:39,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:39,556 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 35 states. [2018-11-23 12:19:39,556 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 35 states. [2018-11-23 12:19:39,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:39,559 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-11-23 12:19:39,560 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-23 12:19:39,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:39,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:39,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:19:39,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:19:39,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:19:39,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-23 12:19:39,563 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 16 [2018-11-23 12:19:39,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:19:39,564 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-23 12:19:39,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:19:39,564 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 12:19:39,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:19:39,565 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:39,565 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:39,566 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:39,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:39,566 INFO L82 PathProgramCache]: Analyzing trace with hash -2089835012, now seen corresponding path program 1 times [2018-11-23 12:19:39,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:39,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:39,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:39,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:39,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:39,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:39,625 INFO L256 TraceCheckUtils]: 0: Hoare triple {411#true} call ULTIMATE.init(); {411#true} is VALID [2018-11-23 12:19:39,626 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:39,626 INFO L273 TraceCheckUtils]: 2: Hoare triple {411#true} assume true; {411#true} is VALID [2018-11-23 12:19:39,627 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {411#true} {411#true} #83#return; {411#true} is VALID [2018-11-23 12:19:39,627 INFO L256 TraceCheckUtils]: 4: Hoare triple {411#true} call #t~ret8 := main(); {411#true} is VALID [2018-11-23 12:19:39,627 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:39,628 INFO L273 TraceCheckUtils]: 6: Hoare triple {411#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {411#true} is VALID [2018-11-23 12:19:39,628 INFO L273 TraceCheckUtils]: 7: Hoare triple {411#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) then 1 else 0);~i~0 := 1; {411#true} is VALID [2018-11-23 12:19:39,629 INFO L273 TraceCheckUtils]: 8: Hoare triple {411#true} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then 1 + ~CELLCOUNT~0 / 5 else ~CELLCOUNT~0 / 5));~j~0 := 5; {413#(<= 5 main_~j~0)} is VALID [2018-11-23 12:19:39,630 INFO L273 TraceCheckUtils]: 9: Hoare triple {413#(<= 5 main_~j~0)} assume !(~j~0 >= 1); {412#false} is VALID [2018-11-23 12:19:39,630 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:39,630 INFO L273 TraceCheckUtils]: 11: Hoare triple {412#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then 1 + ~CELLCOUNT~0 / 5 else ~CELLCOUNT~0 / 5)); {412#false} is VALID [2018-11-23 12:19:39,631 INFO L273 TraceCheckUtils]: 12: Hoare triple {412#false} ~i~0 := 0; {412#false} is VALID [2018-11-23 12:19:39,631 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:39,631 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:39,632 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:39,632 INFO L273 TraceCheckUtils]: 16: Hoare triple {412#false} ~cond := #in~cond; {412#false} is VALID [2018-11-23 12:19:39,632 INFO L273 TraceCheckUtils]: 17: Hoare triple {412#false} assume 0 == ~cond; {412#false} is VALID [2018-11-23 12:19:39,633 INFO L273 TraceCheckUtils]: 18: Hoare triple {412#false} assume !false; {412#false} is VALID [2018-11-23 12:19:39,634 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:39,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:19:39,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:19:39,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:19:39,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:39,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:19:39,677 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:39,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:19:39,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:19:39,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:19:39,679 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 3 states. [2018-11-23 12:19:39,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:39,843 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-11-23 12:19:39,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:19:39,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:19:39,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:19:39,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:19:39,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:19:39,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:19:39,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:19:39,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2018-11-23 12:19:39,983 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,986 INFO L225 Difference]: With dead ends: 56 [2018-11-23 12:19:39,986 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:19:39,987 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:39,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:19:40,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-23 12:19:40,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:19:40,020 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2018-11-23 12:19:40,020 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2018-11-23 12:19:40,021 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2018-11-23 12:19:40,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:40,024 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-23 12:19:40,024 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-23 12:19:40,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:40,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:40,026 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2018-11-23 12:19:40,026 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2018-11-23 12:19:40,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:40,031 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-23 12:19:40,035 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-23 12:19:40,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:40,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:40,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:19:40,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:19:40,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:19:40,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-11-23 12:19:40,040 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2018-11-23 12:19:40,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:19:40,042 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-23 12:19:40,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:19:40,043 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:19:40,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:19:40,043 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:40,045 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:40,045 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:40,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:40,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1382648830, now seen corresponding path program 1 times [2018-11-23 12:19:40,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:40,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:40,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:40,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:40,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:40,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:40,186 INFO L256 TraceCheckUtils]: 0: Hoare triple {605#true} call ULTIMATE.init(); {605#true} is VALID [2018-11-23 12:19:40,187 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:40,187 INFO L273 TraceCheckUtils]: 2: Hoare triple {605#true} assume true; {605#true} is VALID [2018-11-23 12:19:40,187 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {605#true} {605#true} #83#return; {605#true} is VALID [2018-11-23 12:19:40,188 INFO L256 TraceCheckUtils]: 4: Hoare triple {605#true} call #t~ret8 := main(); {605#true} is VALID [2018-11-23 12:19:40,188 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:40,189 INFO L273 TraceCheckUtils]: 6: Hoare triple {605#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {607#(<= main_~MINVAL~0 2)} is VALID [2018-11-23 12:19:40,192 INFO L273 TraceCheckUtils]: 7: Hoare triple {607#(<= main_~MINVAL~0 2)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) then 1 else 0);~i~0 := 1; {607#(<= main_~MINVAL~0 2)} is VALID [2018-11-23 12:19:40,193 INFO L273 TraceCheckUtils]: 8: Hoare triple {607#(<= main_~MINVAL~0 2)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then 1 + ~CELLCOUNT~0 / 5 else ~CELLCOUNT~0 / 5));~j~0 := 5; {608#(<= (+ main_~MINVAL~0 3) main_~j~0)} is VALID [2018-11-23 12:19:40,198 INFO L273 TraceCheckUtils]: 9: Hoare triple {608#(<= (+ main_~MINVAL~0 3) main_~j~0)} assume !!(~j~0 >= 1); {608#(<= (+ main_~MINVAL~0 3) main_~j~0)} is VALID [2018-11-23 12:19:40,199 INFO L273 TraceCheckUtils]: 10: Hoare triple {608#(<= (+ main_~MINVAL~0 3) main_~j~0)} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (5 * ~i~0 - ~j~0), 4); {606#false} is VALID [2018-11-23 12:19:40,199 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:40,199 INFO L273 TraceCheckUtils]: 12: Hoare triple {606#false} assume !(~j~0 >= 1); {606#false} is VALID [2018-11-23 12:19:40,200 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:40,200 INFO L273 TraceCheckUtils]: 14: Hoare triple {606#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then 1 + ~CELLCOUNT~0 / 5 else ~CELLCOUNT~0 / 5)); {606#false} is VALID [2018-11-23 12:19:40,200 INFO L273 TraceCheckUtils]: 15: Hoare triple {606#false} ~i~0 := 0; {606#false} is VALID [2018-11-23 12:19:40,201 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:40,201 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:40,202 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:40,202 INFO L273 TraceCheckUtils]: 19: Hoare triple {606#false} ~cond := #in~cond; {606#false} is VALID [2018-11-23 12:19:40,203 INFO L273 TraceCheckUtils]: 20: Hoare triple {606#false} assume 0 == ~cond; {606#false} is VALID [2018-11-23 12:19:40,203 INFO L273 TraceCheckUtils]: 21: Hoare triple {606#false} assume !false; {606#false} is VALID [2018-11-23 12:19:40,204 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:40,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:19:40,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:19:40,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-23 12:19:40,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:40,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:19:40,271 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:40,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:19:40,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:19:40,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:19:40,272 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 4 states. [2018-11-23 12:19:40,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:40,430 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2018-11-23 12:19:40,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:19:40,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-23 12:19:40,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:19:40,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:19:40,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2018-11-23 12:19:40,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:19:40,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2018-11-23 12:19:40,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 54 transitions. [2018-11-23 12:19:40,523 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:40,525 INFO L225 Difference]: With dead ends: 57 [2018-11-23 12:19:40,525 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:19:40,526 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:40,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:19:40,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 12:19:40,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:19:40,565 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-23 12:19:40,565 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-23 12:19:40,565 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-23 12:19:40,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:40,567 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:19:40,568 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:19:40,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:40,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:40,568 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-23 12:19:40,569 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-23 12:19:40,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:40,571 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:19:40,571 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:19:40,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:40,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:40,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:19:40,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:19:40,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:19:40,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 12:19:40,575 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 22 [2018-11-23 12:19:40,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:19:40,575 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 12:19:40,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:19:40,575 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 12:19:40,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:19:40,576 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:40,576 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:40,577 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:40,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:40,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1124483392, now seen corresponding path program 1 times [2018-11-23 12:19:40,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:40,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:40,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:40,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:40,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:40,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:40,667 INFO L256 TraceCheckUtils]: 0: Hoare triple {805#true} call ULTIMATE.init(); {805#true} is VALID [2018-11-23 12:19:40,668 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:40,668 INFO L273 TraceCheckUtils]: 2: Hoare triple {805#true} assume true; {805#true} is VALID [2018-11-23 12:19:40,668 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {805#true} {805#true} #83#return; {805#true} is VALID [2018-11-23 12:19:40,668 INFO L256 TraceCheckUtils]: 4: Hoare triple {805#true} call #t~ret8 := main(); {805#true} is VALID [2018-11-23 12:19:40,669 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:40,669 INFO L273 TraceCheckUtils]: 6: Hoare triple {805#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {805#true} is VALID [2018-11-23 12:19:40,669 INFO L273 TraceCheckUtils]: 7: Hoare triple {805#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) then 1 else 0);~i~0 := 1; {805#true} is VALID [2018-11-23 12:19:40,670 INFO L273 TraceCheckUtils]: 8: Hoare triple {805#true} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then 1 + ~CELLCOUNT~0 / 5 else ~CELLCOUNT~0 / 5));~j~0 := 5; {807#(<= 5 main_~j~0)} is VALID [2018-11-23 12:19:40,672 INFO L273 TraceCheckUtils]: 9: Hoare triple {807#(<= 5 main_~j~0)} assume !!(~j~0 >= 1); {807#(<= 5 main_~j~0)} is VALID [2018-11-23 12:19:40,672 INFO L273 TraceCheckUtils]: 10: Hoare triple {807#(<= 5 main_~j~0)} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (5 * ~i~0 - ~j~0), 4); {807#(<= 5 main_~j~0)} is VALID [2018-11-23 12:19:40,673 INFO L273 TraceCheckUtils]: 11: Hoare triple {807#(<= 5 main_~j~0)} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {808#(<= 4 main_~j~0)} is VALID [2018-11-23 12:19:40,674 INFO L273 TraceCheckUtils]: 12: Hoare triple {808#(<= 4 main_~j~0)} assume !(~j~0 >= 1); {806#false} is VALID [2018-11-23 12:19:40,674 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:40,674 INFO L273 TraceCheckUtils]: 14: Hoare triple {806#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then 1 + ~CELLCOUNT~0 / 5 else ~CELLCOUNT~0 / 5)); {806#false} is VALID [2018-11-23 12:19:40,675 INFO L273 TraceCheckUtils]: 15: Hoare triple {806#false} ~i~0 := 0; {806#false} is VALID [2018-11-23 12:19:40,675 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:40,675 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:40,676 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:40,677 INFO L273 TraceCheckUtils]: 19: Hoare triple {806#false} ~cond := #in~cond; {806#false} is VALID [2018-11-23 12:19:40,677 INFO L273 TraceCheckUtils]: 20: Hoare triple {806#false} assume 0 == ~cond; {806#false} is VALID [2018-11-23 12:19:40,678 INFO L273 TraceCheckUtils]: 21: Hoare triple {806#false} assume !false; {806#false} is VALID [2018-11-23 12:19:40,679 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:40,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:19:40,680 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:40,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:40,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:19:41,010 INFO L256 TraceCheckUtils]: 0: Hoare triple {805#true} call ULTIMATE.init(); {805#true} is VALID [2018-11-23 12:19:41,011 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:41,011 INFO L273 TraceCheckUtils]: 2: Hoare triple {805#true} assume true; {805#true} is VALID [2018-11-23 12:19:41,011 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {805#true} {805#true} #83#return; {805#true} is VALID [2018-11-23 12:19:41,011 INFO L256 TraceCheckUtils]: 4: Hoare triple {805#true} call #t~ret8 := main(); {805#true} is VALID [2018-11-23 12:19:41,012 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:41,012 INFO L273 TraceCheckUtils]: 6: Hoare triple {805#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {805#true} is VALID [2018-11-23 12:19:41,012 INFO L273 TraceCheckUtils]: 7: Hoare triple {805#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) then 1 else 0);~i~0 := 1; {805#true} is VALID [2018-11-23 12:19:41,013 INFO L273 TraceCheckUtils]: 8: Hoare triple {805#true} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then 1 + ~CELLCOUNT~0 / 5 else ~CELLCOUNT~0 / 5));~j~0 := 5; {807#(<= 5 main_~j~0)} is VALID [2018-11-23 12:19:41,014 INFO L273 TraceCheckUtils]: 9: Hoare triple {807#(<= 5 main_~j~0)} assume !!(~j~0 >= 1); {807#(<= 5 main_~j~0)} is VALID [2018-11-23 12:19:41,014 INFO L273 TraceCheckUtils]: 10: Hoare triple {807#(<= 5 main_~j~0)} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (5 * ~i~0 - ~j~0), 4); {807#(<= 5 main_~j~0)} is VALID [2018-11-23 12:19:41,019 INFO L273 TraceCheckUtils]: 11: Hoare triple {807#(<= 5 main_~j~0)} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {808#(<= 4 main_~j~0)} is VALID [2018-11-23 12:19:41,020 INFO L273 TraceCheckUtils]: 12: Hoare triple {808#(<= 4 main_~j~0)} assume !(~j~0 >= 1); {806#false} is VALID [2018-11-23 12:19:41,020 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:41,020 INFO L273 TraceCheckUtils]: 14: Hoare triple {806#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then 1 + ~CELLCOUNT~0 / 5 else ~CELLCOUNT~0 / 5)); {806#false} is VALID [2018-11-23 12:19:41,021 INFO L273 TraceCheckUtils]: 15: Hoare triple {806#false} ~i~0 := 0; {806#false} is VALID [2018-11-23 12:19:41,021 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:41,021 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:41,021 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:41,022 INFO L273 TraceCheckUtils]: 19: Hoare triple {806#false} ~cond := #in~cond; {806#false} is VALID [2018-11-23 12:19:41,022 INFO L273 TraceCheckUtils]: 20: Hoare triple {806#false} assume 0 == ~cond; {806#false} is VALID [2018-11-23 12:19:41,022 INFO L273 TraceCheckUtils]: 21: Hoare triple {806#false} assume !false; {806#false} is VALID [2018-11-23 12:19:41,024 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:41,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:19:41,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-23 12:19:41,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-23 12:19:41,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:41,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:19:41,083 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:41,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:19:41,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:19:41,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:19:41,084 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2018-11-23 12:19:41,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:41,452 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2018-11-23 12:19:41,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:19:41,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-23 12:19:41,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:19:41,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:19:41,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2018-11-23 12:19:41,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:19:41,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2018-11-23 12:19:41,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 58 transitions. [2018-11-23 12:19:41,653 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:41,655 INFO L225 Difference]: With dead ends: 61 [2018-11-23 12:19:41,655 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 12:19:41,656 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:41,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 12:19:41,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-11-23 12:19:41,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:19:41,735 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 35 states. [2018-11-23 12:19:41,735 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 35 states. [2018-11-23 12:19:41,735 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 35 states. [2018-11-23 12:19:41,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:41,737 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-23 12:19:41,737 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-23 12:19:41,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:41,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:41,738 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 37 states. [2018-11-23 12:19:41,738 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 37 states. [2018-11-23 12:19:41,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:41,741 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-23 12:19:41,741 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-23 12:19:41,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:41,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:41,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:19:41,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:19:41,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:19:41,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-23 12:19:41,744 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 22 [2018-11-23 12:19:41,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:19:41,745 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-23 12:19:41,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:19:41,745 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 12:19:41,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:19:41,746 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:41,746 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:41,746 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:41,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:41,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1448609222, now seen corresponding path program 1 times [2018-11-23 12:19:41,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:41,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:41,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:41,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:41,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:41,901 INFO L256 TraceCheckUtils]: 0: Hoare triple {1080#true} call ULTIMATE.init(); {1080#true} is VALID [2018-11-23 12:19:41,902 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:41,902 INFO L273 TraceCheckUtils]: 2: Hoare triple {1080#true} assume true; {1080#true} is VALID [2018-11-23 12:19:41,902 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1080#true} {1080#true} #83#return; {1080#true} is VALID [2018-11-23 12:19:41,903 INFO L256 TraceCheckUtils]: 4: Hoare triple {1080#true} call #t~ret8 := main(); {1080#true} is VALID [2018-11-23 12:19:41,903 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:41,903 INFO L273 TraceCheckUtils]: 6: Hoare triple {1080#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {1080#true} is VALID [2018-11-23 12:19:41,904 INFO L273 TraceCheckUtils]: 7: Hoare triple {1080#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) then 1 else 0);~i~0 := 1; {1080#true} is VALID [2018-11-23 12:19:41,917 INFO L273 TraceCheckUtils]: 8: Hoare triple {1080#true} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then 1 + ~CELLCOUNT~0 / 5 else ~CELLCOUNT~0 / 5));~j~0 := 5; {1082#(<= 5 main_~j~0)} is VALID [2018-11-23 12:19:41,919 INFO L273 TraceCheckUtils]: 9: Hoare triple {1082#(<= 5 main_~j~0)} assume !!(~j~0 >= 1); {1082#(<= 5 main_~j~0)} is VALID [2018-11-23 12:19:41,919 INFO L273 TraceCheckUtils]: 10: Hoare triple {1082#(<= 5 main_~j~0)} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (5 * ~i~0 - ~j~0), 4); {1082#(<= 5 main_~j~0)} is VALID [2018-11-23 12:19:41,923 INFO L273 TraceCheckUtils]: 11: Hoare triple {1082#(<= 5 main_~j~0)} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1083#(<= 4 main_~j~0)} is VALID [2018-11-23 12:19:41,928 INFO L273 TraceCheckUtils]: 12: Hoare triple {1083#(<= 4 main_~j~0)} assume !!(~j~0 >= 1); {1083#(<= 4 main_~j~0)} is VALID [2018-11-23 12:19:41,928 INFO L273 TraceCheckUtils]: 13: Hoare triple {1083#(<= 4 main_~j~0)} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (5 * ~i~0 - ~j~0), 4); {1083#(<= 4 main_~j~0)} is VALID [2018-11-23 12:19:41,929 INFO L273 TraceCheckUtils]: 14: Hoare triple {1083#(<= 4 main_~j~0)} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1084#(<= 3 main_~j~0)} is VALID [2018-11-23 12:19:41,930 INFO L273 TraceCheckUtils]: 15: Hoare triple {1084#(<= 3 main_~j~0)} assume !(~j~0 >= 1); {1081#false} is VALID [2018-11-23 12:19:41,930 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:41,930 INFO L273 TraceCheckUtils]: 17: Hoare triple {1081#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then 1 + ~CELLCOUNT~0 / 5 else ~CELLCOUNT~0 / 5)); {1081#false} is VALID [2018-11-23 12:19:41,930 INFO L273 TraceCheckUtils]: 18: Hoare triple {1081#false} ~i~0 := 0; {1081#false} is VALID [2018-11-23 12:19:41,931 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:41,931 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:41,931 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:41,932 INFO L273 TraceCheckUtils]: 22: Hoare triple {1081#false} ~cond := #in~cond; {1081#false} is VALID [2018-11-23 12:19:41,932 INFO L273 TraceCheckUtils]: 23: Hoare triple {1081#false} assume 0 == ~cond; {1081#false} is VALID [2018-11-23 12:19:41,932 INFO L273 TraceCheckUtils]: 24: Hoare triple {1081#false} assume !false; {1081#false} is VALID [2018-11-23 12:19:41,934 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:41,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:19:41,934 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:41,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:42,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:42,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:19:42,179 INFO L256 TraceCheckUtils]: 0: Hoare triple {1080#true} call ULTIMATE.init(); {1080#true} is VALID [2018-11-23 12:19:42,180 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:42,180 INFO L273 TraceCheckUtils]: 2: Hoare triple {1080#true} assume true; {1080#true} is VALID [2018-11-23 12:19:42,180 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1080#true} {1080#true} #83#return; {1080#true} is VALID [2018-11-23 12:19:42,181 INFO L256 TraceCheckUtils]: 4: Hoare triple {1080#true} call #t~ret8 := main(); {1080#true} is VALID [2018-11-23 12:19:42,181 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:42,182 INFO L273 TraceCheckUtils]: 6: Hoare triple {1080#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {1106#(<= main_~MINVAL~0 2)} is VALID [2018-11-23 12:19:42,182 INFO L273 TraceCheckUtils]: 7: Hoare triple {1106#(<= main_~MINVAL~0 2)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) then 1 else 0);~i~0 := 1; {1106#(<= main_~MINVAL~0 2)} is VALID [2018-11-23 12:19:42,183 INFO L273 TraceCheckUtils]: 8: Hoare triple {1106#(<= main_~MINVAL~0 2)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then 1 + ~CELLCOUNT~0 / 5 else ~CELLCOUNT~0 / 5));~j~0 := 5; {1113#(and (<= main_~MINVAL~0 2) (<= 5 main_~j~0))} is VALID [2018-11-23 12:19:42,183 INFO L273 TraceCheckUtils]: 9: Hoare triple {1113#(and (<= main_~MINVAL~0 2) (<= 5 main_~j~0))} assume !!(~j~0 >= 1); {1113#(and (<= main_~MINVAL~0 2) (<= 5 main_~j~0))} is VALID [2018-11-23 12:19:42,184 INFO L273 TraceCheckUtils]: 10: Hoare triple {1113#(and (<= main_~MINVAL~0 2) (<= 5 main_~j~0))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (5 * ~i~0 - ~j~0), 4); {1113#(and (<= main_~MINVAL~0 2) (<= 5 main_~j~0))} is VALID [2018-11-23 12:19:42,185 INFO L273 TraceCheckUtils]: 11: Hoare triple {1113#(and (<= main_~MINVAL~0 2) (<= 5 main_~j~0))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1123#(and (<= 4 main_~j~0) (<= main_~MINVAL~0 2))} is VALID [2018-11-23 12:19:42,186 INFO L273 TraceCheckUtils]: 12: Hoare triple {1123#(and (<= 4 main_~j~0) (<= main_~MINVAL~0 2))} assume !!(~j~0 >= 1); {1123#(and (<= 4 main_~j~0) (<= main_~MINVAL~0 2))} is VALID [2018-11-23 12:19:42,187 INFO L273 TraceCheckUtils]: 13: Hoare triple {1123#(and (<= 4 main_~j~0) (<= main_~MINVAL~0 2))} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (5 * ~i~0 - ~j~0), 4); {1081#false} is VALID [2018-11-23 12:19:42,187 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:42,188 INFO L273 TraceCheckUtils]: 15: Hoare triple {1081#false} assume !(~j~0 >= 1); {1081#false} is VALID [2018-11-23 12:19:42,188 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:42,188 INFO L273 TraceCheckUtils]: 17: Hoare triple {1081#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then 1 + ~CELLCOUNT~0 / 5 else ~CELLCOUNT~0 / 5)); {1081#false} is VALID [2018-11-23 12:19:42,189 INFO L273 TraceCheckUtils]: 18: Hoare triple {1081#false} ~i~0 := 0; {1081#false} is VALID [2018-11-23 12:19:42,189 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:42,189 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:42,190 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:42,190 INFO L273 TraceCheckUtils]: 22: Hoare triple {1081#false} ~cond := #in~cond; {1081#false} is VALID [2018-11-23 12:19:42,190 INFO L273 TraceCheckUtils]: 23: Hoare triple {1081#false} assume 0 == ~cond; {1081#false} is VALID [2018-11-23 12:19:42,191 INFO L273 TraceCheckUtils]: 24: Hoare triple {1081#false} assume !false; {1081#false} is VALID [2018-11-23 12:19:42,192 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:42,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:19:42,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 12:19:42,212 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-23 12:19:42,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:42,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:19:42,254 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:42,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:19:42,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:19:42,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:19:42,255 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 8 states. [2018-11-23 12:19:42,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:42,576 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2018-11-23 12:19:42,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:19:42,576 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-23 12:19:42,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:19:42,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:19:42,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2018-11-23 12:19:42,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:19:42,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2018-11-23 12:19:42,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 62 transitions. [2018-11-23 12:19:42,682 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:42,684 INFO L225 Difference]: With dead ends: 66 [2018-11-23 12:19:42,684 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:19:42,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:19:42,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:19:42,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-23 12:19:42,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:19:42,826 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2018-11-23 12:19:42,826 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2018-11-23 12:19:42,826 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2018-11-23 12:19:42,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:42,828 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 12:19:42,828 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 12:19:42,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:42,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:42,828 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2018-11-23 12:19:42,828 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2018-11-23 12:19:42,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:42,831 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 12:19:42,831 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 12:19:42,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:42,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:42,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:19:42,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:19:42,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:19:42,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-23 12:19:42,834 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 25 [2018-11-23 12:19:42,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:19:42,835 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-23 12:19:42,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:19:42,835 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:19:42,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:19:42,836 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:42,836 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:42,836 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:42,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:42,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1147324352, now seen corresponding path program 2 times [2018-11-23 12:19:42,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:42,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:42,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:42,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:42,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:43,121 INFO L256 TraceCheckUtils]: 0: Hoare triple {1388#true} call ULTIMATE.init(); {1388#true} is VALID [2018-11-23 12:19:43,121 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:43,122 INFO L273 TraceCheckUtils]: 2: Hoare triple {1388#true} assume true; {1388#true} is VALID [2018-11-23 12:19:43,122 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1388#true} {1388#true} #83#return; {1388#true} is VALID [2018-11-23 12:19:43,122 INFO L256 TraceCheckUtils]: 4: Hoare triple {1388#true} call #t~ret8 := main(); {1388#true} is VALID [2018-11-23 12:19:43,123 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:43,140 INFO L273 TraceCheckUtils]: 6: Hoare triple {1388#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {1390#(<= 2 main_~MINVAL~0)} is VALID [2018-11-23 12:19:43,149 INFO L273 TraceCheckUtils]: 7: Hoare triple {1390#(<= 2 main_~MINVAL~0)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) then 1 else 0);~i~0 := 1; {1390#(<= 2 main_~MINVAL~0)} is VALID [2018-11-23 12:19:43,150 INFO L273 TraceCheckUtils]: 8: Hoare triple {1390#(<= 2 main_~MINVAL~0)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then 1 + ~CELLCOUNT~0 / 5 else ~CELLCOUNT~0 / 5));~j~0 := 5; {1390#(<= 2 main_~MINVAL~0)} is VALID [2018-11-23 12:19:43,151 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:43,151 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 * (5 * ~i~0 - ~j~0), 4); {1390#(<= 2 main_~MINVAL~0)} is VALID [2018-11-23 12:19:43,154 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:43,154 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:43,156 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 * (5 * ~i~0 - ~j~0), 4); {1390#(<= 2 main_~MINVAL~0)} is VALID [2018-11-23 12:19:43,157 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:43,157 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:43,158 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 * (5 * ~i~0 - ~j~0), 4); {1391#(<= 2 main_~j~0)} is VALID [2018-11-23 12:19:43,158 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:43,159 INFO L273 TraceCheckUtils]: 18: Hoare triple {1392#(<= 1 main_~j~0)} assume !(~j~0 >= 1); {1389#false} is VALID [2018-11-23 12:19:43,159 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:43,160 INFO L273 TraceCheckUtils]: 20: Hoare triple {1389#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then 1 + ~CELLCOUNT~0 / 5 else ~CELLCOUNT~0 / 5)); {1389#false} is VALID [2018-11-23 12:19:43,160 INFO L273 TraceCheckUtils]: 21: Hoare triple {1389#false} ~i~0 := 0; {1389#false} is VALID [2018-11-23 12:19:43,161 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:43,161 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:43,162 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:43,162 INFO L273 TraceCheckUtils]: 25: Hoare triple {1389#false} ~cond := #in~cond; {1389#false} is VALID [2018-11-23 12:19:43,162 INFO L273 TraceCheckUtils]: 26: Hoare triple {1389#false} assume 0 == ~cond; {1389#false} is VALID [2018-11-23 12:19:43,163 INFO L273 TraceCheckUtils]: 27: Hoare triple {1389#false} assume !false; {1389#false} is VALID [2018-11-23 12:19:43,164 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:43,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:19:43,165 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:43,183 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:19:43,209 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:19:43,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:19:43,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:43,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:19:43,304 INFO L256 TraceCheckUtils]: 0: Hoare triple {1388#true} call ULTIMATE.init(); {1388#true} is VALID [2018-11-23 12:19:43,305 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:43,305 INFO L273 TraceCheckUtils]: 2: Hoare triple {1388#true} assume true; {1388#true} is VALID [2018-11-23 12:19:43,305 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1388#true} {1388#true} #83#return; {1388#true} is VALID [2018-11-23 12:19:43,306 INFO L256 TraceCheckUtils]: 4: Hoare triple {1388#true} call #t~ret8 := main(); {1388#true} is VALID [2018-11-23 12:19:43,306 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:43,307 INFO L273 TraceCheckUtils]: 6: Hoare triple {1388#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {1390#(<= 2 main_~MINVAL~0)} is VALID [2018-11-23 12:19:43,308 INFO L273 TraceCheckUtils]: 7: Hoare triple {1390#(<= 2 main_~MINVAL~0)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) then 1 else 0);~i~0 := 1; {1390#(<= 2 main_~MINVAL~0)} is VALID [2018-11-23 12:19:43,313 INFO L273 TraceCheckUtils]: 8: Hoare triple {1390#(<= 2 main_~MINVAL~0)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then 1 + ~CELLCOUNT~0 / 5 else ~CELLCOUNT~0 / 5));~j~0 := 5; {1390#(<= 2 main_~MINVAL~0)} is VALID [2018-11-23 12:19:43,314 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:43,315 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 * (5 * ~i~0 - ~j~0), 4); {1390#(<= 2 main_~MINVAL~0)} is VALID [2018-11-23 12:19:43,315 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:43,316 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:43,321 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 * (5 * ~i~0 - ~j~0), 4); {1390#(<= 2 main_~MINVAL~0)} is VALID [2018-11-23 12:19:43,322 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:43,322 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:43,324 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 * (5 * ~i~0 - ~j~0), 4); {1391#(<= 2 main_~j~0)} is VALID [2018-11-23 12:19:43,324 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:43,326 INFO L273 TraceCheckUtils]: 18: Hoare triple {1392#(<= 1 main_~j~0)} assume !(~j~0 >= 1); {1389#false} is VALID [2018-11-23 12:19:43,326 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:43,326 INFO L273 TraceCheckUtils]: 20: Hoare triple {1389#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then 1 + ~CELLCOUNT~0 / 5 else ~CELLCOUNT~0 / 5)); {1389#false} is VALID [2018-11-23 12:19:43,327 INFO L273 TraceCheckUtils]: 21: Hoare triple {1389#false} ~i~0 := 0; {1389#false} is VALID [2018-11-23 12:19:43,327 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:43,328 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:43,328 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:43,328 INFO L273 TraceCheckUtils]: 25: Hoare triple {1389#false} ~cond := #in~cond; {1389#false} is VALID [2018-11-23 12:19:43,329 INFO L273 TraceCheckUtils]: 26: Hoare triple {1389#false} assume 0 == ~cond; {1389#false} is VALID [2018-11-23 12:19:43,329 INFO L273 TraceCheckUtils]: 27: Hoare triple {1389#false} assume !false; {1389#false} is VALID [2018-11-23 12:19:43,330 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:43,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:19:43,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-23 12:19:43,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-23 12:19:43,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:43,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:19:43,379 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:43,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:19:43,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:19:43,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:19:43,381 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2018-11-23 12:19:43,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:43,558 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2018-11-23 12:19:43,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:19:43,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-23 12:19:43,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:19:43,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:19:43,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2018-11-23 12:19:43,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:19:43,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2018-11-23 12:19:43,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2018-11-23 12:19:43,665 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:43,667 INFO L225 Difference]: With dead ends: 71 [2018-11-23 12:19:43,667 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 12:19:43,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:19:43,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 12:19:43,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-23 12:19:43,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:19:43,759 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 41 states. [2018-11-23 12:19:43,759 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-23 12:19:43,760 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-23 12:19:43,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:43,762 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-11-23 12:19:43,762 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-23 12:19:43,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:43,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:43,762 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-23 12:19:43,762 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-23 12:19:43,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:43,764 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-11-23 12:19:43,764 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-23 12:19:43,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:43,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:43,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:19:43,765 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:19:43,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:19:43,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-23 12:19:43,767 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 28 [2018-11-23 12:19:43,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:19:43,767 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-23 12:19:43,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:19:43,768 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-23 12:19:43,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:19:43,768 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:43,768 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:43,769 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:43,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:43,769 INFO L82 PathProgramCache]: Analyzing trace with hash 401597370, now seen corresponding path program 2 times [2018-11-23 12:19:43,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:43,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:43,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:43,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:19:43,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:43,918 INFO L256 TraceCheckUtils]: 0: Hoare triple {1716#true} call ULTIMATE.init(); {1716#true} is VALID [2018-11-23 12:19:43,918 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:43,919 INFO L273 TraceCheckUtils]: 2: Hoare triple {1716#true} assume true; {1716#true} is VALID [2018-11-23 12:19:43,919 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1716#true} {1716#true} #83#return; {1716#true} is VALID [2018-11-23 12:19:43,919 INFO L256 TraceCheckUtils]: 4: Hoare triple {1716#true} call #t~ret8 := main(); {1716#true} is VALID [2018-11-23 12:19:43,920 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:43,920 INFO L273 TraceCheckUtils]: 6: Hoare triple {1716#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {1716#true} is VALID [2018-11-23 12:19:43,920 INFO L273 TraceCheckUtils]: 7: Hoare triple {1716#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) then 1 else 0);~i~0 := 1; {1716#true} is VALID [2018-11-23 12:19:43,925 INFO L273 TraceCheckUtils]: 8: Hoare triple {1716#true} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then 1 + ~CELLCOUNT~0 / 5 else ~CELLCOUNT~0 / 5));~j~0 := 5; {1718#(<= 5 main_~j~0)} is VALID [2018-11-23 12:19:43,925 INFO L273 TraceCheckUtils]: 9: Hoare triple {1718#(<= 5 main_~j~0)} assume !!(~j~0 >= 1); {1718#(<= 5 main_~j~0)} is VALID [2018-11-23 12:19:43,926 INFO L273 TraceCheckUtils]: 10: Hoare triple {1718#(<= 5 main_~j~0)} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (5 * ~i~0 - ~j~0), 4); {1718#(<= 5 main_~j~0)} is VALID [2018-11-23 12:19:43,926 INFO L273 TraceCheckUtils]: 11: Hoare triple {1718#(<= 5 main_~j~0)} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1719#(<= 4 main_~j~0)} is VALID [2018-11-23 12:19:43,927 INFO L273 TraceCheckUtils]: 12: Hoare triple {1719#(<= 4 main_~j~0)} assume !!(~j~0 >= 1); {1719#(<= 4 main_~j~0)} is VALID [2018-11-23 12:19:43,927 INFO L273 TraceCheckUtils]: 13: Hoare triple {1719#(<= 4 main_~j~0)} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (5 * ~i~0 - ~j~0), 4); {1719#(<= 4 main_~j~0)} is VALID [2018-11-23 12:19:43,927 INFO L273 TraceCheckUtils]: 14: Hoare triple {1719#(<= 4 main_~j~0)} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1720#(<= 3 main_~j~0)} is VALID [2018-11-23 12:19:43,928 INFO L273 TraceCheckUtils]: 15: Hoare triple {1720#(<= 3 main_~j~0)} assume !!(~j~0 >= 1); {1720#(<= 3 main_~j~0)} is VALID [2018-11-23 12:19:43,928 INFO L273 TraceCheckUtils]: 16: Hoare triple {1720#(<= 3 main_~j~0)} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (5 * ~i~0 - ~j~0), 4); {1720#(<= 3 main_~j~0)} is VALID [2018-11-23 12:19:43,929 INFO L273 TraceCheckUtils]: 17: Hoare triple {1720#(<= 3 main_~j~0)} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1721#(<= 2 main_~j~0)} is VALID [2018-11-23 12:19:43,930 INFO L273 TraceCheckUtils]: 18: Hoare triple {1721#(<= 2 main_~j~0)} assume !!(~j~0 >= 1); {1721#(<= 2 main_~j~0)} is VALID [2018-11-23 12:19:43,930 INFO L273 TraceCheckUtils]: 19: Hoare triple {1721#(<= 2 main_~j~0)} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (5 * ~i~0 - ~j~0), 4); {1721#(<= 2 main_~j~0)} is VALID [2018-11-23 12:19:43,931 INFO L273 TraceCheckUtils]: 20: Hoare triple {1721#(<= 2 main_~j~0)} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1722#(<= 1 main_~j~0)} is VALID [2018-11-23 12:19:43,932 INFO L273 TraceCheckUtils]: 21: Hoare triple {1722#(<= 1 main_~j~0)} assume !(~j~0 >= 1); {1717#false} is VALID [2018-11-23 12:19:43,932 INFO L273 TraceCheckUtils]: 22: Hoare triple {1717#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1717#false} is VALID [2018-11-23 12:19:43,933 INFO L273 TraceCheckUtils]: 23: Hoare triple {1717#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then 1 + ~CELLCOUNT~0 / 5 else ~CELLCOUNT~0 / 5)); {1717#false} is VALID [2018-11-23 12:19:43,933 INFO L273 TraceCheckUtils]: 24: Hoare triple {1717#false} ~i~0 := 0; {1717#false} is VALID [2018-11-23 12:19:43,933 INFO L273 TraceCheckUtils]: 25: Hoare triple {1717#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; {1717#false} is VALID [2018-11-23 12:19:43,933 INFO L273 TraceCheckUtils]: 26: Hoare triple {1717#false} 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:43,934 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:43,934 INFO L273 TraceCheckUtils]: 28: Hoare triple {1717#false} ~cond := #in~cond; {1717#false} is VALID [2018-11-23 12:19:43,934 INFO L273 TraceCheckUtils]: 29: Hoare triple {1717#false} assume 0 == ~cond; {1717#false} is VALID [2018-11-23 12:19:43,935 INFO L273 TraceCheckUtils]: 30: Hoare triple {1717#false} assume !false; {1717#false} is VALID [2018-11-23 12:19:43,936 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:19:43,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:19:43,936 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:43,953 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:19:43,981 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:19:43,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:19:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:44,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:19:44,254 INFO L256 TraceCheckUtils]: 0: Hoare triple {1716#true} call ULTIMATE.init(); {1716#true} is VALID [2018-11-23 12:19:44,254 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,255 INFO L273 TraceCheckUtils]: 2: Hoare triple {1716#true} assume true; {1716#true} is VALID [2018-11-23 12:19:44,255 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1716#true} {1716#true} #83#return; {1716#true} is VALID [2018-11-23 12:19:44,256 INFO L256 TraceCheckUtils]: 4: Hoare triple {1716#true} call #t~ret8 := main(); {1716#true} is VALID [2018-11-23 12:19:44,256 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,259 INFO L273 TraceCheckUtils]: 6: Hoare triple {1716#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {1744#(<= main_~MINVAL~0 2)} is VALID [2018-11-23 12:19:44,259 INFO L273 TraceCheckUtils]: 7: Hoare triple {1744#(<= main_~MINVAL~0 2)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) then 1 else 0);~i~0 := 1; {1744#(<= main_~MINVAL~0 2)} is VALID [2018-11-23 12:19:44,260 INFO L273 TraceCheckUtils]: 8: Hoare triple {1744#(<= main_~MINVAL~0 2)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then 1 + ~CELLCOUNT~0 / 5 else ~CELLCOUNT~0 / 5));~j~0 := 5; {1751#(and (<= main_~MINVAL~0 2) (<= 5 main_~j~0))} is VALID [2018-11-23 12:19:44,261 INFO L273 TraceCheckUtils]: 9: Hoare triple {1751#(and (<= main_~MINVAL~0 2) (<= 5 main_~j~0))} assume !!(~j~0 >= 1); {1751#(and (<= main_~MINVAL~0 2) (<= 5 main_~j~0))} is VALID [2018-11-23 12:19:44,262 INFO L273 TraceCheckUtils]: 10: Hoare triple {1751#(and (<= main_~MINVAL~0 2) (<= 5 main_~j~0))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (5 * ~i~0 - ~j~0), 4); {1751#(and (<= main_~MINVAL~0 2) (<= 5 main_~j~0))} is VALID [2018-11-23 12:19:44,263 INFO L273 TraceCheckUtils]: 11: Hoare triple {1751#(and (<= main_~MINVAL~0 2) (<= 5 main_~j~0))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1761#(and (<= 4 main_~j~0) (<= main_~MINVAL~0 2))} is VALID [2018-11-23 12:19:44,264 INFO L273 TraceCheckUtils]: 12: Hoare triple {1761#(and (<= 4 main_~j~0) (<= main_~MINVAL~0 2))} assume !!(~j~0 >= 1); {1761#(and (<= 4 main_~j~0) (<= main_~MINVAL~0 2))} is VALID [2018-11-23 12:19:44,265 INFO L273 TraceCheckUtils]: 13: Hoare triple {1761#(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 * (5 * ~i~0 - ~j~0), 4); {1761#(and (<= 4 main_~j~0) (<= main_~MINVAL~0 2))} is VALID [2018-11-23 12:19:44,266 INFO L273 TraceCheckUtils]: 14: Hoare triple {1761#(and (<= 4 main_~j~0) (<= main_~MINVAL~0 2))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1771#(and (<= main_~MINVAL~0 2) (<= 3 main_~j~0))} is VALID [2018-11-23 12:19:44,267 INFO L273 TraceCheckUtils]: 15: Hoare triple {1771#(and (<= main_~MINVAL~0 2) (<= 3 main_~j~0))} assume !!(~j~0 >= 1); {1771#(and (<= main_~MINVAL~0 2) (<= 3 main_~j~0))} is VALID [2018-11-23 12:19:44,268 INFO L273 TraceCheckUtils]: 16: Hoare triple {1771#(and (<= main_~MINVAL~0 2) (<= 3 main_~j~0))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (5 * ~i~0 - ~j~0), 4); {1771#(and (<= main_~MINVAL~0 2) (<= 3 main_~j~0))} is VALID [2018-11-23 12:19:44,269 INFO L273 TraceCheckUtils]: 17: Hoare triple {1771#(and (<= main_~MINVAL~0 2) (<= 3 main_~j~0))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1781#(and (<= 2 main_~j~0) (<= main_~MINVAL~0 2))} is VALID [2018-11-23 12:19:44,270 INFO L273 TraceCheckUtils]: 18: Hoare triple {1781#(and (<= 2 main_~j~0) (<= main_~MINVAL~0 2))} assume !!(~j~0 >= 1); {1781#(and (<= 2 main_~j~0) (<= main_~MINVAL~0 2))} is VALID [2018-11-23 12:19:44,271 INFO L273 TraceCheckUtils]: 19: Hoare triple {1781#(and (<= 2 main_~j~0) (<= main_~MINVAL~0 2))} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (5 * ~i~0 - ~j~0), 4); {1717#false} is VALID [2018-11-23 12:19:44,271 INFO L273 TraceCheckUtils]: 20: Hoare triple {1717#false} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1717#false} is VALID [2018-11-23 12:19:44,272 INFO L273 TraceCheckUtils]: 21: Hoare triple {1717#false} assume !(~j~0 >= 1); {1717#false} is VALID [2018-11-23 12:19:44,272 INFO L273 TraceCheckUtils]: 22: Hoare triple {1717#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1717#false} is VALID [2018-11-23 12:19:44,272 INFO L273 TraceCheckUtils]: 23: Hoare triple {1717#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then 1 + ~CELLCOUNT~0 / 5 else ~CELLCOUNT~0 / 5)); {1717#false} is VALID [2018-11-23 12:19:44,273 INFO L273 TraceCheckUtils]: 24: Hoare triple {1717#false} ~i~0 := 0; {1717#false} is VALID [2018-11-23 12:19:44,273 INFO L273 TraceCheckUtils]: 25: Hoare triple {1717#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; {1717#false} is VALID [2018-11-23 12:19:44,274 INFO L273 TraceCheckUtils]: 26: Hoare triple {1717#false} 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,274 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,274 INFO L273 TraceCheckUtils]: 28: Hoare triple {1717#false} ~cond := #in~cond; {1717#false} is VALID [2018-11-23 12:19:44,275 INFO L273 TraceCheckUtils]: 29: Hoare triple {1717#false} assume 0 == ~cond; {1717#false} is VALID [2018-11-23 12:19:44,275 INFO L273 TraceCheckUtils]: 30: Hoare triple {1717#false} assume !false; {1717#false} is VALID [2018-11-23 12:19:44,277 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:19:44,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:19:44,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 12:19:44,297 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-23 12:19:44,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:44,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:19:44,386 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:44,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:19:44,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:19:44,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:19:44,387 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 12 states. [2018-11-23 12:19:44,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:44,899 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2018-11-23 12:19:44,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:19:44,900 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-23 12:19:44,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:19:44,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:19:44,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2018-11-23 12:19:44,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:19:44,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2018-11-23 12:19:44,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 64 transitions. [2018-11-23 12:19:45,014 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:45,016 INFO L225 Difference]: With dead ends: 78 [2018-11-23 12:19:45,016 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 12:19:45,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:19:45,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 12:19:45,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-11-23 12:19:45,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:19:45,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 44 states. [2018-11-23 12:19:45,074 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 44 states. [2018-11-23 12:19:45,075 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 44 states. [2018-11-23 12:19:45,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:45,077 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-11-23 12:19:45,077 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-23 12:19:45,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:45,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:45,077 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 46 states. [2018-11-23 12:19:45,077 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 46 states. [2018-11-23 12:19:45,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:45,079 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-11-23 12:19:45,080 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-23 12:19:45,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:45,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:45,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:19:45,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:19:45,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:19:45,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-11-23 12:19:45,082 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 31 [2018-11-23 12:19:45,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:19:45,082 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-11-23 12:19:45,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:19:45,083 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-23 12:19:45,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:19:45,083 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:45,084 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 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:45,084 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:45,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:45,084 INFO L82 PathProgramCache]: Analyzing trace with hash -700204802, now seen corresponding path program 3 times [2018-11-23 12:19:45,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:45,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:45,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:45,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:19:45,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:46,443 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2018-11-23 12:19:47,909 INFO L256 TraceCheckUtils]: 0: Hoare triple {2082#true} call ULTIMATE.init(); {2082#true} is VALID [2018-11-23 12:19:47,909 INFO L273 TraceCheckUtils]: 1: Hoare triple {2082#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {2082#true} is VALID [2018-11-23 12:19:47,909 INFO L273 TraceCheckUtils]: 2: Hoare triple {2082#true} assume true; {2082#true} is VALID [2018-11-23 12:19:47,910 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2082#true} {2082#true} #83#return; {2082#true} is VALID [2018-11-23 12:19:47,910 INFO L256 TraceCheckUtils]: 4: Hoare triple {2082#true} call #t~ret8 := main(); {2082#true} is VALID [2018-11-23 12:19:47,911 INFO L273 TraceCheckUtils]: 5: Hoare triple {2082#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {2082#true} is VALID [2018-11-23 12:19:47,916 INFO L273 TraceCheckUtils]: 6: Hoare triple {2082#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {2084#(and (<= 2 ~CELLCOUNT~0) (<= 2 main_~MINVAL~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:47,917 INFO L273 TraceCheckUtils]: 7: Hoare triple {2084#(and (<= 2 ~CELLCOUNT~0) (<= 2 main_~MINVAL~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) then 1 else 0);~i~0 := 1; {2085#(and (<= 2 ~CELLCOUNT~0) (<= 2 main_~MINVAL~0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:47,918 INFO L273 TraceCheckUtils]: 8: Hoare triple {2085#(and (<= 2 ~CELLCOUNT~0) (<= 2 main_~MINVAL~0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then 1 + ~CELLCOUNT~0 / 5 else ~CELLCOUNT~0 / 5));~j~0 := 5; {2086#(and (<= (+ main_~MINVAL~0 3) main_~j~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (<= main_~j~0 (+ main_~MINVAL~0 3)) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 20 main_~i~0))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:47,918 INFO L273 TraceCheckUtils]: 9: Hoare triple {2086#(and (<= (+ main_~MINVAL~0 3) main_~j~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (<= main_~j~0 (+ main_~MINVAL~0 3)) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 20 main_~i~0))) (< 0 (+ ~CELLCOUNT~0 1)))} assume !!(~j~0 >= 1); {2086#(and (<= (+ main_~MINVAL~0 3) main_~j~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (<= main_~j~0 (+ main_~MINVAL~0 3)) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 20 main_~i~0))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:47,920 INFO L273 TraceCheckUtils]: 10: Hoare triple {2086#(and (<= (+ main_~MINVAL~0 3) main_~j~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (<= main_~j~0 (+ main_~MINVAL~0 3)) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 20 main_~i~0))) (< 0 (+ ~CELLCOUNT~0 1)))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (5 * ~i~0 - ~j~0), 4); {2087#(and (<= (+ main_~MINVAL~0 3) main_~j~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (<= main_~j~0 (+ main_~MINVAL~0 3)) (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)))) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 20 main_~i~0))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:47,923 INFO L273 TraceCheckUtils]: 11: Hoare triple {2087#(and (<= (+ main_~MINVAL~0 3) main_~j~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (<= main_~j~0 (+ main_~MINVAL~0 3)) (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)))) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 20 main_~i~0))) (< 0 (+ ~CELLCOUNT~0 1)))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2088#(and (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (or (and (<= 2 ~CELLCOUNT~0) (= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) (* 5 main_~j~0)) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (and (<= (+ main_~j~0 1) (div (+ (- 0) (+ |main_~#volArray~0.offset| (* 20 main_~i~0))) 4)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 0)))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:47,924 INFO L273 TraceCheckUtils]: 12: Hoare triple {2088#(and (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (or (and (<= 2 ~CELLCOUNT~0) (= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) (* 5 main_~j~0)) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (and (<= (+ main_~j~0 1) (div (+ (- 0) (+ |main_~#volArray~0.offset| (* 20 main_~i~0))) 4)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 0)))) (< 0 (+ ~CELLCOUNT~0 1)))} assume !!(~j~0 >= 1); {2088#(and (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (or (and (<= 2 ~CELLCOUNT~0) (= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) (* 5 main_~j~0)) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (and (<= (+ main_~j~0 1) (div (+ (- 0) (+ |main_~#volArray~0.offset| (* 20 main_~i~0))) 4)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 0)))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:47,926 INFO L273 TraceCheckUtils]: 13: Hoare triple {2088#(and (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (or (and (<= 2 ~CELLCOUNT~0) (= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) (* 5 main_~j~0)) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (and (<= (+ main_~j~0 1) (div (+ (- 0) (+ |main_~#volArray~0.offset| (* 20 main_~i~0))) 4)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 0)))) (< 0 (+ ~CELLCOUNT~0 1)))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (5 * ~i~0 - ~j~0), 4); {2088#(and (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (or (and (<= 2 ~CELLCOUNT~0) (= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) (* 5 main_~j~0)) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (and (<= (+ main_~j~0 1) (div (+ (- 0) (+ |main_~#volArray~0.offset| (* 20 main_~i~0))) 4)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 0)))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:47,928 INFO L273 TraceCheckUtils]: 14: Hoare triple {2088#(and (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (or (and (<= 2 ~CELLCOUNT~0) (= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) (* 5 main_~j~0)) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (and (<= (+ main_~j~0 1) (div (+ (- 0) (+ |main_~#volArray~0.offset| (* 20 main_~i~0))) 4)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 0)))) (< 0 (+ ~CELLCOUNT~0 1)))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2089#(and (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (and (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (and (<= (+ main_~j~0 2) (div (+ (- 0) (+ |main_~#volArray~0.offset| (* 20 main_~i~0))) 4)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 0)))))} is VALID [2018-11-23 12:19:47,930 INFO L273 TraceCheckUtils]: 15: Hoare triple {2089#(and (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (and (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (and (<= (+ main_~j~0 2) (div (+ (- 0) (+ |main_~#volArray~0.offset| (* 20 main_~i~0))) 4)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 0)))))} assume !!(~j~0 >= 1); {2089#(and (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (and (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (and (<= (+ main_~j~0 2) (div (+ (- 0) (+ |main_~#volArray~0.offset| (* 20 main_~i~0))) 4)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 0)))))} is VALID [2018-11-23 12:19:47,932 INFO L273 TraceCheckUtils]: 16: Hoare triple {2089#(and (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (and (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (and (<= (+ main_~j~0 2) (div (+ (- 0) (+ |main_~#volArray~0.offset| (* 20 main_~i~0))) 4)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 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 * (5 * ~i~0 - ~j~0), 4); {2089#(and (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (and (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (and (<= (+ main_~j~0 2) (div (+ (- 0) (+ |main_~#volArray~0.offset| (* 20 main_~i~0))) 4)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 0)))))} is VALID [2018-11-23 12:19:47,934 INFO L273 TraceCheckUtils]: 17: Hoare triple {2089#(and (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (and (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (and (<= (+ main_~j~0 2) (div (+ (- 0) (+ |main_~#volArray~0.offset| (* 20 main_~i~0))) 4)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 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; {2090#(and (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (or (and (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 0))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:47,935 INFO L273 TraceCheckUtils]: 18: Hoare triple {2090#(and (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (or (and (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 0))) (< 0 (+ ~CELLCOUNT~0 1)))} assume !!(~j~0 >= 1); {2090#(and (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (or (and (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 0))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:47,937 INFO L273 TraceCheckUtils]: 19: Hoare triple {2090#(and (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (or (and (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 0))) (< 0 (+ ~CELLCOUNT~0 1)))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (5 * ~i~0 - ~j~0), 4); {2091#(and (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (or (and (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:47,938 INFO L273 TraceCheckUtils]: 20: Hoare triple {2091#(and (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (or (and (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (< 0 (+ ~CELLCOUNT~0 1)))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2092#(and (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (or (= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) (* 4 main_~j~0)) (and (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) 0))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:47,940 INFO L273 TraceCheckUtils]: 21: Hoare triple {2092#(and (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (or (= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) (* 4 main_~j~0)) (and (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) 0))) (< 0 (+ ~CELLCOUNT~0 1)))} assume !!(~j~0 >= 1); {2092#(and (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (or (= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) (* 4 main_~j~0)) (and (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) 0))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:47,943 INFO L273 TraceCheckUtils]: 22: Hoare triple {2092#(and (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (or (= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) (* 4 main_~j~0)) (and (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) 0))) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (5 * ~i~0 - ~j~0), 4); {2093#(and (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (and (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (and (= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) (* 4 main_~j~0)) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0))))) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) 0))))} is VALID [2018-11-23 12:19:47,945 INFO L273 TraceCheckUtils]: 23: Hoare triple {2093#(and (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (and (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (and (= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) (* 4 main_~j~0)) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0))))) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) 0))))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2094#(and (or (and (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:47,945 INFO L273 TraceCheckUtils]: 24: Hoare triple {2094#(and (or (and (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~j~0 >= 1); {2094#(and (or (and (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:47,946 INFO L273 TraceCheckUtils]: 25: Hoare triple {2094#(and (or (and (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2095#(and (or (and (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 39)) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:47,947 INFO L273 TraceCheckUtils]: 26: Hoare triple {2095#(and (or (and (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 39)) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then 1 + ~CELLCOUNT~0 / 5 else ~CELLCOUNT~0 / 5)); {2096#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:47,948 INFO L273 TraceCheckUtils]: 27: Hoare triple {2096#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= |main_~#volArray~0.offset| 0))} ~i~0 := 0; {2097#(and (or (<= (+ main_~MINVAL~0 3) (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:47,950 INFO L273 TraceCheckUtils]: 28: Hoare triple {2097#(and (or (<= (+ main_~MINVAL~0 3) (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; {2098#(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:47,951 INFO L273 TraceCheckUtils]: 29: Hoare triple {2098#(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; {2099#|main_#t~short7|} is VALID [2018-11-23 12:19:47,952 INFO L256 TraceCheckUtils]: 30: Hoare triple {2099#|main_#t~short7|} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {2100#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2018-11-23 12:19:47,953 INFO L273 TraceCheckUtils]: 31: Hoare triple {2100#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2101#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:19:47,953 INFO L273 TraceCheckUtils]: 32: Hoare triple {2101#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2083#false} is VALID [2018-11-23 12:19:47,954 INFO L273 TraceCheckUtils]: 33: Hoare triple {2083#false} assume !false; {2083#false} is VALID [2018-11-23 12:19:47,967 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:19:47,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:19:47,968 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:47,984 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:19:48,020 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-23 12:19:48,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:19:48,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:48,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:19:48,187 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:48,198 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:48,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:19:48,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:19:48,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:19:48,223 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-11-23 12:19:48,344 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:48,353 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:48,355 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:48,356 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:48,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:19:48,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:19:48,390 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:48,390 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2018-11-23 12:19:48,395 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:19:48,395 WARN L384 uantifierElimination]: Input elimination task: ∃ [main_~j~0, |v_#memory_int_10|]. (let ((.cse0 (select |v_#memory_int_10| |main_~#volArray~0.base|)) (.cse1 (* 20 main_~i~0))) (and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= 5 (select .cse0 (+ |main_~#volArray~0.offset| .cse1 (- 20)))) (<= main_~j~0 4) (= |#memory_int| (store |v_#memory_int_10| |main_~#volArray~0.base| (store .cse0 (+ |main_~#volArray~0.offset| .cse1 (* (- 4) main_~j~0)) main_~j~0))))) [2018-11-23 12:19:48,396 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~j~0]. (let ((.cse0 (select |#memory_int| |main_~#volArray~0.base|)) (.cse1 (* 20 main_~i~0))) (and (= (select .cse0 (+ |main_~#volArray~0.offset| .cse1 (- 20))) 5) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= main_~j~0 4) (= (select .cse0 (+ |main_~#volArray~0.offset| .cse1 (* (- 4) main_~j~0))) main_~j~0))) [2018-11-23 12:19:48,618 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:48,629 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:48,634 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:48,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 61 [2018-11-23 12:19:48,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:19:48,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:19:48,697 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:48,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:53 [2018-11-23 12:19:49,099 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 59 treesize of output 50 [2018-11-23 12:19:49,116 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:49,125 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:49,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 50 treesize of output 75 [2018-11-23 12:19:49,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:19:49,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:19:49,275 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:49,275 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:72 [2018-11-23 12:19:49,545 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 50 treesize of output 41 [2018-11-23 12:19:49,555 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:49,562 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:49,563 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:49,566 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:49,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 96 [2018-11-23 12:19:49,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-11-23 12:19:49,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 12:19:49,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 12:19:49,732 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:155 [2018-11-23 12:19:49,742 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:19:49,742 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_13|, v_prenex_1]. (let ((.cse0 (select |v_#memory_int_13| |main_~#volArray~0.base|)) (.cse1 (* (- 4) main_~j~0))) (and (<= v_prenex_1 4) (<= main_~MINVAL~0 2) (= (select .cse0 |main_~#volArray~0.offset|) 5) (= |main_~#volArray~0.offset| 0) (= (select .cse0 (+ |main_~#volArray~0.offset| .cse1 16)) (+ main_~j~0 1)) (= (select .cse0 (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 20)) v_prenex_1) (= (store |v_#memory_int_13| |main_~#volArray~0.base| (store .cse0 (+ |main_~#volArray~0.offset| .cse1 20) 0)) |#memory_int|))) [2018-11-23 12:19:49,742 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_1, v_prenex_2]. (let ((.cse7 (* (- 4) main_~j~0))) (let ((.cse6 (+ |main_~#volArray~0.offset| .cse7 20)) (.cse5 (select |#memory_int| |main_~#volArray~0.base|))) (let ((.cse0 (= (select .cse5 |main_~#volArray~0.offset|) 5)) (.cse1 (<= main_~MINVAL~0 2)) (.cse2 (= (select .cse5 (+ |main_~#volArray~0.offset| .cse7 16)) (+ main_~j~0 1))) (.cse3 (= |main_~#volArray~0.offset| 0)) (.cse4 (= (select .cse5 .cse6) 0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= main_~j~0 4) .cse4) (and (<= v_prenex_1 4) .cse0 .cse1 .cse2 (= (select .cse5 (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 20)) v_prenex_1) .cse3 .cse4) (and (<= v_prenex_2 4) .cse1 .cse2 (= (select .cse5 (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_2) 20)) v_prenex_2) .cse3 (= |main_~#volArray~0.offset| .cse6) .cse4))))) [2018-11-23 12:19:50,773 INFO L256 TraceCheckUtils]: 0: Hoare triple {2082#true} call ULTIMATE.init(); {2082#true} is VALID [2018-11-23 12:19:50,773 INFO L273 TraceCheckUtils]: 1: Hoare triple {2082#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {2082#true} is VALID [2018-11-23 12:19:50,773 INFO L273 TraceCheckUtils]: 2: Hoare triple {2082#true} assume true; {2082#true} is VALID [2018-11-23 12:19:50,773 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2082#true} {2082#true} #83#return; {2082#true} is VALID [2018-11-23 12:19:50,774 INFO L256 TraceCheckUtils]: 4: Hoare triple {2082#true} call #t~ret8 := main(); {2082#true} is VALID [2018-11-23 12:19:50,774 INFO L273 TraceCheckUtils]: 5: Hoare triple {2082#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {2082#true} is VALID [2018-11-23 12:19:50,774 INFO L273 TraceCheckUtils]: 6: Hoare triple {2082#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {2123#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:50,775 INFO L273 TraceCheckUtils]: 7: Hoare triple {2123#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) then 1 else 0);~i~0 := 1; {2127#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:50,775 INFO L273 TraceCheckUtils]: 8: Hoare triple {2127#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then 1 + ~CELLCOUNT~0 / 5 else ~CELLCOUNT~0 / 5));~j~0 := 5; {2131#(and (= main_~j~0 5) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:50,776 INFO L273 TraceCheckUtils]: 9: Hoare triple {2131#(and (= main_~j~0 5) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~j~0 >= 1); {2131#(and (= main_~j~0 5) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:50,777 INFO L273 TraceCheckUtils]: 10: Hoare triple {2131#(and (= main_~j~0 5) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (5 * ~i~0 - ~j~0), 4); {2138#(and (= main_~j~0 5) (<= 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| (* 20 main_~i~0) (* (- 4) main_~j~0))) main_~j~0))} is VALID [2018-11-23 12:19:50,778 INFO L273 TraceCheckUtils]: 11: Hoare triple {2138#(and (= main_~j~0 5) (<= 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| (* 20 main_~i~0) (* (- 4) main_~j~0))) main_~j~0))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2142#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20))) 5) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= main_~j~0 4))} is VALID [2018-11-23 12:19:50,779 INFO L273 TraceCheckUtils]: 12: Hoare triple {2142#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20))) 5) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= main_~j~0 4))} assume !!(~j~0 >= 1); {2142#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20))) 5) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= main_~j~0 4))} is VALID [2018-11-23 12:19:50,781 INFO L273 TraceCheckUtils]: 13: Hoare triple {2142#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20))) 5) (<= 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 * (5 * ~i~0 - ~j~0), 4); {2149#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20))) 5) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 4) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (* (- 4) main_~j~0))) main_~j~0))))} is VALID [2018-11-23 12:19:50,783 INFO L273 TraceCheckUtils]: 14: Hoare triple {2149#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20))) 5) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 4) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (* (- 4) main_~j~0))) main_~j~0))))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2149#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20))) 5) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 4) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (* (- 4) main_~j~0))) main_~j~0))))} is VALID [2018-11-23 12:19:50,784 INFO L273 TraceCheckUtils]: 15: Hoare triple {2149#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20))) 5) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 4) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (* (- 4) main_~j~0))) main_~j~0))))} assume !!(~j~0 >= 1); {2149#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20))) 5) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 4) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (* (- 4) main_~j~0))) main_~j~0))))} is VALID [2018-11-23 12:19:50,786 INFO L273 TraceCheckUtils]: 16: Hoare triple {2149#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20))) 5) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 4) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (* (- 4) main_~j~0))) main_~j~0))))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (5 * ~i~0 - ~j~0), 4); {2159#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20))) 5) (<= main_~MINVAL~0 2) (exists ((v_prenex_1 Int)) (and (<= v_prenex_1 4) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (* (- 4) v_prenex_1))) v_prenex_1))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (* (- 4) main_~j~0))) main_~j~0))} is VALID [2018-11-23 12:19:50,789 INFO L273 TraceCheckUtils]: 17: Hoare triple {2159#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20))) 5) (<= main_~MINVAL~0 2) (exists ((v_prenex_1 Int)) (and (<= v_prenex_1 4) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (* (- 4) v_prenex_1))) v_prenex_1))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (* (- 4) main_~j~0))) main_~j~0))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2163#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20))) 5) (<= main_~MINVAL~0 2) (exists ((v_prenex_1 Int)) (and (<= v_prenex_1 4) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (* (- 4) v_prenex_1))) v_prenex_1))) (exists ((v_main_~j~0_16 Int)) (and (= v_main_~j~0_16 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_16) (* 20 main_~i~0)))) (<= v_main_~j~0_16 (+ main_~j~0 1)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:50,791 INFO L273 TraceCheckUtils]: 18: Hoare triple {2163#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20))) 5) (<= main_~MINVAL~0 2) (exists ((v_prenex_1 Int)) (and (<= v_prenex_1 4) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (* (- 4) v_prenex_1))) v_prenex_1))) (exists ((v_main_~j~0_16 Int)) (and (= v_main_~j~0_16 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_16) (* 20 main_~i~0)))) (<= v_main_~j~0_16 (+ main_~j~0 1)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~j~0 >= 1); {2163#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20))) 5) (<= main_~MINVAL~0 2) (exists ((v_prenex_1 Int)) (and (<= v_prenex_1 4) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (* (- 4) v_prenex_1))) v_prenex_1))) (exists ((v_main_~j~0_16 Int)) (and (= v_main_~j~0_16 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_16) (* 20 main_~i~0)))) (<= v_main_~j~0_16 (+ main_~j~0 1)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:50,793 INFO L273 TraceCheckUtils]: 19: Hoare triple {2163#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20))) 5) (<= main_~MINVAL~0 2) (exists ((v_prenex_1 Int)) (and (<= v_prenex_1 4) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (* (- 4) v_prenex_1))) v_prenex_1))) (exists ((v_main_~j~0_16 Int)) (and (= v_main_~j~0_16 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_16) (* 20 main_~i~0)))) (<= v_main_~j~0_16 (+ main_~j~0 1)))) (= 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 * (5 * ~i~0 - ~j~0), 4); {2159#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20))) 5) (<= main_~MINVAL~0 2) (exists ((v_prenex_1 Int)) (and (<= v_prenex_1 4) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (* (- 4) v_prenex_1))) v_prenex_1))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (* (- 4) main_~j~0))) main_~j~0))} is VALID [2018-11-23 12:19:50,795 INFO L273 TraceCheckUtils]: 20: Hoare triple {2159#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20))) 5) (<= main_~MINVAL~0 2) (exists ((v_prenex_1 Int)) (and (<= v_prenex_1 4) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (* (- 4) v_prenex_1))) v_prenex_1))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (* (- 4) main_~j~0))) main_~j~0))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2173#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20))) 5) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (* (- 4) main_~j~0) (- 4))) (+ main_~j~0 1)) (<= main_~MINVAL~0 2) (exists ((v_prenex_1 Int)) (and (<= v_prenex_1 4) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (* (- 4) v_prenex_1))) v_prenex_1))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:50,797 INFO L273 TraceCheckUtils]: 21: Hoare triple {2173#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20))) 5) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (* (- 4) main_~j~0) (- 4))) (+ main_~j~0 1)) (<= main_~MINVAL~0 2) (exists ((v_prenex_1 Int)) (and (<= v_prenex_1 4) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (* (- 4) v_prenex_1))) v_prenex_1))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~j~0 >= 1); {2173#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20))) 5) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (* (- 4) main_~j~0) (- 4))) (+ main_~j~0 1)) (<= main_~MINVAL~0 2) (exists ((v_prenex_1 Int)) (and (<= v_prenex_1 4) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (* (- 4) v_prenex_1))) v_prenex_1))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:50,799 INFO L273 TraceCheckUtils]: 22: Hoare triple {2173#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20))) 5) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (* (- 4) main_~j~0) (- 4))) (+ main_~j~0 1)) (<= main_~MINVAL~0 2) (exists ((v_prenex_1 Int)) (and (<= v_prenex_1 4) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (* (- 4) v_prenex_1))) v_prenex_1))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (5 * ~i~0 - ~j~0), 4); {2180#(or (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 5) (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) (+ main_~j~0 1)) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 20)) 0) (exists ((v_prenex_1 Int)) (and (<= v_prenex_1 4) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 20)) v_prenex_1)))) (and (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) (+ main_~j~0 1)) (= |main_~#volArray~0.offset| 0) (= (* 4 main_~j~0) 20) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 20)) 0) (exists ((v_prenex_2 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_2) 20)) v_prenex_2) (<= v_prenex_2 4)))) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 5) (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) (+ main_~j~0 1)) (= |main_~#volArray~0.offset| 0) (<= main_~j~0 4) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 20)) 0)))} is VALID [2018-11-23 12:19:50,803 INFO L273 TraceCheckUtils]: 23: Hoare triple {2180#(or (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 5) (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) (+ main_~j~0 1)) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 20)) 0) (exists ((v_prenex_1 Int)) (and (<= v_prenex_1 4) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 20)) v_prenex_1)))) (and (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) (+ main_~j~0 1)) (= |main_~#volArray~0.offset| 0) (= (* 4 main_~j~0) 20) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 20)) 0) (exists ((v_prenex_2 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_2) 20)) v_prenex_2) (<= v_prenex_2 4)))) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 5) (<= main_~MINVAL~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 16)) (+ main_~j~0 1)) (= |main_~#volArray~0.offset| 0) (<= main_~j~0 4) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 20)) 0)))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2184#(or (and (exists ((v_main_~j~0_18 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_18) 20)) 0) (<= v_main_~j~0_18 (+ main_~j~0 1)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_18) 16)) (+ v_main_~j~0_18 1)))) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 5) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_1 Int)) (and (<= v_prenex_1 4) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 20)) v_prenex_1)))) (and (<= 4 main_~j~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (- 4))) 6) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0) (exists ((v_prenex_2 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_2) 20)) v_prenex_2) (<= v_prenex_2 4)))) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 5) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_3 Int)) (and (<= v_prenex_3 (+ main_~j~0 1)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 20)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 16)) (+ v_prenex_3 1)) (<= v_prenex_3 4)))))} is VALID [2018-11-23 12:19:50,822 INFO L273 TraceCheckUtils]: 24: Hoare triple {2184#(or (and (exists ((v_main_~j~0_18 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_18) 20)) 0) (<= v_main_~j~0_18 (+ main_~j~0 1)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_18) 16)) (+ v_main_~j~0_18 1)))) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 5) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_1 Int)) (and (<= v_prenex_1 4) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 20)) v_prenex_1)))) (and (<= 4 main_~j~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (- 4))) 6) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0) (exists ((v_prenex_2 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_2) 20)) v_prenex_2) (<= v_prenex_2 4)))) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 5) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_3 Int)) (and (<= v_prenex_3 (+ main_~j~0 1)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 20)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 16)) (+ v_prenex_3 1)) (<= v_prenex_3 4)))))} assume !(~j~0 >= 1); {2188#(and (exists ((v_main_~j~0_18 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_18) 20)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_18) 16)) (+ v_main_~j~0_18 1)) (<= v_main_~j~0_18 1))) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 5) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:50,837 INFO L273 TraceCheckUtils]: 25: Hoare triple {2188#(and (exists ((v_main_~j~0_18 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_18) 20)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_18) 16)) (+ v_main_~j~0_18 1)) (<= v_main_~j~0_18 1))) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 5) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2188#(and (exists ((v_main_~j~0_18 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_18) 20)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_18) 16)) (+ v_main_~j~0_18 1)) (<= v_main_~j~0_18 1))) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 5) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:50,851 INFO L273 TraceCheckUtils]: 26: Hoare triple {2188#(and (exists ((v_main_~j~0_18 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_18) 20)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_18) 16)) (+ v_main_~j~0_18 1)) (<= v_main_~j~0_18 1))) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 5) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 5 then 1 + ~CELLCOUNT~0 / 5 else ~CELLCOUNT~0 / 5)); {2188#(and (exists ((v_main_~j~0_18 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_18) 20)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_18) 16)) (+ v_main_~j~0_18 1)) (<= v_main_~j~0_18 1))) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 5) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:50,853 INFO L273 TraceCheckUtils]: 27: Hoare triple {2188#(and (exists ((v_main_~j~0_18 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_18) 20)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_18) 16)) (+ v_main_~j~0_18 1)) (<= v_main_~j~0_18 1))) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 5) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} ~i~0 := 0; {2198#(and (exists ((v_main_~j~0_18 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_18) 20)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_18) 16)) (+ v_main_~j~0_18 1)) (<= v_main_~j~0_18 1))) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 5) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-23 12:19:50,854 INFO L273 TraceCheckUtils]: 28: Hoare triple {2198#(and (exists ((v_main_~j~0_18 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_18) 20)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_18) 16)) (+ v_main_~j~0_18 1)) (<= v_main_~j~0_18 1))) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 5) (<= main_~MINVAL~0 2) (= |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; {2099#|main_#t~short7|} is VALID [2018-11-23 12:19:50,854 INFO L273 TraceCheckUtils]: 29: Hoare triple {2099#|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; {2083#false} is VALID [2018-11-23 12:19:50,854 INFO L256 TraceCheckUtils]: 30: Hoare triple {2083#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {2083#false} is VALID [2018-11-23 12:19:50,854 INFO L273 TraceCheckUtils]: 31: Hoare triple {2083#false} ~cond := #in~cond; {2083#false} is VALID [2018-11-23 12:19:50,855 INFO L273 TraceCheckUtils]: 32: Hoare triple {2083#false} assume 0 == ~cond; {2083#false} is VALID [2018-11-23 12:19:50,855 INFO L273 TraceCheckUtils]: 33: Hoare triple {2083#false} assume !false; {2083#false} is VALID [2018-11-23 12:19:50,863 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:19:50,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:19:50,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 33 [2018-11-23 12:19:50,894 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 34 [2018-11-23 12:19:50,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:50,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 12:19:51,020 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:51,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 12:19:51,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 12:19:51,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=918, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 12:19:51,022 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 33 states. [2018-11-23 12:19:52,399 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2018-11-23 12:19:53,460 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 61 [2018-11-23 12:19:53,771 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 68 [2018-11-23 12:19:54,269 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 76 [2018-11-23 12:19:54,572 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 67 [2018-11-23 12:19:55,169 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 71 [2018-11-23 12:19:56,324 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 71 [2018-11-23 12:19:57,438 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 74 [2018-11-23 12:19:58,871 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 54 [2018-11-23 12:19:59,383 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 55 [2018-11-23 12:20:02,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:02,595 INFO L93 Difference]: Finished difference Result 150 states and 180 transitions. [2018-11-23 12:20:02,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 12:20:02,596 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 34 [2018-11-23 12:20:02,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:20:02,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:20:02,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 139 transitions. [2018-11-23 12:20:02,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:20:02,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 139 transitions. [2018-11-23 12:20:02,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 139 transitions. [2018-11-23 12:20:02,934 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:20:02,939 INFO L225 Difference]: With dead ends: 150 [2018-11-23 12:20:02,939 INFO L226 Difference]: Without dead ends: 134 [2018-11-23 12:20:02,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1074 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=838, Invalid=3452, Unknown=0, NotChecked=0, Total=4290 [2018-11-23 12:20:02,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-23 12:20:03,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 70. [2018-11-23 12:20:03,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:20:03,285 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand 70 states. [2018-11-23 12:20:03,286 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 70 states. [2018-11-23 12:20:03,286 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 70 states. [2018-11-23 12:20:03,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:03,293 INFO L93 Difference]: Finished difference Result 134 states and 161 transitions. [2018-11-23 12:20:03,294 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 161 transitions. [2018-11-23 12:20:03,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:03,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:03,295 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 134 states. [2018-11-23 12:20:03,295 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 134 states. [2018-11-23 12:20:03,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:20:03,299 INFO L93 Difference]: Finished difference Result 134 states and 161 transitions. [2018-11-23 12:20:03,300 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 161 transitions. [2018-11-23 12:20:03,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:20:03,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:20:03,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:20:03,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:20:03,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 12:20:03,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2018-11-23 12:20:03,303 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 34 [2018-11-23 12:20:03,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:20:03,303 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2018-11-23 12:20:03,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 12:20:03,303 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2018-11-23 12:20:03,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 12:20:03,304 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:20:03,304 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 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:20:03,305 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:20:03,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:20:03,305 INFO L82 PathProgramCache]: Analyzing trace with hash -490976331, now seen corresponding path program 1 times [2018-11-23 12:20:03,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:20:03,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:20:03,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:03,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:20:03,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:20:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:20:03,862 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: must not be argument of unary minus + at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:115) 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:20:03,867 INFO L168 Benchmark]: Toolchain (without parser) took 28302.87 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.1 GB in the end (delta: -733.8 MB). Peak memory consumption was 349.9 MB. Max. memory is 7.1 GB. [2018-11-23 12:20:03,868 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:20:03,869 INFO L168 Benchmark]: CACSL2BoogieTranslator took 401.63 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:20:03,870 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.35 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:20:03,870 INFO L168 Benchmark]: Boogie Preprocessor took 50.60 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:20:03,870 INFO L168 Benchmark]: RCFGBuilder took 807.14 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 711.5 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -745.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2018-11-23 12:20:03,871 INFO L168 Benchmark]: TraceAbstraction took 27004.94 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 372.2 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 1.5 MB). Peak memory consumption was 373.8 MB. Max. memory is 7.1 GB. [2018-11-23 12:20:03,874 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 401.63 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 33.35 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 50.60 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 807.14 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 711.5 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -745.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27004.94 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 372.2 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 1.5 MB). Peak memory consumption was 373.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: must not be argument of unary minus + de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: must not be argument of unary minus +: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:115) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...