java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/linear_search.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 16:11:24,732 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 16:11:24,734 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 16:11:24,746 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 16:11:24,746 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 16:11:24,747 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 16:11:24,749 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 16:11:24,750 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 16:11:24,752 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 16:11:24,753 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 16:11:24,754 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 16:11:24,755 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 16:11:24,756 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 16:11:24,757 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 16:11:24,758 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 16:11:24,759 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 16:11:24,760 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 16:11:24,761 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 16:11:24,762 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 16:11:24,765 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 16:11:24,766 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 16:11:24,767 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 16:11:24,769 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 16:11:24,769 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 16:11:24,772 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 16:11:24,772 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 16:11:24,772 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 16:11:24,773 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 16:11:24,774 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 16:11:24,775 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 16:11:24,775 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 16:11:24,776 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 16:11:24,777 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 16:11:24,778 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 16:11:24,779 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 16:11:24,779 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 16:11:24,780 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 16:11:24,780 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 16:11:24,780 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 16:11:24,781 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 16:11:24,782 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 16:11:24,783 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-16 16:11:24,797 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 16:11:24,797 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 16:11:24,799 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-16 16:11:24,799 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-16 16:11:24,799 INFO L138 SettingsManager]: * Use SBE=true [2019-09-16 16:11:24,800 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 16:11:24,800 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 16:11:24,800 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-16 16:11:24,800 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 16:11:24,800 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 16:11:24,801 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 16:11:24,801 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 16:11:24,801 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 16:11:24,801 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 16:11:24,801 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 16:11:24,802 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-16 16:11:24,802 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 16:11:24,802 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 16:11:24,802 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 16:11:24,802 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-16 16:11:24,803 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-16 16:11:24,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 16:11:24,803 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 16:11:24,803 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 16:11:24,803 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-16 16:11:24,804 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-16 16:11:24,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 16:11:24,804 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-16 16:11:24,804 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 16:11:24,834 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 16:11:24,848 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 16:11:24,852 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 16:11:24,854 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 16:11:24,854 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 16:11:24,855 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/linear_search.c [2019-09-16 16:11:24,926 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c58c64d07/fc44f2245b5147d49b93a8f2ddc5b803/FLAG59c15fe8b [2019-09-16 16:11:25,376 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 16:11:25,379 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search.c [2019-09-16 16:11:25,386 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c58c64d07/fc44f2245b5147d49b93a8f2ddc5b803/FLAG59c15fe8b [2019-09-16 16:11:25,779 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c58c64d07/fc44f2245b5147d49b93a8f2ddc5b803 [2019-09-16 16:11:25,787 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 16:11:25,789 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 16:11:25,790 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 16:11:25,790 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 16:11:25,793 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 16:11:25,795 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:11:25" (1/1) ... [2019-09-16 16:11:25,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74ccad01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:11:25, skipping insertion in model container [2019-09-16 16:11:25,798 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:11:25" (1/1) ... [2019-09-16 16:11:25,806 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 16:11:25,825 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 16:11:26,048 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:11:26,059 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 16:11:26,078 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:11:26,093 INFO L192 MainTranslator]: Completed translation [2019-09-16 16:11:26,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:11:26 WrapperNode [2019-09-16 16:11:26,094 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 16:11:26,095 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 16:11:26,095 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 16:11:26,095 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 16:11:26,208 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:11:26" (1/1) ... [2019-09-16 16:11:26,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:11:26" (1/1) ... [2019-09-16 16:11:26,218 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:11:26" (1/1) ... [2019-09-16 16:11:26,220 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:11:26" (1/1) ... [2019-09-16 16:11:26,240 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:11:26" (1/1) ... [2019-09-16 16:11:26,245 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:11:26" (1/1) ... [2019-09-16 16:11:26,246 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:11:26" (1/1) ... [2019-09-16 16:11:26,249 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 16:11:26,249 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 16:11:26,249 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 16:11:26,250 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 16:11:26,250 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:11:26" (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 [2019-09-16 16:11:26,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 16:11:26,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 16:11:26,308 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-16 16:11:26,308 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2019-09-16 16:11:26,308 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 16:11:26,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 16:11:26,308 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-16 16:11:26,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-16 16:11:26,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-16 16:11:26,309 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2019-09-16 16:11:26,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-16 16:11:26,309 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 16:11:26,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-16 16:11:26,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-16 16:11:26,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 16:11:26,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 16:11:26,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-16 16:11:26,588 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 16:11:26,589 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-16 16:11:26,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:11:26 BoogieIcfgContainer [2019-09-16 16:11:26,593 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 16:11:26,597 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 16:11:26,597 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 16:11:26,604 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 16:11:26,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 04:11:25" (1/3) ... [2019-09-16 16:11:26,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d8de5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:11:26, skipping insertion in model container [2019-09-16 16:11:26,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:11:26" (2/3) ... [2019-09-16 16:11:26,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d8de5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:11:26, skipping insertion in model container [2019-09-16 16:11:26,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:11:26" (3/3) ... [2019-09-16 16:11:26,611 INFO L109 eAbstractionObserver]: Analyzing ICFG linear_search.c [2019-09-16 16:11:26,635 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 16:11:26,642 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 16:11:26,665 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 16:11:26,697 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-16 16:11:26,698 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 16:11:26,698 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-16 16:11:26,698 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 16:11:26,698 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 16:11:26,699 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 16:11:26,699 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 16:11:26,699 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 16:11:26,699 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 16:11:26,714 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-09-16 16:11:26,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-16 16:11:26,719 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:11:26,721 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:11:26,723 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:11:26,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:11:26,729 INFO L82 PathProgramCache]: Analyzing trace with hash 868129876, now seen corresponding path program 1 times [2019-09-16 16:11:26,731 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:11:26,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:11:26,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:11:26,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:11:26,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:11:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:11:26,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:11:26,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:11:26,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-16 16:11:26,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-16 16:11:26,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-16 16:11:26,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 16:11:26,930 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2019-09-16 16:11:26,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:11:26,950 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2019-09-16 16:11:26,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-16 16:11:26,952 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-09-16 16:11:26,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:11:26,960 INFO L225 Difference]: With dead ends: 45 [2019-09-16 16:11:26,960 INFO L226 Difference]: Without dead ends: 22 [2019-09-16 16:11:26,964 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 16:11:26,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-16 16:11:26,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-16 16:11:27,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-16 16:11:27,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-09-16 16:11:27,004 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 18 [2019-09-16 16:11:27,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:11:27,004 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-09-16 16:11:27,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-16 16:11:27,005 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-09-16 16:11:27,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-16 16:11:27,006 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:11:27,006 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:11:27,006 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:11:27,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:11:27,007 INFO L82 PathProgramCache]: Analyzing trace with hash -202652409, now seen corresponding path program 1 times [2019-09-16 16:11:27,007 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:11:27,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:11:27,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:11:27,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:11:27,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:11:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:11:27,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:11:27,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:11:27,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 16:11:27,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:11:27,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:11:27,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:11:27,152 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 6 states. [2019-09-16 16:11:27,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:11:27,212 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-09-16 16:11:27,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:11:27,213 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-09-16 16:11:27,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:11:27,214 INFO L225 Difference]: With dead ends: 30 [2019-09-16 16:11:27,214 INFO L226 Difference]: Without dead ends: 22 [2019-09-16 16:11:27,216 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:11:27,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-16 16:11:27,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-16 16:11:27,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-16 16:11:27,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-09-16 16:11:27,221 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 20 [2019-09-16 16:11:27,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:11:27,222 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-09-16 16:11:27,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:11:27,222 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-09-16 16:11:27,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-16 16:11:27,223 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:11:27,223 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:11:27,224 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:11:27,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:11:27,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1540157926, now seen corresponding path program 1 times [2019-09-16 16:11:27,224 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:11:27,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:11:27,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:11:27,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:11:27,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:11:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:11:27,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:11:27,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:11:27,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:11:27,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:11:27,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:11:27,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:11:27,389 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 5 states. [2019-09-16 16:11:27,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:11:27,466 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-09-16 16:11:27,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:11:27,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-09-16 16:11:27,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:11:27,470 INFO L225 Difference]: With dead ends: 34 [2019-09-16 16:11:27,470 INFO L226 Difference]: Without dead ends: 25 [2019-09-16 16:11:27,471 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:11:27,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-16 16:11:27,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-09-16 16:11:27,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-16 16:11:27,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-09-16 16:11:27,479 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 20 [2019-09-16 16:11:27,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:11:27,480 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-09-16 16:11:27,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:11:27,480 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-09-16 16:11:27,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-16 16:11:27,481 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:11:27,481 INFO L407 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] [2019-09-16 16:11:27,482 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:11:27,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:11:27,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1697189824, now seen corresponding path program 1 times [2019-09-16 16:11:27,484 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:11:27,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:11:27,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:11:27,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:11:27,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:11:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:11:27,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:11:27,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:11:27,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:11:27,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:11:27,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:11:27,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:11:27,702 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 5 states. [2019-09-16 16:11:27,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:11:27,811 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2019-09-16 16:11:27,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:11:27,811 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-09-16 16:11:27,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:11:27,815 INFO L225 Difference]: With dead ends: 46 [2019-09-16 16:11:27,815 INFO L226 Difference]: Without dead ends: 32 [2019-09-16 16:11:27,816 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-16 16:11:27,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-16 16:11:27,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2019-09-16 16:11:27,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-16 16:11:27,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-09-16 16:11:27,831 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 24 [2019-09-16 16:11:27,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:11:27,832 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-09-16 16:11:27,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:11:27,832 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-09-16 16:11:27,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-16 16:11:27,833 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:11:27,834 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:11:27,834 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:11:27,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:11:27,835 INFO L82 PathProgramCache]: Analyzing trace with hash -2090216834, now seen corresponding path program 1 times [2019-09-16 16:11:27,835 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:11:27,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:11:27,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:11:27,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:11:27,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:11:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:11:27,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:11:27,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:11:27,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 16:11:27,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 16:11:27,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 16:11:27,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:11:28,000 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 4 states. [2019-09-16 16:11:28,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:11:28,050 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2019-09-16 16:11:28,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 16:11:28,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-09-16 16:11:28,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:11:28,053 INFO L225 Difference]: With dead ends: 48 [2019-09-16 16:11:28,053 INFO L226 Difference]: Without dead ends: 36 [2019-09-16 16:11:28,054 INFO L636 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 [2019-09-16 16:11:28,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-16 16:11:28,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2019-09-16 16:11:28,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-16 16:11:28,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-09-16 16:11:28,061 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 24 [2019-09-16 16:11:28,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:11:28,062 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-09-16 16:11:28,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 16:11:28,062 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-09-16 16:11:28,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-16 16:11:28,063 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:11:28,063 INFO L407 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] [2019-09-16 16:11:28,063 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:11:28,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:11:28,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1439024386, now seen corresponding path program 1 times [2019-09-16 16:11:28,064 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:11:28,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:11:28,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:11:28,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:11:28,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:11:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:11:28,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:11:28,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:11:28,243 INFO L224 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) [2019-09-16 16:11:28,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:11:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:11:28,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-16 16:11:28,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:11:28,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-16 16:11:28,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:11:28,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2019-09-16 16:11:28,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-16 16:11:28,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-16 16:11:28,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-16 16:11:28,519 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 10 states. [2019-09-16 16:11:28,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:11:28,930 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-09-16 16:11:28,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-16 16:11:28,931 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-09-16 16:11:28,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:11:28,932 INFO L225 Difference]: With dead ends: 46 [2019-09-16 16:11:28,932 INFO L226 Difference]: Without dead ends: 32 [2019-09-16 16:11:28,933 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-09-16 16:11:28,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-16 16:11:28,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-09-16 16:11:28,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-16 16:11:28,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-09-16 16:11:28,939 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 24 [2019-09-16 16:11:28,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:11:28,939 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-09-16 16:11:28,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-16 16:11:28,939 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-09-16 16:11:28,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-16 16:11:28,940 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:11:28,940 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:11:28,941 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:11:28,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:11:28,941 INFO L82 PathProgramCache]: Analyzing trace with hash -648228970, now seen corresponding path program 1 times [2019-09-16 16:11:28,941 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:11:28,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:11:28,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:11:28,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:11:28,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:11:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:11:29,019 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:11:29,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:11:29,020 INFO L224 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) [2019-09-16 16:11:29,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:11:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:11:29,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-16 16:11:29,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:11:29,120 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:11:29,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:11:29,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-16 16:11:29,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:11:29,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:11:29,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:11:29,126 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 6 states. [2019-09-16 16:11:29,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:11:29,192 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2019-09-16 16:11:29,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:11:29,193 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-09-16 16:11:29,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:11:29,194 INFO L225 Difference]: With dead ends: 52 [2019-09-16 16:11:29,194 INFO L226 Difference]: Without dead ends: 40 [2019-09-16 16:11:29,195 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:11:29,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-16 16:11:29,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2019-09-16 16:11:29,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-16 16:11:29,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-09-16 16:11:29,207 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2019-09-16 16:11:29,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:11:29,209 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-09-16 16:11:29,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:11:29,210 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-09-16 16:11:29,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-16 16:11:29,211 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:11:29,211 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:11:29,211 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:11:29,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:11:29,212 INFO L82 PathProgramCache]: Analyzing trace with hash -390063532, now seen corresponding path program 1 times [2019-09-16 16:11:29,212 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:11:29,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:11:29,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:11:29,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:11:29,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:11:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:11:31,681 WARN L191 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 163 DAG size of output: 31 [2019-09-16 16:11:34,154 WARN L191 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 81 DAG size of output: 40 [2019-09-16 16:11:34,162 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:11:34,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:11:34,163 INFO L224 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 [2019-09-16 16:11:34,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:11:34,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:11:34,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-16 16:11:34,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:11:34,293 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 45 treesize of output 41 [2019-09-16 16:11:34,293 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:11:34,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:11:34,308 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 1 [2019-09-16 16:11:34,308 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:11:36,410 WARN L191 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 58 DAG size of output: 21 [2019-09-16 16:11:36,411 INFO L567 ElimStorePlain]: treesize reduction 219, result has 10.6 percent of original size [2019-09-16 16:11:36,411 INFO L464 ElimStorePlain]: Eliminatee v_prenex_2 vanished before elimination [2019-09-16 16:11:36,413 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_6| vanished before elimination [2019-09-16 16:11:36,413 INFO L464 ElimStorePlain]: Eliminatee v_prenex_3 vanished before elimination [2019-09-16 16:11:36,413 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:11:36,414 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:293, output treesize:26 [2019-09-16 16:11:36,851 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-09-16 16:11:37,187 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-09-16 16:11:37,394 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:11:37,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:11:37,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2019-09-16 16:11:37,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-16 16:11:37,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-16 16:11:37,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2019-09-16 16:11:37,399 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 16 states. [2019-09-16 16:11:37,696 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-16 16:11:37,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:11:37,916 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2019-09-16 16:11:37,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-16 16:11:37,921 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2019-09-16 16:11:37,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:11:37,922 INFO L225 Difference]: With dead ends: 46 [2019-09-16 16:11:37,922 INFO L226 Difference]: Without dead ends: 36 [2019-09-16 16:11:37,922 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-09-16 16:11:37,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-16 16:11:37,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-09-16 16:11:37,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-16 16:11:37,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-09-16 16:11:37,928 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 28 [2019-09-16 16:11:37,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:11:37,929 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-09-16 16:11:37,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-16 16:11:37,929 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-09-16 16:11:37,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-16 16:11:37,930 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:11:37,930 INFO L407 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:11:37,931 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:11:37,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:11:37,931 INFO L82 PathProgramCache]: Analyzing trace with hash -723812178, now seen corresponding path program 2 times [2019-09-16 16:11:37,931 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:11:37,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:11:37,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:11:37,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:11:37,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:11:37,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:11:38,006 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:11:38,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:11:38,006 INFO L224 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 [2019-09-16 16:11:38,036 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-16 16:11:38,069 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-16 16:11:38,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:11:38,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-16 16:11:38,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:11:38,094 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:11:38,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:11:38,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-16 16:11:38,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-16 16:11:38,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-16 16:11:38,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:11:38,100 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 7 states. [2019-09-16 16:11:38,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:11:38,203 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2019-09-16 16:11:38,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:11:38,204 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-09-16 16:11:38,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:11:38,205 INFO L225 Difference]: With dead ends: 56 [2019-09-16 16:11:38,205 INFO L226 Difference]: Without dead ends: 44 [2019-09-16 16:11:38,206 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:11:38,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-16 16:11:38,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2019-09-16 16:11:38,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-16 16:11:38,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-09-16 16:11:38,212 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 32 [2019-09-16 16:11:38,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:11:38,212 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-09-16 16:11:38,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-16 16:11:38,213 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-09-16 16:11:38,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-16 16:11:38,214 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:11:38,214 INFO L407 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:11:38,214 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:11:38,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:11:38,214 INFO L82 PathProgramCache]: Analyzing trace with hash -465646740, now seen corresponding path program 2 times [2019-09-16 16:11:38,215 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:11:38,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:11:38,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:11:38,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:11:38,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:11:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:11:39,329 WARN L191 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 35 [2019-09-16 16:11:39,777 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2019-09-16 16:11:40,175 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-09-16 16:11:43,549 WARN L191 SmtUtils]: Spent 3.32 s on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2019-09-16 16:11:45,201 WARN L191 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2019-09-16 16:11:47,268 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_linear_search_#in~n| c_linear_search_~n) (or (not (= |c_linear_search_#in~a.offset| 0)) (let ((.cse27 (+ (div c_linear_search_~j~0 4294967296) 1))) (let ((.cse0 (or (<= 3 c_linear_search_~j~0) (< 0 .cse27)))) (and (let ((.cse16 (<= .cse27 0))) (or (let ((.cse22 (div c_linear_search_~n 4294967296))) (let ((.cse3 (* 4294967296 .cse22)) (.cse4 (* (- 1) c_linear_search_~j~0))) (and .cse0 (let ((.cse6 (select |c_#memory_int| |c_linear_search_#in~a.base|)) (.cse7 (- .cse4)) (.cse9 (* 8589934592 (div (+ (* (- 3) c_linear_search_~j~0) (* (- 4294967296) .cse22) c_linear_search_~n 11) 8589934592))) (.cse10 (* 2 c_linear_search_~n)) (.cse12 (* 8589934592 .cse22)) (.cse13 (* (- 4294967296) c_linear_search_~j~0)) (.cse14 (* 18446744073709551616 .cse22)) (.cse15 (* (- 4294967296) c_linear_search_~n))) (or (let ((.cse11 (div (+ .cse13 .cse14 .cse15 18446744090889420799) 18446744073709551616))) (let ((.cse5 (* (- 4294967296) .cse11))) (let ((.cse8 (* 2 (div (+ .cse4 .cse5 1) 2)))) (let ((.cse1 (+ c_linear_search_~j~0 (* 4294967296 .cse11) .cse12 1)) (.cse2 (+ .cse9 .cse10 .cse8))) (and (<= .cse1 .cse2) (<= (+ .cse3 (* 4294967296 (div (+ .cse4 .cse5 4294967296) 4294967296)) 3) c_linear_search_~n) (or (not (= |c_linear_search_#in~q| (select .cse6 (+ .cse7 (- .cse5) (- .cse8) (- 1))))) (< .cse1 .cse2))))))) .cse16 (let ((.cse21 (div (+ .cse13 .cse14 .cse15 36893488164598972415) 18446744073709551616))) (let ((.cse20 (* (- 4294967296) .cse21))) (let ((.cse19 (* 2 (div (+ .cse4 .cse20 1) 2)))) (let ((.cse17 (+ c_linear_search_~j~0 .cse12 (* 4294967296 .cse21) 1)) (.cse18 (+ .cse9 .cse19 .cse10))) (and (<= .cse17 .cse18) (or (not (= (select .cse6 (+ .cse7 (- .cse19) (- .cse20) (- 1))) |c_linear_search_#in~q|)) (< .cse17 .cse18))))))))) (let ((.cse24 (* (- 17179869184) c_linear_search_~j~0)) (.cse25 (* (- 36893488147419103232) .cse22)) (.cse26 (* 8589934592 c_linear_search_~n))) (or (let ((.cse23 (* (- 4294967296) (div (+ .cse24 .cse25 .cse26 42949672960) 36893488147419103232)))) (and (<= (+ (* 4294967296 (div (+ .cse4 .cse23 4294967296) 4294967296)) .cse3 3) c_linear_search_~n) (<= (+ c_linear_search_~j~0 (* 4294967296 (div (+ (* (- 2) (div (+ .cse4 .cse23 1) 2)) .cse3 (* (- 1) c_linear_search_~n) 4294967296) 4294967296))) 5))) (<= (+ .cse3 (* 4294967296 (div (+ .cse4 (* (- 4294967296) (div (+ .cse24 .cse25 .cse26 (- 36893488104469430272)) 36893488147419103232)) 4294967296) 4294967296)) 3) c_linear_search_~n)))))) .cse16)) .cse0))))) is different from false [2019-09-16 16:12:05,574 WARN L191 SmtUtils]: Spent 16.48 s on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-09-16 16:12:05,860 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-09-16 16:12:06,118 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-09-16 16:12:09,777 WARN L191 SmtUtils]: Spent 2.49 s on a formula simplification. DAG size of input: 300 DAG size of output: 38 [2019-09-16 16:12:09,788 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2019-09-16 16:12:09,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:12:09,789 INFO L224 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 [2019-09-16 16:12:09,808 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-16 16:12:09,885 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-16 16:12:09,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:12:09,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-16 16:12:09,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:12:09,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:12:17,323 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-16 16:12:17,323 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:12:17,394 INFO L567 ElimStorePlain]: treesize reduction 268, result has 12.7 percent of original size [2019-09-16 16:12:17,399 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 17 [2019-09-16 16:12:17,399 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:12:17,412 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:12:17,413 INFO L464 ElimStorePlain]: Eliminatee v_prenex_6 vanished before elimination [2019-09-16 16:12:17,413 INFO L464 ElimStorePlain]: Eliminatee v_prenex_7 vanished before elimination [2019-09-16 16:12:17,414 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:12:17,414 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:377, output treesize:35 [2019-09-16 16:12:17,946 WARN L191 SmtUtils]: Spent 477.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-09-16 16:12:18,522 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-09-16 16:12:22,710 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-09-16 16:12:23,447 WARN L191 SmtUtils]: Spent 583.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-09-16 16:12:27,529 WARN L191 SmtUtils]: Spent 3.86 s on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-09-16 16:12:27,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:12:27,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:12:27,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:12:27,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:12:27,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:12:29,809 WARN L191 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-16 16:12:33,183 WARN L191 SmtUtils]: Spent 783.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-09-16 16:12:34,744 WARN L191 SmtUtils]: Spent 634.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-09-16 16:12:36,999 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:12:37,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:12:37,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2019-09-16 16:12:37,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-16 16:12:37,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-16 16:12:37,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=757, Unknown=5, NotChecked=56, Total=930 [2019-09-16 16:12:37,005 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 31 states. [2019-09-16 16:12:37,493 WARN L191 SmtUtils]: Spent 435.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-09-16 16:12:38,205 WARN L191 SmtUtils]: Spent 504.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-09-16 16:12:38,532 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-09-16 16:12:39,894 WARN L191 SmtUtils]: Spent 1.22 s on a formula simplification that was a NOOP. DAG size: 54 [2019-09-16 16:12:41,950 WARN L191 SmtUtils]: Spent 1.94 s on a formula simplification that was a NOOP. DAG size: 59 [2019-09-16 16:12:44,267 WARN L191 SmtUtils]: Spent 2.18 s on a formula simplification that was a NOOP. DAG size: 56 [2019-09-16 16:12:46,550 WARN L191 SmtUtils]: Spent 2.18 s on a formula simplification that was a NOOP. DAG size: 64 [2019-09-16 16:12:47,530 WARN L191 SmtUtils]: Spent 870.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 73 [2019-09-16 16:12:49,954 WARN L191 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 173 DAG size of output: 58 [2019-09-16 16:12:52,261 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-09-16 16:12:52,577 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 64 [2019-09-16 16:12:54,179 WARN L191 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-09-16 16:12:54,389 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-09-16 16:12:54,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:12:54,482 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2019-09-16 16:12:54,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-16 16:12:54,482 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 32 [2019-09-16 16:12:54,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:12:54,483 INFO L225 Difference]: With dead ends: 50 [2019-09-16 16:12:54,483 INFO L226 Difference]: Without dead ends: 40 [2019-09-16 16:12:54,495 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 74.3s TimeCoverageRelationStatistics Valid=281, Invalid=1698, Unknown=5, NotChecked=86, Total=2070 [2019-09-16 16:12:54,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-16 16:12:54,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-09-16 16:12:54,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-16 16:12:54,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-09-16 16:12:54,503 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 32 [2019-09-16 16:12:54,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:12:54,503 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-09-16 16:12:54,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-16 16:12:54,503 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-09-16 16:12:54,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-16 16:12:54,504 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:12:54,505 INFO L407 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:12:54,505 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:12:54,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:12:54,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1595152954, now seen corresponding path program 3 times [2019-09-16 16:12:54,505 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:12:54,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:12:54,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:12:54,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:12:54,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:12:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:12:54,593 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:12:54,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:12:54,594 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:12:54,625 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-16 16:12:54,769 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-16 16:12:54,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:12:54,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-16 16:12:54,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:12:54,797 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:12:54,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:12:54,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-16 16:12:54,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-16 16:12:54,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-16 16:12:54,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-16 16:12:54,803 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 8 states. [2019-09-16 16:12:54,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:12:54,919 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-09-16 16:12:54,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-16 16:12:54,920 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-09-16 16:12:54,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:12:54,921 INFO L225 Difference]: With dead ends: 60 [2019-09-16 16:12:54,921 INFO L226 Difference]: Without dead ends: 48 [2019-09-16 16:12:54,921 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-16 16:12:54,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-16 16:12:54,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2019-09-16 16:12:54,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-16 16:12:54,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-09-16 16:12:54,928 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 36 [2019-09-16 16:12:54,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:12:54,928 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-09-16 16:12:54,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-16 16:12:54,929 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-09-16 16:12:54,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-16 16:12:54,930 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:12:54,930 INFO L407 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:12:54,930 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:12:54,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:12:54,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1336987516, now seen corresponding path program 3 times [2019-09-16 16:12:54,930 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:12:54,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:12:54,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:12:54,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:12:54,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:12:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:12:57,398 WARN L191 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 145 DAG size of output: 32 [2019-09-16 16:12:58,108 WARN L191 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-09-16 16:12:58,620 WARN L191 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2019-09-16 16:12:58,935 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-16 16:13:08,327 WARN L191 SmtUtils]: Spent 7.17 s on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-16 16:13:11,778 WARN L191 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 125 DAG size of output: 45 [2019-09-16 16:13:11,789 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:13:11,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:13:11,789 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:13:11,812 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-16 16:13:11,952 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-16 16:13:11,953 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:13:11,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-16 16:13:11,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:13:11,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:13:26,218 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-16 16:13:26,219 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:13:34,328 WARN L191 SmtUtils]: Spent 8.11 s on a formula simplification. DAG size of input: 61 DAG size of output: 30 [2019-09-16 16:13:34,328 INFO L567 ElimStorePlain]: treesize reduction 265, result has 14.2 percent of original size [2019-09-16 16:13:34,329 INFO L464 ElimStorePlain]: Eliminatee v_prenex_12 vanished before elimination [2019-09-16 16:13:34,334 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 17 [2019-09-16 16:13:34,335 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:13:34,350 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:13:34,351 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_8| vanished before elimination [2019-09-16 16:13:34,352 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:13:34,352 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:377, output treesize:40 [2019-09-16 16:13:35,243 WARN L191 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-16 16:13:37,769 WARN L191 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-09-16 16:13:38,395 WARN L191 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2019-09-16 16:13:40,480 WARN L191 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2019-09-16 16:13:41,153 WARN L191 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2019-09-16 16:13:42,090 WARN L191 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 74 [2019-09-16 16:13:42,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:13:42,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:13:42,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:13:42,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:13:42,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:13:42,987 WARN L191 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 77 [2019-09-16 16:13:43,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:13:43,911 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2019-09-16 16:13:44,150 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:13:44,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:13:44,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20] total 34 [2019-09-16 16:13:44,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-16 16:13:44,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-16 16:13:44,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1005, Unknown=8, NotChecked=0, Total=1122 [2019-09-16 16:13:44,159 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 34 states. [2019-09-16 16:13:44,360 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-09-16 16:13:44,997 WARN L191 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-16 16:13:47,761 WARN L191 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-16 16:13:48,248 WARN L191 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 62 [2019-09-16 16:13:48,486 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-16 16:13:49,299 WARN L191 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-09-16 16:13:52,686 WARN L191 SmtUtils]: Spent 3.01 s on a formula simplification. DAG size of input: 161 DAG size of output: 71 [2019-09-16 16:13:53,163 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 67 [2019-09-16 16:14:03,107 WARN L191 SmtUtils]: Spent 9.24 s on a formula simplification. DAG size of input: 148 DAG size of output: 87 [2019-09-16 16:14:04,181 WARN L191 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 78 [2019-09-16 16:14:04,557 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 75 [2019-09-16 16:14:05,712 WARN L191 SmtUtils]: Spent 850.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 83 [2019-09-16 16:14:06,537 WARN L191 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 91 [2019-09-16 16:14:07,003 WARN L191 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 77 [2019-09-16 16:14:08,066 WARN L191 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 106 [2019-09-16 16:14:12,893 WARN L191 SmtUtils]: Spent 3.92 s on a formula simplification. DAG size of input: 188 DAG size of output: 136 [2019-09-16 16:14:14,786 WARN L191 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 138 DAG size of output: 105 [2019-09-16 16:14:15,477 WARN L191 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 94 [2019-09-16 16:14:15,797 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-09-16 16:14:15,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:14:15,964 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-09-16 16:14:15,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-16 16:14:15,965 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 36 [2019-09-16 16:14:15,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:14:15,966 INFO L225 Difference]: With dead ends: 54 [2019-09-16 16:14:15,966 INFO L226 Difference]: Without dead ends: 44 [2019-09-16 16:14:15,969 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 17 SyntacticMatches, 7 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 70.7s TimeCoverageRelationStatistics Valid=347, Invalid=2615, Unknown=8, NotChecked=0, Total=2970 [2019-09-16 16:14:15,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-16 16:14:15,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-09-16 16:14:15,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-16 16:14:15,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-09-16 16:14:15,977 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 36 [2019-09-16 16:14:15,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:14:15,977 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-09-16 16:14:15,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-16 16:14:15,977 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-09-16 16:14:15,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-16 16:14:15,978 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:14:15,978 INFO L407 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:14:15,978 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:14:15,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:14:15,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1972633310, now seen corresponding path program 4 times [2019-09-16 16:14:15,979 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:14:15,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:14:15,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:14:15,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:14:15,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:14:15,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:14:16,092 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:14:16,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:14:16,092 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:14:16,128 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-16 16:14:16,165 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-16 16:14:16,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:14:16,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-16 16:14:16,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:14:16,199 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:14:16,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:14:16,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-16 16:14:16,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-16 16:14:16,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-16 16:14:16,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-16 16:14:16,206 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 9 states. [2019-09-16 16:14:16,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:14:16,352 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2019-09-16 16:14:16,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-16 16:14:16,354 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2019-09-16 16:14:16,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:14:16,355 INFO L225 Difference]: With dead ends: 64 [2019-09-16 16:14:16,355 INFO L226 Difference]: Without dead ends: 52 [2019-09-16 16:14:16,356 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-16 16:14:16,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-16 16:14:16,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2019-09-16 16:14:16,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-16 16:14:16,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-09-16 16:14:16,368 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 40 [2019-09-16 16:14:16,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:14:16,368 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-09-16 16:14:16,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-16 16:14:16,368 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-09-16 16:14:16,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-16 16:14:16,371 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:14:16,371 INFO L407 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:14:16,371 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:14:16,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:14:16,372 INFO L82 PathProgramCache]: Analyzing trace with hash -2064168548, now seen corresponding path program 4 times [2019-09-16 16:14:16,372 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:14:16,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:14:16,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:14:16,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:14:16,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:14:16,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:14:16,808 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 31 [2019-09-16 16:14:17,417 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-09-16 16:14:22,428 WARN L191 SmtUtils]: Spent 4.30 s on a formula simplification. DAG size of input: 184 DAG size of output: 50 [2019-09-16 16:14:22,438 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:14:22,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:14:22,439 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:14:22,467 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-16 16:14:22,632 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-16 16:14:22,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:14:22,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-16 16:14:22,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:14:22,652 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-16 16:14:22,652 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:14:24,719 WARN L191 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 53 DAG size of output: 23 [2019-09-16 16:14:24,720 INFO L567 ElimStorePlain]: treesize reduction 207, result has 12.7 percent of original size [2019-09-16 16:14:24,729 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 17 [2019-09-16 16:14:24,729 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:14:24,736 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:14:24,737 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_9| vanished before elimination [2019-09-16 16:14:24,737 INFO L464 ElimStorePlain]: Eliminatee v_prenex_15 vanished before elimination [2019-09-16 16:14:24,737 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:14:24,737 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:293, output treesize:26 [2019-09-16 16:14:25,234 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-16 16:14:25,518 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-09-16 16:14:25,820 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-09-16 16:14:26,192 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-09-16 16:14:26,635 WARN L191 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-09-16 16:14:27,165 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2019-09-16 16:14:27,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:27,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:27,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:27,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:27,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:27,731 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2019-09-16 16:14:28,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:28,397 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:14:28,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:14:28,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20] total 34 [2019-09-16 16:14:28,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-16 16:14:28,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-16 16:14:28,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1027, Unknown=0, NotChecked=0, Total=1122 [2019-09-16 16:14:28,403 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 34 states. [2019-09-16 16:14:30,972 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-16 16:14:31,215 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-16 16:14:31,712 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-16 16:14:32,069 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-09-16 16:14:32,655 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-16 16:14:33,099 WARN L191 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-09-16 16:14:33,290 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-09-16 16:14:33,858 WARN L191 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-16 16:14:34,325 WARN L191 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 82 [2019-09-16 16:14:36,560 WARN L191 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-09-16 16:14:36,873 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 108 [2019-09-16 16:14:37,495 WARN L191 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 111 [2019-09-16 16:14:37,753 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-16 16:14:38,146 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 96 [2019-09-16 16:14:38,629 WARN L191 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 94 [2019-09-16 16:14:39,100 WARN L191 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 95 [2019-09-16 16:14:39,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:14:39,220 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2019-09-16 16:14:39,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-16 16:14:39,220 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 40 [2019-09-16 16:14:39,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:14:39,221 INFO L225 Difference]: With dead ends: 58 [2019-09-16 16:14:39,221 INFO L226 Difference]: Without dead ends: 48 [2019-09-16 16:14:39,222 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=281, Invalid=2689, Unknown=0, NotChecked=0, Total=2970 [2019-09-16 16:14:39,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-16 16:14:39,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-09-16 16:14:39,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-16 16:14:39,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-09-16 16:14:39,235 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 40 [2019-09-16 16:14:39,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:14:39,235 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-09-16 16:14:39,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-16 16:14:39,235 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-09-16 16:14:39,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-16 16:14:39,238 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:14:39,238 INFO L407 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:14:39,238 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:14:39,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:14:39,238 INFO L82 PathProgramCache]: Analyzing trace with hash 400149494, now seen corresponding path program 5 times [2019-09-16 16:14:39,238 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:14:39,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:14:39,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:14:39,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:14:39,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:14:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:14:39,358 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 18 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:14:39,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:14:39,358 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:14:39,402 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-16 16:14:39,690 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-16 16:14:39,691 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:14:39,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-16 16:14:39,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:14:39,727 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 18 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:14:39,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:14:39,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-16 16:14:39,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-16 16:14:39,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-16 16:14:39,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-16 16:14:39,733 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 10 states. [2019-09-16 16:14:39,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:14:39,933 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2019-09-16 16:14:39,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-16 16:14:39,934 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2019-09-16 16:14:39,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:14:39,935 INFO L225 Difference]: With dead ends: 68 [2019-09-16 16:14:39,935 INFO L226 Difference]: Without dead ends: 56 [2019-09-16 16:14:39,936 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-16 16:14:39,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-16 16:14:39,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2019-09-16 16:14:39,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-16 16:14:39,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-09-16 16:14:39,943 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 44 [2019-09-16 16:14:39,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:14:39,944 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-09-16 16:14:39,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-16 16:14:39,944 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-09-16 16:14:39,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-16 16:14:39,945 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:14:39,945 INFO L407 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:14:39,945 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:14:39,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:14:39,946 INFO L82 PathProgramCache]: Analyzing trace with hash 658314932, now seen corresponding path program 5 times [2019-09-16 16:14:39,946 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:14:39,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:14:39,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:14:39,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:14:39,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:14:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:58,134 WARN L191 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 37 [2019-09-16 16:18:58,785 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-09-16 16:18:59,244 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 55 [2019-09-16 16:19:00,627 WARN L191 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-09-16 16:19:03,133 WARN L191 SmtUtils]: Spent 927.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2019-09-16 16:19:22,794 WARN L191 SmtUtils]: Spent 17.30 s on a formula simplification. DAG size of input: 108 DAG size of output: 78 [2019-09-16 16:19:52,942 WARN L191 SmtUtils]: Spent 19.35 s on a formula simplification. DAG size of input: 98 DAG size of output: 70 [2019-09-16 16:20:15,952 WARN L191 SmtUtils]: Spent 14.95 s on a formula simplification. DAG size of input: 99 DAG size of output: 72 [2019-09-16 16:20:43,654 WARN L191 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 68 [2019-09-16 16:20:49,781 WARN L191 SmtUtils]: Spent 2.76 s on a formula simplification. DAG size of input: 90 DAG size of output: 67 [2019-09-16 16:20:57,678 WARN L191 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 219 DAG size of output: 72 [2019-09-16 16:20:57,698 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 74 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:20:57,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:20:57,698 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:20:57,730 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-16 16:20:58,080 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-16 16:20:58,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:20:58,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-16 16:20:58,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:20:58,111 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-16 16:20:58,111 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:20:58,117 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-16 16:20:58,118 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:21:00,189 WARN L191 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 52 DAG size of output: 23 [2019-09-16 16:21:00,189 INFO L567 ElimStorePlain]: treesize reduction 170, result has 15.0 percent of original size [2019-09-16 16:21:00,192 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 17 [2019-09-16 16:21:00,193 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:21:00,200 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:21:00,200 INFO L464 ElimStorePlain]: Eliminatee v_prenex_16 vanished before elimination [2019-09-16 16:21:00,201 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_10| vanished before elimination [2019-09-16 16:21:00,201 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:21:00,201 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:293, output treesize:26 [2019-09-16 16:21:18,847 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-09-16 16:21:19,383 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-16 16:21:26,615 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-16 16:21:33,447 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-09-16 16:21:42,000 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-09-16 16:21:48,130 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:21:48,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:21:48,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 37 [2019-09-16 16:21:48,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-16 16:21:48,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-16 16:21:48,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1191, Unknown=27, NotChecked=0, Total=1332 [2019-09-16 16:21:48,137 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 37 states. [2019-09-16 16:22:02,329 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 70 [2019-09-16 16:22:02,949 WARN L191 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 105 [2019-09-16 16:22:04,766 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 99 [2019-09-16 16:22:10,833 WARN L191 SmtUtils]: Spent 3.23 s on a formula simplification. DAG size of input: 142 DAG size of output: 113 [2019-09-16 16:22:14,307 WARN L191 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 137 DAG size of output: 82 [2019-09-16 16:22:18,996 WARN L191 SmtUtils]: Spent 3.55 s on a formula simplification. DAG size of input: 115 DAG size of output: 59 [2019-09-16 16:22:19,426 WARN L191 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 55 [2019-09-16 16:22:42,597 WARN L191 SmtUtils]: Spent 13.68 s on a formula simplification that was a NOOP. DAG size: 97 [2019-09-16 16:22:42,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:22:42,815 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2019-09-16 16:22:42,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-16 16:22:42,817 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 44 [2019-09-16 16:22:42,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:22:42,818 INFO L225 Difference]: With dead ends: 62 [2019-09-16 16:22:42,818 INFO L226 Difference]: Without dead ends: 52 [2019-09-16 16:22:42,819 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 206.4s TimeCoverageRelationStatistics Valid=315, Invalid=3076, Unknown=31, NotChecked=0, Total=3422 [2019-09-16 16:22:42,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-16 16:22:42,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-09-16 16:22:42,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-16 16:22:42,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-09-16 16:22:42,827 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 44 [2019-09-16 16:22:42,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:22:42,827 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-09-16 16:22:42,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-16 16:22:42,827 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-09-16 16:22:42,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-16 16:22:42,828 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:22:42,828 INFO L407 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:22:42,828 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:22:42,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:22:42,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1505971470, now seen corresponding path program 6 times [2019-09-16 16:22:42,829 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:22:42,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:22:42,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:22:42,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:22:42,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:22:42,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:22:42,959 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 21 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:22:42,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:22:42,959 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:22:43,009 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-16 16:23:26,696 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-09-16 16:23:26,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:23:26,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-16 16:23:26,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:23:26,867 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 21 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:23:26,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:23:26,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-16 16:23:26,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-16 16:23:26,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-16 16:23:26,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-16 16:23:26,876 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 11 states. [2019-09-16 16:23:27,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:23:27,141 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2019-09-16 16:23:27,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-16 16:23:27,146 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2019-09-16 16:23:27,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:23:27,147 INFO L225 Difference]: With dead ends: 72 [2019-09-16 16:23:27,147 INFO L226 Difference]: Without dead ends: 60 [2019-09-16 16:23:27,148 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-16 16:23:27,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-16 16:23:27,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2019-09-16 16:23:27,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-16 16:23:27,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-09-16 16:23:27,156 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 48 [2019-09-16 16:23:27,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:23:27,157 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-09-16 16:23:27,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-16 16:23:27,157 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-09-16 16:23:27,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-16 16:23:27,158 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:23:27,158 INFO L407 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:23:27,158 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:23:27,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:23:27,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1764136908, now seen corresponding path program 6 times [2019-09-16 16:23:27,159 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:23:27,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:23:27,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:23:27,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:23:27,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:23:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:23:27,610 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 36 [2019-09-16 16:23:27,767 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 21 [2019-09-16 16:23:28,114 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 42 [2019-09-16 16:23:28,562 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-09-16 16:23:31,706 WARN L191 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 185 DAG size of output: 51 [2019-09-16 16:23:31,724 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:23:31,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:23:31,725 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:23:31,757 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-16 16:24:16,839 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-09-16 16:24:16,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:24:16,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-16 16:24:16,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:24:16,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:24:27,088 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 55 treesize of output 51 [2019-09-16 16:24:27,088 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:24:27,097 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 56 treesize of output 52 [2019-09-16 16:24:27,098 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:24:29,181 WARN L191 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 64 DAG size of output: 24 [2019-09-16 16:24:29,182 INFO L567 ElimStorePlain]: treesize reduction 319, result has 9.1 percent of original size [2019-09-16 16:24:29,182 INFO L464 ElimStorePlain]: Eliminatee v_prenex_20 vanished before elimination [2019-09-16 16:24:29,182 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_11| vanished before elimination [2019-09-16 16:24:29,182 INFO L464 ElimStorePlain]: Eliminatee v_prenex_22 vanished before elimination [2019-09-16 16:24:29,183 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:24:29,183 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:359, output treesize:32 [2019-09-16 16:24:29,713 WARN L191 SmtUtils]: Spent 478.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-09-16 16:24:30,476 WARN L191 SmtUtils]: Spent 465.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-09-16 16:24:33,168 WARN L191 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-16 16:24:34,506 WARN L191 SmtUtils]: Spent 1.13 s on a formula simplification that was a NOOP. DAG size: 43 [2019-09-16 16:24:36,893 WARN L191 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-09-16 16:24:37,958 WARN L191 SmtUtils]: Spent 815.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-09-16 16:24:38,691 WARN L191 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-09-16 16:24:39,000 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:24:39,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:24:39,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 37 [2019-09-16 16:24:39,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-16 16:24:39,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-16 16:24:39,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1200, Unknown=5, NotChecked=0, Total=1332 [2019-09-16 16:24:39,009 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 37 states. [2019-09-16 16:24:41,475 WARN L191 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 56 DAG size of output: 38 [2019-09-16 16:24:42,163 WARN L191 SmtUtils]: Spent 526.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-09-16 16:24:43,016 WARN L191 SmtUtils]: Spent 497.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-09-16 16:24:44,262 WARN L191 SmtUtils]: Spent 1.11 s on a formula simplification that was a NOOP. DAG size: 56 [2019-09-16 16:24:45,137 WARN L191 SmtUtils]: Spent 671.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-09-16 16:24:46,503 WARN L191 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 84 DAG size of output: 64 [2019-09-16 16:24:47,933 WARN L191 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-09-16 16:24:48,775 WARN L191 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2019-09-16 16:24:50,278 WARN L191 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-09-16 16:24:52,654 WARN L191 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 110 DAG size of output: 72 [2019-09-16 16:24:52,884 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 65 [2019-09-16 16:24:55,346 WARN L191 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 53 [2019-09-16 16:24:56,047 WARN L191 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-09-16 16:24:56,871 WARN L191 SmtUtils]: Spent 688.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-16 16:24:57,825 WARN L191 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-16 16:24:57,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:24:57,937 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2019-09-16 16:24:57,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-16 16:24:57,944 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 48 [2019-09-16 16:24:57,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:24:57,945 INFO L225 Difference]: With dead ends: 66 [2019-09-16 16:24:57,945 INFO L226 Difference]: Without dead ends: 56 [2019-09-16 16:24:57,947 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 27 SyntacticMatches, 7 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 41.8s TimeCoverageRelationStatistics Valid=337, Invalid=2850, Unknown=5, NotChecked=0, Total=3192 [2019-09-16 16:24:57,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-16 16:24:57,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-09-16 16:24:57,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-16 16:24:57,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-09-16 16:24:57,963 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 48 [2019-09-16 16:24:57,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:24:57,963 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-09-16 16:24:57,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-16 16:24:57,964 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-09-16 16:24:57,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-16 16:24:57,968 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:24:57,968 INFO L407 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:24:57,968 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:24:57,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:24:57,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1705606618, now seen corresponding path program 7 times [2019-09-16 16:24:57,968 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:24:57,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:24:57,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:24:57,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:24:57,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:24:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:24:58,120 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 24 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:24:58,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:24:58,121 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:24:58,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:24:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:24:58,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-16 16:24:58,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:24:58,234 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 24 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:24:58,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:24:58,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-16 16:24:58,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-16 16:24:58,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-16 16:24:58,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-16 16:24:58,242 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 12 states. [2019-09-16 16:24:58,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:24:58,539 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2019-09-16 16:24:58,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-16 16:24:58,539 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2019-09-16 16:24:58,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:24:58,540 INFO L225 Difference]: With dead ends: 76 [2019-09-16 16:24:58,540 INFO L226 Difference]: Without dead ends: 64 [2019-09-16 16:24:58,541 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-16 16:24:58,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-16 16:24:58,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2019-09-16 16:24:58,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-16 16:24:58,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-09-16 16:24:58,549 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 52 [2019-09-16 16:24:58,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:24:58,549 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-09-16 16:24:58,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-16 16:24:58,549 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-09-16 16:24:58,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-16 16:24:58,550 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:24:58,550 INFO L407 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:24:58,550 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:24:58,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:24:58,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1447441180, now seen corresponding path program 7 times [2019-09-16 16:24:58,550 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:24:58,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:24:58,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:24:58,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:24:58,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:24:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:01,009 WARN L191 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 179 DAG size of output: 34 [2019-09-16 16:25:04,128 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-16 16:25:04,663 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 55 [2019-09-16 16:25:04,681 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:25:04,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:25:04,681 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:25:04,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:25:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:25:04,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-16 16:25:04,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:25:04,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:21,231 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 29 DAG size of output: 13 [2019-09-16 16:25:21,251 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 59 treesize of output 55 [2019-09-16 16:25:21,252 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:21,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:25:21,262 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 1 [2019-09-16 16:25:21,262 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:25:21,336 INFO L567 ElimStorePlain]: treesize reduction 280, result has 11.1 percent of original size [2019-09-16 16:25:21,337 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_12| vanished before elimination [2019-09-16 16:25:21,337 INFO L464 ElimStorePlain]: Eliminatee v_prenex_24 vanished before elimination [2019-09-16 16:25:21,337 INFO L464 ElimStorePlain]: Eliminatee v_prenex_26 vanished before elimination [2019-09-16 16:25:21,337 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:25:21,337 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:377, output treesize:35 [2019-09-16 16:25:22,034 WARN L191 SmtUtils]: Spent 476.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-09-16 16:25:22,541 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-16 16:25:24,014 WARN L191 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-09-16 16:25:25,101 WARN L191 SmtUtils]: Spent 893.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-16 16:25:25,709 WARN L191 SmtUtils]: Spent 515.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-09-16 16:25:27,139 WARN L191 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2019-09-16 16:25:27,669 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-09-16 16:25:29,927 WARN L191 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 70 DAG size of output: 70 [2019-09-16 16:25:30,830 WARN L191 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-09-16 16:25:33,006 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 71 [2019-09-16 16:25:34,638 WARN L191 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 78 DAG size of output: 78 [2019-09-16 16:25:34,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:34,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:34,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:34,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:34,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:25:38,847 WARN L191 SmtUtils]: Spent 3.69 s on a formula simplification. DAG size of input: 102 DAG size of output: 83 [2019-09-16 16:25:39,600 WARN L191 SmtUtils]: Spent 584.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-09-16 16:25:40,448 WARN L191 SmtUtils]: Spent 669.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-09-16 16:25:41,342 WARN L191 SmtUtils]: Spent 697.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-09-16 16:25:42,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms