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/vogal-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 02:33:15,764 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 02:33:15,766 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 02:33:15,778 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 02:33:15,779 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 02:33:15,780 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 02:33:15,781 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 02:33:15,783 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 02:33:15,785 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 02:33:15,785 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 02:33:15,786 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 02:33:15,787 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 02:33:15,788 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 02:33:15,789 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 02:33:15,790 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 02:33:15,791 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 02:33:15,792 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 02:33:15,793 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 02:33:15,795 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 02:33:15,796 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 02:33:15,798 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 02:33:15,799 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 02:33:15,800 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 02:33:15,801 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 02:33:15,803 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 02:33:15,803 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 02:33:15,804 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 02:33:15,805 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 02:33:15,805 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 02:33:15,806 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 02:33:15,806 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 02:33:15,807 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 02:33:15,808 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 02:33:15,809 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 02:33:15,810 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 02:33:15,810 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 02:33:15,811 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 02:33:15,811 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 02:33:15,811 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 02:33:15,812 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 02:33:15,813 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 02:33:15,813 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-08 02:33:15,828 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 02:33:15,828 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 02:33:15,829 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 02:33:15,830 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 02:33:15,830 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 02:33:15,830 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 02:33:15,830 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 02:33:15,830 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 02:33:15,831 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 02:33:15,831 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 02:33:15,831 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 02:33:15,831 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 02:33:15,831 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 02:33:15,832 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 02:33:15,832 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 02:33:15,832 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 02:33:15,832 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 02:33:15,832 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 02:33:15,833 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 02:33:15,833 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 02:33:15,833 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 02:33:15,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 02:33:15,833 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 02:33:15,834 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 02:33:15,834 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 02:33:15,834 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 02:33:15,834 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 02:33:15,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 02:33:15,835 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 02:33:15,865 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 02:33:15,878 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 02:33:15,881 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 02:33:15,883 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 02:33:15,883 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 02:33:15,884 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/vogal-1.i [2019-09-08 02:33:15,944 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45f3acab1/7317e853d7244b71b2a3a8a61bb474db/FLAG323f4e35b [2019-09-08 02:33:16,410 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 02:33:16,413 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/vogal-1.i [2019-09-08 02:33:16,420 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45f3acab1/7317e853d7244b71b2a3a8a61bb474db/FLAG323f4e35b [2019-09-08 02:33:16,765 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45f3acab1/7317e853d7244b71b2a3a8a61bb474db [2019-09-08 02:33:16,777 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 02:33:16,778 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 02:33:16,780 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 02:33:16,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 02:33:16,783 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 02:33:16,784 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:33:16" (1/1) ... [2019-09-08 02:33:16,787 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fded98b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:33:16, skipping insertion in model container [2019-09-08 02:33:16,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:33:16" (1/1) ... [2019-09-08 02:33:16,797 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 02:33:16,815 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 02:33:17,035 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:33:17,039 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 02:33:17,068 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:33:17,169 INFO L192 MainTranslator]: Completed translation [2019-09-08 02:33:17,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:33:17 WrapperNode [2019-09-08 02:33:17,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 02:33:17,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 02:33:17,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 02:33:17,172 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 02:33:17,183 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:33:17" (1/1) ... [2019-09-08 02:33:17,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:33:17" (1/1) ... [2019-09-08 02:33:17,191 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:33:17" (1/1) ... [2019-09-08 02:33:17,191 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:33:17" (1/1) ... [2019-09-08 02:33:17,201 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:33:17" (1/1) ... [2019-09-08 02:33:17,208 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:33:17" (1/1) ... [2019-09-08 02:33:17,211 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:33:17" (1/1) ... [2019-09-08 02:33:17,214 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 02:33:17,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 02:33:17,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 02:33:17,215 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 02:33:17,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:33:17" (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-08 02:33:17,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 02:33:17,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 02:33:17,270 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-08 02:33:17,271 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 02:33:17,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 02:33:17,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 02:33:17,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-08 02:33:17,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 02:33:17,272 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 02:33:17,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 02:33:17,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 02:33:17,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 02:33:17,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 02:33:17,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 02:33:17,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 02:33:17,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 02:33:17,642 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 02:33:17,642 INFO L283 CfgBuilder]: Removed 6 assume(true) statements. [2019-09-08 02:33:17,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:33:17 BoogieIcfgContainer [2019-09-08 02:33:17,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 02:33:17,645 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 02:33:17,645 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 02:33:17,648 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 02:33:17,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 02:33:16" (1/3) ... [2019-09-08 02:33:17,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fac0183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:33:17, skipping insertion in model container [2019-09-08 02:33:17,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:33:17" (2/3) ... [2019-09-08 02:33:17,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fac0183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:33:17, skipping insertion in model container [2019-09-08 02:33:17,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:33:17" (3/3) ... [2019-09-08 02:33:17,651 INFO L109 eAbstractionObserver]: Analyzing ICFG vogal-1.i [2019-09-08 02:33:17,661 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 02:33:17,669 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 02:33:17,691 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 02:33:17,717 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 02:33:17,717 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 02:33:17,718 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 02:33:17,718 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 02:33:17,718 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 02:33:17,718 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 02:33:17,718 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 02:33:17,718 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 02:33:17,718 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 02:33:17,735 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2019-09-08 02:33:17,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-08 02:33:17,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:33:17,743 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:33:17,745 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:33:17,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:33:17,751 INFO L82 PathProgramCache]: Analyzing trace with hash 2138170830, now seen corresponding path program 1 times [2019-09-08 02:33:17,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:33:17,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:33:17,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:33:17,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:33:17,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:33:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:33:17,900 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-08 02:33:17,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:33:17,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 02:33:17,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 02:33:17,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 02:33:17,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 02:33:17,924 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2019-09-08 02:33:17,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:33:17,952 INFO L93 Difference]: Finished difference Result 66 states and 95 transitions. [2019-09-08 02:33:17,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 02:33:17,954 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-09-08 02:33:17,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:33:17,963 INFO L225 Difference]: With dead ends: 66 [2019-09-08 02:33:17,963 INFO L226 Difference]: Without dead ends: 30 [2019-09-08 02:33:17,967 INFO L628 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-08 02:33:17,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-08 02:33:18,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-08 02:33:18,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-08 02:33:18,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-09-08 02:33:18,013 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 18 [2019-09-08 02:33:18,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:33:18,013 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-09-08 02:33:18,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 02:33:18,014 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-09-08 02:33:18,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-08 02:33:18,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:33:18,015 INFO L399 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-08 02:33:18,016 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:33:18,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:33:18,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1430244045, now seen corresponding path program 1 times [2019-09-08 02:33:18,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:33:18,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:33:18,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:33:18,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:33:18,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:33:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:33:18,181 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-08 02:33:18,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:33:18,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 02:33:18,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 02:33:18,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 02:33:18,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 02:33:18,184 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 3 states. [2019-09-08 02:33:18,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:33:18,293 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2019-09-08 02:33:18,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 02:33:18,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-08 02:33:18,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:33:18,297 INFO L225 Difference]: With dead ends: 67 [2019-09-08 02:33:18,298 INFO L226 Difference]: Without dead ends: 45 [2019-09-08 02:33:18,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 02:33:18,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-08 02:33:18,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2019-09-08 02:33:18,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-08 02:33:18,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-09-08 02:33:18,315 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 20 [2019-09-08 02:33:18,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:33:18,316 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-09-08 02:33:18,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 02:33:18,316 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2019-09-08 02:33:18,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-08 02:33:18,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:33:18,319 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:33:18,319 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:33:18,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:33:18,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1498528533, now seen corresponding path program 1 times [2019-09-08 02:33:18,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:33:18,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:33:18,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:33:18,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:33:18,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:33:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:33:18,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:33:18,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:33:18,453 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:33:18,471 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-08 02:33:18,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:33:18,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-08 02:33:18,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:33:18,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 02:33:18,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 02:33:18,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2019-09-08 02:33:18,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 02:33:18,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 02:33:18,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 02:33:18,576 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 8 states. [2019-09-08 02:33:18,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:33:18,958 INFO L93 Difference]: Finished difference Result 139 states and 190 transitions. [2019-09-08 02:33:18,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 02:33:18,958 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-09-08 02:33:18,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:33:18,960 INFO L225 Difference]: With dead ends: 139 [2019-09-08 02:33:18,961 INFO L226 Difference]: Without dead ends: 112 [2019-09-08 02:33:18,962 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-09-08 02:33:18,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-08 02:33:18,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 45. [2019-09-08 02:33:18,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-08 02:33:18,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2019-09-08 02:33:18,973 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 22 [2019-09-08 02:33:18,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:33:18,973 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2019-09-08 02:33:18,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 02:33:18,974 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2019-09-08 02:33:18,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-08 02:33:18,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:33:18,975 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:33:18,976 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:33:18,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:33:18,988 INFO L82 PathProgramCache]: Analyzing trace with hash -688638064, now seen corresponding path program 1 times [2019-09-08 02:33:18,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:33:18,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:33:18,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:33:18,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:33:18,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:33:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:33:19,098 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 02:33:19,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:33:19,098 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:33:19,112 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-08 02:33:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:33:19,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 02:33:19,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:33:19,172 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 02:33:19,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 02:33:19,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-09-08 02:33:19,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 02:33:19,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 02:33:19,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-08 02:33:19,179 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand 7 states. [2019-09-08 02:33:19,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:33:19,417 INFO L93 Difference]: Finished difference Result 209 states and 286 transitions. [2019-09-08 02:33:19,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 02:33:19,418 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-09-08 02:33:19,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:33:19,422 INFO L225 Difference]: With dead ends: 209 [2019-09-08 02:33:19,422 INFO L226 Difference]: Without dead ends: 175 [2019-09-08 02:33:19,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 02:33:19,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-09-08 02:33:19,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 51. [2019-09-08 02:33:19,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-08 02:33:19,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2019-09-08 02:33:19,447 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 30 [2019-09-08 02:33:19,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:33:19,448 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2019-09-08 02:33:19,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 02:33:19,448 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2019-09-08 02:33:19,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-08 02:33:19,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:33:19,449 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:33:19,449 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:33:19,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:33:19,450 INFO L82 PathProgramCache]: Analyzing trace with hash -610668811, now seen corresponding path program 1 times [2019-09-08 02:33:19,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:33:19,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:33:19,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:33:19,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:33:19,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:33:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:33:19,637 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 02:33:19,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:33:19,637 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:33:19,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:33:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:33:19,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 02:33:19,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:33:19,836 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-08 02:33:19,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:33:19,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:33:19,851 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:33:19,851 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-08 02:33:19,871 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 02:33:19,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:33:19,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2019-09-08 02:33:19,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 02:33:19,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 02:33:19,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-08 02:33:19,877 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand 13 states. [2019-09-08 02:33:20,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:33:20,339 INFO L93 Difference]: Finished difference Result 193 states and 262 transitions. [2019-09-08 02:33:20,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 02:33:20,342 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2019-09-08 02:33:20,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:33:20,343 INFO L225 Difference]: With dead ends: 193 [2019-09-08 02:33:20,343 INFO L226 Difference]: Without dead ends: 150 [2019-09-08 02:33:20,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2019-09-08 02:33:20,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-08 02:33:20,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 51. [2019-09-08 02:33:20,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-08 02:33:20,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2019-09-08 02:33:20,365 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 33 [2019-09-08 02:33:20,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:33:20,366 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2019-09-08 02:33:20,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 02:33:20,366 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2019-09-08 02:33:20,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-08 02:33:20,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:33:20,372 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:33:20,372 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:33:20,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:33:20,373 INFO L82 PathProgramCache]: Analyzing trace with hash 511595119, now seen corresponding path program 1 times [2019-09-08 02:33:20,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:33:20,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:33:20,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:33:20,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:33:20,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:33:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:33:20,534 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 02:33:20,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:33:20,534 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:33:20,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:33:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:33:20,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 02:33:20,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:33:20,720 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-09-08 02:33:20,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:33:20,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:33:20,723 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:33:20,724 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-09-08 02:33:20,740 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 02:33:20,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:33:20,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2019-09-08 02:33:20,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 02:33:20,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 02:33:20,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-09-08 02:33:20,746 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand 14 states. [2019-09-08 02:33:21,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:33:21,250 INFO L93 Difference]: Finished difference Result 212 states and 290 transitions. [2019-09-08 02:33:21,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 02:33:21,250 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2019-09-08 02:33:21,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:33:21,252 INFO L225 Difference]: With dead ends: 212 [2019-09-08 02:33:21,252 INFO L226 Difference]: Without dead ends: 176 [2019-09-08 02:33:21,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2019-09-08 02:33:21,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-08 02:33:21,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 55. [2019-09-08 02:33:21,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-08 02:33:21,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2019-09-08 02:33:21,264 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 36 [2019-09-08 02:33:21,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:33:21,264 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2019-09-08 02:33:21,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 02:33:21,264 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2019-09-08 02:33:21,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-08 02:33:21,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:33:21,266 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:33:21,266 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:33:21,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:33:21,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1416064650, now seen corresponding path program 1 times [2019-09-08 02:33:21,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:33:21,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:33:21,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:33:21,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:33:21,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:33:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:33:21,359 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 02:33:21,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:33:21,359 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:33:21,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:33:21,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:33:21,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-08 02:33:21,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:33:21,461 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 02:33:21,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:33:21,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 8 [2019-09-08 02:33:21,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 02:33:21,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 02:33:21,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-08 02:33:21,467 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand 8 states. [2019-09-08 02:33:21,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:33:21,731 INFO L93 Difference]: Finished difference Result 247 states and 359 transitions. [2019-09-08 02:33:21,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 02:33:21,732 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-09-08 02:33:21,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:33:21,733 INFO L225 Difference]: With dead ends: 247 [2019-09-08 02:33:21,733 INFO L226 Difference]: Without dead ends: 216 [2019-09-08 02:33:21,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-08 02:33:21,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-08 02:33:21,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 75. [2019-09-08 02:33:21,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-08 02:33:21,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2019-09-08 02:33:21,747 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 39 [2019-09-08 02:33:21,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:33:21,748 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2019-09-08 02:33:21,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 02:33:21,748 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2019-09-08 02:33:21,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-08 02:33:21,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:33:21,750 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:33:21,750 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:33:21,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:33:21,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1087818309, now seen corresponding path program 2 times [2019-09-08 02:33:21,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:33:21,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:33:21,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:33:21,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:33:21,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:33:21,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:33:21,921 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 02:33:21,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:33:21,921 INFO L223 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) [2019-09-08 02:33:21,951 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:33:21,988 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:33:21,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:33:21,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-08 02:33:21,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:33:22,067 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 02:33:22,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:33:22,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 10 [2019-09-08 02:33:22,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 02:33:22,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 02:33:22,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-08 02:33:22,073 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand 10 states. [2019-09-08 02:33:22,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:33:22,412 INFO L93 Difference]: Finished difference Result 513 states and 684 transitions. [2019-09-08 02:33:22,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 02:33:22,412 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2019-09-08 02:33:22,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:33:22,415 INFO L225 Difference]: With dead ends: 513 [2019-09-08 02:33:22,415 INFO L226 Difference]: Without dead ends: 466 [2019-09-08 02:33:22,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-09-08 02:33:22,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-09-08 02:33:22,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 113. [2019-09-08 02:33:22,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-09-08 02:33:22,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 142 transitions. [2019-09-08 02:33:22,458 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 142 transitions. Word has length 44 [2019-09-08 02:33:22,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:33:22,458 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 142 transitions. [2019-09-08 02:33:22,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 02:33:22,458 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 142 transitions. [2019-09-08 02:33:22,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-08 02:33:22,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:33:22,466 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:33:22,467 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:33:22,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:33:22,467 INFO L82 PathProgramCache]: Analyzing trace with hash -452935237, now seen corresponding path program 3 times [2019-09-08 02:33:22,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:33:22,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:33:22,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:33:22,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:33:22,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:33:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:33:22,701 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 02:33:22,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:33:22,702 INFO L223 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) [2019-09-08 02:33:22,725 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:33:22,758 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-08 02:33:22,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:33:22,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-08 02:33:22,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:33:22,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:33:23,030 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:33:23,032 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:33:23,033 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2019-09-08 02:33:23,033 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:33:23,042 INFO L567 ElimStorePlain]: treesize reduction 5, result has 64.3 percent of original size [2019-09-08 02:33:23,043 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:33:23,044 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:3 [2019-09-08 02:33:23,072 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-08 02:33:23,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:33:23,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2019-09-08 02:33:23,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 02:33:23,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 02:33:23,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-09-08 02:33:23,077 INFO L87 Difference]: Start difference. First operand 113 states and 142 transitions. Second operand 16 states. [2019-09-08 02:33:24,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:33:24,439 INFO L93 Difference]: Finished difference Result 437 states and 572 transitions. [2019-09-08 02:33:24,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 02:33:24,440 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 48 [2019-09-08 02:33:24,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:33:24,446 INFO L225 Difference]: With dead ends: 437 [2019-09-08 02:33:24,447 INFO L226 Difference]: Without dead ends: 408 [2019-09-08 02:33:24,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 02:33:24,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-09-08 02:33:24,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 113. [2019-09-08 02:33:24,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-09-08 02:33:24,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 142 transitions. [2019-09-08 02:33:24,479 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 142 transitions. Word has length 48 [2019-09-08 02:33:24,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:33:24,480 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 142 transitions. [2019-09-08 02:33:24,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 02:33:24,480 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 142 transitions. [2019-09-08 02:33:24,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-08 02:33:24,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:33:24,482 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:33:24,483 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:33:24,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:33:24,483 INFO L82 PathProgramCache]: Analyzing trace with hash -57035726, now seen corresponding path program 1 times [2019-09-08 02:33:24,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:33:24,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:33:24,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:33:24,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:33:24,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:33:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:33:24,717 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 02:33:24,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:33:24,719 INFO L223 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) [2019-09-08 02:33:24,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:33:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:33:24,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-08 02:33:24,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:33:24,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:33:24,915 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 02:33:24,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:33:24,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 16 [2019-09-08 02:33:24,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 02:33:24,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 02:33:24,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-08 02:33:24,921 INFO L87 Difference]: Start difference. First operand 113 states and 142 transitions. Second operand 16 states. [2019-09-08 02:33:26,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:33:26,449 INFO L93 Difference]: Finished difference Result 485 states and 649 transitions. [2019-09-08 02:33:26,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 02:33:26,450 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2019-09-08 02:33:26,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:33:26,454 INFO L225 Difference]: With dead ends: 485 [2019-09-08 02:33:26,454 INFO L226 Difference]: Without dead ends: 477 [2019-09-08 02:33:26,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=160, Invalid=1246, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 02:33:26,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-09-08 02:33:26,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 177. [2019-09-08 02:33:26,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-08 02:33:26,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 230 transitions. [2019-09-08 02:33:26,510 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 230 transitions. Word has length 51 [2019-09-08 02:33:26,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:33:26,510 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 230 transitions. [2019-09-08 02:33:26,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 02:33:26,511 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 230 transitions. [2019-09-08 02:33:26,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-08 02:33:26,513 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:33:26,513 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:33:26,513 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:33:26,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:33:26,514 INFO L82 PathProgramCache]: Analyzing trace with hash -450062736, now seen corresponding path program 1 times [2019-09-08 02:33:26,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:33:26,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:33:26,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:33:26,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:33:26,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:33:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:33:26,960 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 29 [2019-09-08 02:33:27,404 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 49 [2019-09-08 02:33:27,725 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 45 [2019-09-08 02:33:28,028 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 42 [2019-09-08 02:33:28,170 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 31 [2019-09-08 02:33:28,862 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 62 [2019-09-08 02:33:28,958 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 02:33:28,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:33:28,959 INFO L223 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) [2019-09-08 02:33:28,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:33:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:33:29,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-08 02:33:29,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:33:29,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:33:29,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:33:29,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:33:29,674 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-09-08 02:33:32,316 WARN L188 SmtUtils]: Spent 2.31 s on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-08 02:33:32,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:33:32,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:33:32,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:33:32,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:33:32,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:33:32,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:33:32,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:33:32,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:33:32,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:33:32,634 INFO L392 ElimStorePlain]: Different costs {10=[v_prenex_9], 18=[|#memory_int|]} [2019-09-08 02:33:32,691 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:33:32,691 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 106 [2019-09-08 02:33:32,692 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:33:32,762 INFO L567 ElimStorePlain]: treesize reduction 88, result has 51.4 percent of original size [2019-09-08 02:33:32,824 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:33:32,825 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 112 [2019-09-08 02:33:32,827 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:33:32,873 INFO L567 ElimStorePlain]: treesize reduction 52, result has 35.8 percent of original size [2019-09-08 02:33:32,885 INFO L496 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:33:32,886 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 12 variables, input treesize:241, output treesize:3 [2019-09-08 02:33:32,956 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 02:33:32,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:33:32,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 30 [2019-09-08 02:33:32,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 02:33:32,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 02:33:32,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2019-09-08 02:33:32,965 INFO L87 Difference]: Start difference. First operand 177 states and 230 transitions. Second operand 30 states. [2019-09-08 02:33:34,320 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 43 [2019-09-08 02:33:40,568 WARN L188 SmtUtils]: Spent 6.07 s on a formula simplification. DAG size of input: 55 DAG size of output: 40 [2019-09-08 02:33:40,801 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 52 [2019-09-08 02:33:41,034 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2019-09-08 02:33:41,205 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 40 [2019-09-08 02:33:41,604 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 54 [2019-09-08 02:33:41,917 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 48 [2019-09-08 02:33:42,353 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 50 [2019-09-08 02:33:48,636 WARN L188 SmtUtils]: Spent 6.14 s on a formula simplification. DAG size of input: 103 DAG size of output: 60 [2019-09-08 02:33:55,559 WARN L188 SmtUtils]: Spent 6.07 s on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-09-08 02:33:56,266 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 45 [2019-09-08 02:33:56,465 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-09-08 02:34:02,815 WARN L188 SmtUtils]: Spent 6.14 s on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-08 02:34:20,780 WARN L188 SmtUtils]: Spent 17.91 s on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-08 02:34:21,284 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 46 [2019-09-08 02:34:44,200 WARN L188 SmtUtils]: Spent 22.26 s on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-09-08 02:34:44,408 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 38 [2019-09-08 02:34:44,618 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 53 [2019-09-08 02:34:45,145 WARN L188 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-09-08 02:34:45,617 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-09-08 02:34:45,933 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-09-08 02:34:46,493 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-08 02:34:49,335 WARN L188 SmtUtils]: Spent 2.77 s on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-08 02:35:13,484 WARN L188 SmtUtils]: Spent 22.10 s on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2019-09-08 02:35:13,639 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-09-08 02:35:13,824 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 51 [2019-09-08 02:35:14,166 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-09-08 02:35:14,380 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2019-09-08 02:35:14,678 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 55 [2019-09-08 02:35:14,858 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-08 02:35:16,014 WARN L188 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-09-08 02:35:16,199 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-09-08 02:35:16,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:35:16,220 INFO L93 Difference]: Finished difference Result 940 states and 1261 transitions. [2019-09-08 02:35:16,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-08 02:35:16,220 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 51 [2019-09-08 02:35:16,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:35:16,229 INFO L225 Difference]: With dead ends: 940 [2019-09-08 02:35:16,230 INFO L226 Difference]: Without dead ends: 843 [2019-09-08 02:35:16,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4507 ImplicationChecksByTransitivity, 107.0s TimeCoverageRelationStatistics Valid=1625, Invalid=11484, Unknown=1, NotChecked=0, Total=13110 [2019-09-08 02:35:16,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2019-09-08 02:35:16,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 498. [2019-09-08 02:35:16,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2019-09-08 02:35:16,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 644 transitions. [2019-09-08 02:35:16,369 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 644 transitions. Word has length 51 [2019-09-08 02:35:16,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:35:16,369 INFO L475 AbstractCegarLoop]: Abstraction has 498 states and 644 transitions. [2019-09-08 02:35:16,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 02:35:16,370 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 644 transitions. [2019-09-08 02:35:16,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-08 02:35:16,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:35:16,372 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:35:16,372 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:35:16,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:35:16,373 INFO L82 PathProgramCache]: Analyzing trace with hash 161818992, now seen corresponding path program 1 times [2019-09-08 02:35:16,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:35:16,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:35:16,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:16,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:35:16,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:35:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:35:17,085 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 41 [2019-09-08 02:35:17,522 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 40 [2019-09-08 02:35:17,677 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 31 [2019-09-08 02:35:17,879 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 35 [2019-09-08 02:35:18,090 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 46 [2019-09-08 02:35:18,401 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 33 [2019-09-08 02:35:18,605 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 33 [2019-09-08 02:35:18,903 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 39 [2019-09-08 02:35:19,104 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 37 [2019-09-08 02:35:19,324 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 30 [2019-09-08 02:35:19,794 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 53 [2019-09-08 02:35:19,932 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 29 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 02:35:19,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:35:19,933 INFO L223 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-08 02:35:19,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:35:19,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:35:19,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-08 02:35:19,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:35:20,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:35:20,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:35:20,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:35:24,473 WARN L188 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-09-08 02:35:24,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:35:27,068 WARN L188 SmtUtils]: Spent 2.44 s on a formula simplification that was a NOOP. DAG size: 41 [2019-09-08 02:35:30,675 WARN L188 SmtUtils]: Spent 3.50 s on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-09-08 02:35:40,748 WARN L188 SmtUtils]: Spent 9.94 s on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-08 02:35:40,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:35:40,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:35:40,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:35:40,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:35:40,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:35:40,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:35:40,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:35:40,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:35:40,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:35:40,893 INFO L392 ElimStorePlain]: Different costs {10=[v_prenex_19], 18=[|#memory_int|]} [2019-09-08 02:35:40,954 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:35:40,955 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 107 [2019-09-08 02:35:40,956 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:35:41,064 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-08 02:35:41,065 INFO L567 ElimStorePlain]: treesize reduction 97, result has 55.1 percent of original size [2019-09-08 02:35:41,118 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:35:41,119 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 113 [2019-09-08 02:35:41,121 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:35:41,211 INFO L567 ElimStorePlain]: treesize reduction 8, result has 91.0 percent of original size [2019-09-08 02:35:41,216 INFO L496 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:35:41,216 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 12 variables, input treesize:244, output treesize:4 [2019-09-08 02:35:41,262 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 02:35:41,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:35:41,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 32 [2019-09-08 02:35:41,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-08 02:35:41,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-08 02:35:41,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=854, Unknown=0, NotChecked=0, Total=992 [2019-09-08 02:35:41,270 INFO L87 Difference]: Start difference. First operand 498 states and 644 transitions. Second operand 32 states. [2019-09-08 02:35:48,491 WARN L188 SmtUtils]: Spent 6.12 s on a formula simplification. DAG size of input: 115 DAG size of output: 52 [2019-09-08 02:35:48,844 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-09-08 02:35:49,477 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-08 02:35:52,038 WARN L188 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-08 02:35:52,413 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-08 02:35:55,653 WARN L188 SmtUtils]: Spent 3.07 s on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-09-08 02:35:55,845 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-08 02:35:58,690 WARN L188 SmtUtils]: Spent 2.61 s on a formula simplification. DAG size of input: 83 DAG size of output: 55 [2019-09-08 02:35:59,390 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-09-08 02:35:59,625 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-09-08 02:36:01,981 WARN L188 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-08 02:36:24,720 WARN L188 SmtUtils]: Spent 22.65 s on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-09-08 02:36:30,879 WARN L188 SmtUtils]: Spent 6.10 s on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-09-08 02:36:33,056 WARN L188 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-08 02:36:34,142 WARN L188 SmtUtils]: Spent 837.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-08 02:36:34,633 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-08 02:36:52,000 WARN L188 SmtUtils]: Spent 16.75 s on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-09-08 02:37:19,095 WARN L188 SmtUtils]: Spent 25.04 s on a formula simplification. DAG size of input: 71 DAG size of output: 71 [2019-09-08 02:37:21,531 WARN L188 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-09-08 02:37:22,420 WARN L188 SmtUtils]: Spent 811.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-09-08 02:37:24,850 WARN L188 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 89 DAG size of output: 73 [2019-09-08 02:37:27,400 WARN L188 SmtUtils]: Spent 2.44 s on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-08 02:37:29,926 WARN L188 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-08 02:37:30,305 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-09-08 02:37:35,446 WARN L188 SmtUtils]: Spent 3.99 s on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-08 02:37:35,888 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-08 02:38:01,256 WARN L188 SmtUtils]: Spent 22.33 s on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-09-08 02:38:07,422 WARN L188 SmtUtils]: Spent 6.10 s on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-09-08 02:38:07,658 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 58 [2019-09-08 02:38:13,862 WARN L188 SmtUtils]: Spent 6.10 s on a formula simplification. DAG size of input: 85 DAG size of output: 55 [2019-09-08 02:38:15,022 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-08 02:38:16,832 WARN L188 SmtUtils]: Spent 915.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2019-09-08 02:38:18,522 WARN L188 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-08 02:38:21,083 WARN L188 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 89 DAG size of output: 75 [2019-09-08 02:38:21,291 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-08 02:38:28,155 WARN L188 SmtUtils]: Spent 6.09 s on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-09-08 02:38:36,528 WARN L188 SmtUtils]: Spent 6.10 s on a formula simplification. DAG size of input: 88 DAG size of output: 58 [2019-09-08 02:38:38,724 WARN L188 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-08 02:38:39,949 WARN L188 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-09-08 02:38:40,391 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-08 02:38:41,130 WARN L188 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-08 02:38:41,413 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-08 02:38:44,664 WARN L188 SmtUtils]: Spent 3.01 s on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-09-08 02:38:45,078 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-09-08 02:38:45,434 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-09-08 02:39:11,794 WARN L188 SmtUtils]: Spent 24.28 s on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-09-08 02:39:46,185 WARN L188 SmtUtils]: Spent 24.27 s on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2019-09-08 02:39:46,468 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-08 02:40:06,705 WARN L188 SmtUtils]: Spent 16.57 s on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-08 02:40:06,879 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-08 02:40:15,665 WARN L188 SmtUtils]: Spent 7.77 s on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-09-08 02:40:15,814 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-08 02:40:16,033 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-09-08 02:40:16,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:40:16,164 INFO L93 Difference]: Finished difference Result 2944 states and 3896 transitions. [2019-09-08 02:40:16,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2019-09-08 02:40:16,165 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 51 [2019-09-08 02:40:16,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:40:16,177 INFO L225 Difference]: With dead ends: 2944 [2019-09-08 02:40:16,178 INFO L226 Difference]: Without dead ends: 2728 [2019-09-08 02:40:16,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7528 ImplicationChecksByTransitivity, 293.5s TimeCoverageRelationStatistics Valid=2054, Invalid=19107, Unknown=9, NotChecked=0, Total=21170 [2019-09-08 02:40:16,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2728 states. [2019-09-08 02:40:16,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2728 to 913. [2019-09-08 02:40:16,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2019-09-08 02:40:16,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1166 transitions. [2019-09-08 02:40:16,381 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1166 transitions. Word has length 51 [2019-09-08 02:40:16,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:40:16,381 INFO L475 AbstractCegarLoop]: Abstraction has 913 states and 1166 transitions. [2019-09-08 02:40:16,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-08 02:40:16,381 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1166 transitions. [2019-09-08 02:40:16,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-08 02:40:16,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:40:16,384 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:40:16,384 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:40:16,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:40:16,384 INFO L82 PathProgramCache]: Analyzing trace with hash -818014032, now seen corresponding path program 1 times [2019-09-08 02:40:16,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:40:16,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:40:16,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:40:16,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:40:16,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:40:16,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:40:16,757 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 29 [2019-09-08 02:40:16,916 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 23 [2019-09-08 02:40:17,202 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 43 [2019-09-08 02:40:17,465 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 39 [2019-09-08 02:40:18,110 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 50 [2019-09-08 02:40:18,268 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 26 [2019-09-08 02:40:18,286 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 02:40:18,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:40:18,287 INFO L223 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-08 02:40:18,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:40:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:40:18,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-08 02:40:18,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:40:18,518 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:40:18,548 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-09-08 02:40:18,549 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 21 [2019-09-08 02:40:18,549 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:40:18,555 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:40:18,556 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:40:18,557 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:3 [2019-09-08 02:40:18,572 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 02:40:18,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:40:18,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 20 [2019-09-08 02:40:18,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 02:40:18,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 02:40:18,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2019-09-08 02:40:18,577 INFO L87 Difference]: Start difference. First operand 913 states and 1166 transitions. Second operand 20 states. [2019-09-08 02:40:19,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:40:19,604 INFO L93 Difference]: Finished difference Result 1485 states and 1910 transitions. [2019-09-08 02:40:19,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 02:40:19,605 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 51 [2019-09-08 02:40:19,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:40:19,610 INFO L225 Difference]: With dead ends: 1485 [2019-09-08 02:40:19,610 INFO L226 Difference]: Without dead ends: 1314 [2019-09-08 02:40:19,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 43 SyntacticMatches, 9 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2019-09-08 02:40:19,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2019-09-08 02:40:19,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 904. [2019-09-08 02:40:19,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-09-08 02:40:19,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1152 transitions. [2019-09-08 02:40:19,744 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1152 transitions. Word has length 51 [2019-09-08 02:40:19,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:40:19,744 INFO L475 AbstractCegarLoop]: Abstraction has 904 states and 1152 transitions. [2019-09-08 02:40:19,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 02:40:19,745 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1152 transitions. [2019-09-08 02:40:19,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-08 02:40:19,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:40:19,747 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:40:19,747 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:40:19,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:40:19,748 INFO L82 PathProgramCache]: Analyzing trace with hash -90659408, now seen corresponding path program 1 times [2019-09-08 02:40:19,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:40:19,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:40:19,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:40:19,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:40:19,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:40:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:40:20,129 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 23 [2019-09-08 02:40:20,345 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 40 [2019-09-08 02:40:20,544 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 37 [2019-09-08 02:40:20,701 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 32 [2019-09-08 02:40:21,340 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 53 [2019-09-08 02:40:21,518 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 28 [2019-09-08 02:40:21,538 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 02:40:21,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:40:21,539 INFO L223 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-08 02:40:21,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:40:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:40:21,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-08 02:40:21,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:40:21,764 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:40:21,779 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-09-08 02:40:21,780 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 22 [2019-09-08 02:40:21,780 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:40:21,796 INFO L567 ElimStorePlain]: treesize reduction 4, result has 78.9 percent of original size [2019-09-08 02:40:21,796 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:40:21,797 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:4 [2019-09-08 02:40:21,814 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 02:40:21,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:40:21,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 20 [2019-09-08 02:40:21,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 02:40:21,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 02:40:21,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2019-09-08 02:40:21,818 INFO L87 Difference]: Start difference. First operand 904 states and 1152 transitions. Second operand 20 states. [2019-09-08 02:40:22,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:40:22,926 INFO L93 Difference]: Finished difference Result 1403 states and 1801 transitions. [2019-09-08 02:40:22,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 02:40:22,926 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 51 [2019-09-08 02:40:22,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:40:22,932 INFO L225 Difference]: With dead ends: 1403 [2019-09-08 02:40:22,932 INFO L226 Difference]: Without dead ends: 1262 [2019-09-08 02:40:22,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 43 SyntacticMatches, 9 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=175, Invalid=637, Unknown=0, NotChecked=0, Total=812 [2019-09-08 02:40:22,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2019-09-08 02:40:23,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 693. [2019-09-08 02:40:23,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693 states. [2019-09-08 02:40:23,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 870 transitions. [2019-09-08 02:40:23,047 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 870 transitions. Word has length 51 [2019-09-08 02:40:23,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:40:23,047 INFO L475 AbstractCegarLoop]: Abstraction has 693 states and 870 transitions. [2019-09-08 02:40:23,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 02:40:23,047 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 870 transitions. [2019-09-08 02:40:23,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-08 02:40:23,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:40:23,050 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:40:23,050 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:40:23,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:40:23,050 INFO L82 PathProgramCache]: Analyzing trace with hash -284438412, now seen corresponding path program 2 times [2019-09-08 02:40:23,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:40:23,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:40:23,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:40:23,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:40:23,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:40:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:40:23,408 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 29 [2019-09-08 02:40:23,955 WARN L188 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 48 [2019-09-08 02:40:24,270 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 45 [2019-09-08 02:40:24,589 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 42 [2019-09-08 02:40:24,738 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 31 [2019-09-08 02:40:25,456 WARN L188 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 64 [2019-09-08 02:40:25,547 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 02:40:25,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:40:25,547 INFO L223 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-08 02:40:25,559 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:40:25,593 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:40:25,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:40:25,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-08 02:40:25,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:40:25,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:40:25,898 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:40:25,899 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:40:25,900 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 14 [2019-09-08 02:40:25,900 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:40:25,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:40:25,905 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:40:25,905 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4 [2019-09-08 02:40:25,926 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 02:40:25,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:40:25,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 26 [2019-09-08 02:40:25,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 02:40:25,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 02:40:25,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2019-09-08 02:40:25,934 INFO L87 Difference]: Start difference. First operand 693 states and 870 transitions. Second operand 26 states. [2019-09-08 02:40:26,790 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 44 [2019-09-08 02:40:27,550 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 47 [2019-09-08 02:40:28,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:40:28,753 INFO L93 Difference]: Finished difference Result 1987 states and 2590 transitions. [2019-09-08 02:40:28,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 02:40:28,754 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 51 [2019-09-08 02:40:28,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:40:28,761 INFO L225 Difference]: With dead ends: 1987 [2019-09-08 02:40:28,761 INFO L226 Difference]: Without dead ends: 1640 [2019-09-08 02:40:28,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 39 SyntacticMatches, 10 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=414, Invalid=1842, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 02:40:28,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2019-09-08 02:40:28,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 766. [2019-09-08 02:40:28,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 766 states. [2019-09-08 02:40:28,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 956 transitions. [2019-09-08 02:40:28,918 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 956 transitions. Word has length 51 [2019-09-08 02:40:28,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:40:28,919 INFO L475 AbstractCegarLoop]: Abstraction has 766 states and 956 transitions. [2019-09-08 02:40:28,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 02:40:28,919 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 956 transitions. [2019-09-08 02:40:28,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 02:40:28,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:40:28,920 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:40:28,920 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:40:28,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:40:28,921 INFO L82 PathProgramCache]: Analyzing trace with hash -771687101, now seen corresponding path program 2 times [2019-09-08 02:40:28,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:40:28,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:40:28,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:40:28,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:40:28,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:40:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:40:29,086 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-08 02:40:29,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:40:29,087 INFO L223 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) [2019-09-08 02:40:29,101 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:40:29,138 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:40:29,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:40:29,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-08 02:40:29,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:40:29,358 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:40:29,359 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-08 02:40:29,359 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:40:29,360 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:40:29,361 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:40:29,361 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2019-09-08 02:40:29,388 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 02:40:29,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:40:29,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2019-09-08 02:40:29,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 02:40:29,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 02:40:29,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2019-09-08 02:40:29,393 INFO L87 Difference]: Start difference. First operand 766 states and 956 transitions. Second operand 19 states. [2019-09-08 02:40:32,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:40:32,783 INFO L93 Difference]: Finished difference Result 4445 states and 5749 transitions. [2019-09-08 02:40:32,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-08 02:40:32,784 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2019-09-08 02:40:32,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:40:32,797 INFO L225 Difference]: With dead ends: 4445 [2019-09-08 02:40:32,797 INFO L226 Difference]: Without dead ends: 3689 [2019-09-08 02:40:32,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=518, Invalid=3514, Unknown=0, NotChecked=0, Total=4032 [2019-09-08 02:40:32,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3689 states. [2019-09-08 02:40:33,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3689 to 768. [2019-09-08 02:40:33,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2019-09-08 02:40:33,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 952 transitions. [2019-09-08 02:40:33,042 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 952 transitions. Word has length 57 [2019-09-08 02:40:33,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:40:33,043 INFO L475 AbstractCegarLoop]: Abstraction has 768 states and 952 transitions. [2019-09-08 02:40:33,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 02:40:33,043 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 952 transitions. [2019-09-08 02:40:33,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 02:40:33,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:40:33,050 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:40:33,051 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:40:33,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:40:33,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1198111010, now seen corresponding path program 1 times [2019-09-08 02:40:33,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:40:33,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:40:33,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:40:33,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:40:33,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:40:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:40:33,357 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 24 [2019-09-08 02:40:33,727 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-08 02:40:33,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:40:33,728 INFO L223 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) [2019-09-08 02:40:33,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:40:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:40:33,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-08 02:40:33,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:40:34,293 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:40:34,293 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 25 [2019-09-08 02:40:34,294 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:40:34,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:40:34,297 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:40:34,297 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:8 [2019-09-08 02:40:34,341 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 20 proven. 27 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 02:40:34,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:40:34,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18] total 27 [2019-09-08 02:40:34,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 02:40:34,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 02:40:34,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-09-08 02:40:34,346 INFO L87 Difference]: Start difference. First operand 768 states and 952 transitions. Second operand 27 states. [2019-09-08 02:40:35,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:40:35,478 INFO L93 Difference]: Finished difference Result 1171 states and 1503 transitions. [2019-09-08 02:40:35,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 02:40:35,478 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 61 [2019-09-08 02:40:35,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:40:35,483 INFO L225 Difference]: With dead ends: 1171 [2019-09-08 02:40:35,483 INFO L226 Difference]: Without dead ends: 1015 [2019-09-08 02:40:35,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=321, Invalid=1239, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 02:40:35,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2019-09-08 02:40:35,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 669. [2019-09-08 02:40:35,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2019-09-08 02:40:35,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 836 transitions. [2019-09-08 02:40:35,651 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 836 transitions. Word has length 61 [2019-09-08 02:40:35,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:40:35,651 INFO L475 AbstractCegarLoop]: Abstraction has 669 states and 836 transitions. [2019-09-08 02:40:35,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-08 02:40:35,652 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 836 transitions. [2019-09-08 02:40:35,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 02:40:35,653 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:40:35,654 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:40:35,654 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:40:35,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:40:35,654 INFO L82 PathProgramCache]: Analyzing trace with hash -349531517, now seen corresponding path program 2 times [2019-09-08 02:40:35,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:40:35,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:40:35,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:40:35,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:40:35,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:40:35,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:40:36,052 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-08 02:40:36,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:40:36,052 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:40:36,062 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:40:36,114 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:40:36,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:40:36,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 02:40:36,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:40:36,210 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-09-08 02:40:36,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:40:36,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:40:36,213 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:40:36,213 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-09-08 02:40:36,220 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-09-08 02:40:36,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:40:36,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 15 [2019-09-08 02:40:36,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 02:40:36,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 02:40:36,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-09-08 02:40:36,224 INFO L87 Difference]: Start difference. First operand 669 states and 836 transitions. Second operand 15 states. [2019-09-08 02:40:36,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:40:36,614 INFO L93 Difference]: Finished difference Result 1019 states and 1320 transitions. [2019-09-08 02:40:36,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 02:40:36,614 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2019-09-08 02:40:36,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:40:36,618 INFO L225 Difference]: With dead ends: 1019 [2019-09-08 02:40:36,618 INFO L226 Difference]: Without dead ends: 1014 [2019-09-08 02:40:36,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2019-09-08 02:40:36,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2019-09-08 02:40:36,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 735. [2019-09-08 02:40:36,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 735 states. [2019-09-08 02:40:36,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 926 transitions. [2019-09-08 02:40:36,773 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 926 transitions. Word has length 62 [2019-09-08 02:40:36,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:40:36,774 INFO L475 AbstractCegarLoop]: Abstraction has 735 states and 926 transitions. [2019-09-08 02:40:36,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 02:40:36,774 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 926 transitions. [2019-09-08 02:40:36,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 02:40:36,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:40:36,776 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:40:36,776 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:40:36,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:40:36,777 INFO L82 PathProgramCache]: Analyzing trace with hash -266217358, now seen corresponding path program 3 times [2019-09-08 02:40:36,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:40:36,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:40:36,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:40:36,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:40:36,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:40:36,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:40:36,965 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-08 02:40:36,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:40:36,966 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:40:36,976 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:40:37,012 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-08 02:40:37,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:40:37,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-08 02:40:37,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:40:37,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:40:38,290 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:40:38,292 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:40:38,292 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2019-09-08 02:40:38,292 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:40:38,307 INFO L567 ElimStorePlain]: treesize reduction 5, result has 73.7 percent of original size [2019-09-08 02:40:38,308 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:40:38,309 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:3 [2019-09-08 02:40:38,337 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-08 02:40:38,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:40:38,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2019-09-08 02:40:38,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 02:40:38,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 02:40:38,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=325, Unknown=2, NotChecked=0, Total=380 [2019-09-08 02:40:38,341 INFO L87 Difference]: Start difference. First operand 735 states and 926 transitions. Second operand 20 states. [2019-09-08 02:40:55,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:40:55,558 INFO L93 Difference]: Finished difference Result 4644 states and 5979 transitions. [2019-09-08 02:40:55,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-08 02:40:55,558 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 69 [2019-09-08 02:40:55,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:40:55,570 INFO L225 Difference]: With dead ends: 4644 [2019-09-08 02:40:55,570 INFO L226 Difference]: Without dead ends: 4338 [2019-09-08 02:40:55,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=245, Invalid=2094, Unknown=13, NotChecked=0, Total=2352 [2019-09-08 02:40:55,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4338 states. [2019-09-08 02:40:55,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4338 to 697. [2019-09-08 02:40:55,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-08 02:40:55,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 877 transitions. [2019-09-08 02:40:55,761 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 877 transitions. Word has length 69 [2019-09-08 02:40:55,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:40:55,761 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 877 transitions. [2019-09-08 02:40:55,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 02:40:55,762 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 877 transitions. [2019-09-08 02:40:55,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 02:40:55,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:40:55,764 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:40:55,764 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:40:55,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:40:55,765 INFO L82 PathProgramCache]: Analyzing trace with hash 535303285, now seen corresponding path program 4 times [2019-09-08 02:40:55,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:40:55,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:40:55,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:40:55,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:40:55,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:40:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:40:56,360 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 42 [2019-09-08 02:40:56,585 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 38 [2019-09-08 02:40:56,741 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 33 [2019-09-08 02:40:57,338 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 55 [2019-09-08 02:40:57,527 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 32 [2019-09-08 02:40:57,559 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 20 proven. 32 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 02:40:57,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:40:57,559 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:40:57,570 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:40:57,621 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:40:57,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:40:57,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-08 02:40:57,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:40:57,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:40:57,858 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:40:57,859 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:40:57,860 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 13 [2019-09-08 02:40:57,860 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:40:57,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:40:57,865 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:40:57,865 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:3 [2019-09-08 02:40:57,890 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 20 proven. 50 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 02:40:57,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:40:57,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2019-09-08 02:40:57,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 02:40:57,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 02:40:57,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2019-09-08 02:40:57,895 INFO L87 Difference]: Start difference. First operand 697 states and 877 transitions. Second operand 20 states. [2019-09-08 02:40:58,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:40:58,747 INFO L93 Difference]: Finished difference Result 1433 states and 1836 transitions. [2019-09-08 02:40:58,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 02:40:58,748 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2019-09-08 02:40:58,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:40:58,753 INFO L225 Difference]: With dead ends: 1433 [2019-09-08 02:40:58,753 INFO L226 Difference]: Without dead ends: 1333 [2019-09-08 02:40:58,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 61 SyntacticMatches, 10 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-09-08 02:40:58,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2019-09-08 02:40:58,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 985. [2019-09-08 02:40:58,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 985 states. [2019-09-08 02:40:58,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1235 transitions. [2019-09-08 02:40:58,970 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1235 transitions. Word has length 72 [2019-09-08 02:40:58,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:40:58,971 INFO L475 AbstractCegarLoop]: Abstraction has 985 states and 1235 transitions. [2019-09-08 02:40:58,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 02:40:58,971 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1235 transitions. [2019-09-08 02:40:58,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 02:40:58,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:40:58,973 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:40:58,973 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:40:58,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:40:58,974 INFO L82 PathProgramCache]: Analyzing trace with hash -583461831, now seen corresponding path program 5 times [2019-09-08 02:40:58,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:40:58,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:40:58,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:40:58,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:40:58,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:40:59,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:40:59,771 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 49 [2019-09-08 02:41:00,067 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 46 [2019-09-08 02:41:00,351 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 42 [2019-09-08 02:41:01,402 WARN L188 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 68 [2019-09-08 02:41:01,573 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 13 proven. 48 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 02:41:01,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:41:01,574 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:41:01,583 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 02:41:10,779 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-08 02:41:10,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:41:10,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-08 02:41:10,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:41:10,881 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 24 treesize of output 20 [2019-09-08 02:41:10,881 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:41:10,900 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:41:10,904 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 26 treesize of output 22 [2019-09-08 02:41:10,904 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:41:10,919 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:41:10,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:41:10,922 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:51, output treesize:3 [2019-09-08 02:41:11,948 INFO L341 Elim1Store]: treesize reduction 10, result has 84.1 percent of original size [2019-09-08 02:41:11,949 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 69 [2019-09-08 02:41:11,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:41:11,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:41:11,951 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:41:11,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:41:11,964 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:41:11,964 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:3 [2019-09-08 02:41:12,007 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 13 proven. 77 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 02:41:12,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:41:12,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 29] total 47 [2019-09-08 02:41:12,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-08 02:41:12,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-08 02:41:12,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1935, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 02:41:12,015 INFO L87 Difference]: Start difference. First operand 985 states and 1235 transitions. Second operand 47 states. [2019-09-08 02:41:13,046 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 44 [2019-09-08 02:41:13,783 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 38 [2019-09-08 02:41:14,231 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 42 [2019-09-08 02:41:14,825 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 47 [2019-09-08 02:41:16,542 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 33 [2019-09-08 02:41:17,113 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 44 [2019-09-08 02:41:17,388 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 49 [2019-09-08 02:41:17,655 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 50 [2019-09-08 02:41:19,556 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 47 [2019-09-08 02:41:20,124 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 50 [2019-09-08 02:41:21,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:41:21,072 INFO L93 Difference]: Finished difference Result 4746 states and 6115 transitions. [2019-09-08 02:41:21,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-08 02:41:21,072 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 72 [2019-09-08 02:41:21,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:41:21,082 INFO L225 Difference]: With dead ends: 4746 [2019-09-08 02:41:21,082 INFO L226 Difference]: Without dead ends: 3548 [2019-09-08 02:41:21,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 44 SyntacticMatches, 8 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4281 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=1517, Invalid=11593, Unknown=0, NotChecked=0, Total=13110 [2019-09-08 02:41:21,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3548 states. [2019-09-08 02:41:21,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3548 to 1959. [2019-09-08 02:41:21,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1959 states. [2019-09-08 02:41:21,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1959 states to 1959 states and 2398 transitions. [2019-09-08 02:41:21,499 INFO L78 Accepts]: Start accepts. Automaton has 1959 states and 2398 transitions. Word has length 72 [2019-09-08 02:41:21,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:41:21,500 INFO L475 AbstractCegarLoop]: Abstraction has 1959 states and 2398 transitions. [2019-09-08 02:41:21,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-08 02:41:21,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 2398 transitions. [2019-09-08 02:41:21,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 02:41:21,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:41:21,505 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:41:21,505 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:41:21,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:41:21,505 INFO L82 PathProgramCache]: Analyzing trace with hash 278103797, now seen corresponding path program 6 times [2019-09-08 02:41:21,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:41:21,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:41:21,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:41:21,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:41:21,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:41:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:41:22,055 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 38 [2019-09-08 02:41:22,237 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 35 [2019-09-08 02:41:22,824 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 59 [2019-09-08 02:41:23,015 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 35 [2019-09-08 02:41:23,052 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 20 proven. 32 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 02:41:23,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:41:23,052 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:41:23,067 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:41:23,180 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-09-08 02:41:23,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:41:23,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-08 02:41:23,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:41:23,388 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:41:23,390 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:41:23,390 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 14 [2019-09-08 02:41:23,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:41:23,395 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:41:23,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:41:23,396 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:4 [2019-09-08 02:41:23,434 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 20 proven. 50 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 02:41:23,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:41:23,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 21 [2019-09-08 02:41:23,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 02:41:23,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 02:41:23,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2019-09-08 02:41:23,440 INFO L87 Difference]: Start difference. First operand 1959 states and 2398 transitions. Second operand 21 states. [2019-09-08 02:41:24,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:41:24,528 INFO L93 Difference]: Finished difference Result 2325 states and 2880 transitions. [2019-09-08 02:41:24,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 02:41:24,531 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 72 [2019-09-08 02:41:24,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:41:24,539 INFO L225 Difference]: With dead ends: 2325 [2019-09-08 02:41:24,539 INFO L226 Difference]: Without dead ends: 2157 [2019-09-08 02:41:24,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 63 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2019-09-08 02:41:24,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2157 states. [2019-09-08 02:41:24,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2157 to 1953. [2019-09-08 02:41:24,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1953 states. [2019-09-08 02:41:24,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 1953 states and 2368 transitions. [2019-09-08 02:41:24,968 INFO L78 Accepts]: Start accepts. Automaton has 1953 states and 2368 transitions. Word has length 72 [2019-09-08 02:41:24,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:41:24,968 INFO L475 AbstractCegarLoop]: Abstraction has 1953 states and 2368 transitions. [2019-09-08 02:41:24,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 02:41:24,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1953 states and 2368 transitions. [2019-09-08 02:41:24,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 02:41:24,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:41:24,974 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:41:24,974 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:41:24,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:41:24,974 INFO L82 PathProgramCache]: Analyzing trace with hash 84324793, now seen corresponding path program 7 times [2019-09-08 02:41:24,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:41:24,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:41:24,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:41:24,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:41:24,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:41:25,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:41:25,300 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 19 [2019-09-08 02:41:25,594 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 35 [2019-09-08 02:41:25,825 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 42 [2019-09-08 02:41:26,030 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 39 [2019-09-08 02:41:26,165 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 31 [2019-09-08 02:41:26,917 WARN L188 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 70 [2019-09-08 02:41:27,042 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 13 proven. 42 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-08 02:41:27,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:41:27,043 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:41:27,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:41:27,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:41:27,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-08 02:41:27,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:41:27,414 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:41:27,428 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-09-08 02:41:27,428 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 22 [2019-09-08 02:41:27,429 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:41:27,446 INFO L567 ElimStorePlain]: treesize reduction 4, result has 78.9 percent of original size [2019-09-08 02:41:27,447 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:41:27,447 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4 [2019-09-08 02:41:27,476 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 13 proven. 64 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 02:41:27,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:41:27,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 26 [2019-09-08 02:41:27,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 02:41:27,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 02:41:27,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2019-09-08 02:41:27,487 INFO L87 Difference]: Start difference. First operand 1953 states and 2368 transitions. Second operand 26 states. [2019-09-08 02:41:27,931 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 43 [2019-09-08 02:41:28,248 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 39 [2019-09-08 02:41:28,423 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2019-09-08 02:41:29,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:41:29,659 INFO L93 Difference]: Finished difference Result 3197 states and 3875 transitions. [2019-09-08 02:41:29,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 02:41:29,660 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 72 [2019-09-08 02:41:29,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:41:29,668 INFO L225 Difference]: With dead ends: 3197 [2019-09-08 02:41:29,669 INFO L226 Difference]: Without dead ends: 1819 [2019-09-08 02:41:29,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 60 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=249, Invalid=1157, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 02:41:29,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2019-09-08 02:41:29,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 1444. [2019-09-08 02:41:29,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1444 states. [2019-09-08 02:41:29,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1706 transitions. [2019-09-08 02:41:29,989 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 1706 transitions. Word has length 72 [2019-09-08 02:41:29,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:41:29,989 INFO L475 AbstractCegarLoop]: Abstraction has 1444 states and 1706 transitions. [2019-09-08 02:41:29,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 02:41:29,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1706 transitions. [2019-09-08 02:41:29,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 02:41:29,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:41:29,992 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:41:29,993 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:41:29,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:41:29,993 INFO L82 PathProgramCache]: Analyzing trace with hash 2074519543, now seen corresponding path program 8 times [2019-09-08 02:41:29,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:41:29,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:41:29,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:41:29,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:41:29,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:41:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:41:30,226 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-08 02:41:30,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:41:30,227 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:41:30,237 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:41:30,280 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:41:30,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:41:30,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-08 02:41:30,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:41:30,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:41:30,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:41:30,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:41:30,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:41:30,779 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-09-08 02:41:32,257 WARN L188 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-09-08 02:41:37,462 WARN L188 SmtUtils]: Spent 4.91 s on a formula simplification that was a NOOP. DAG size: 78 [2019-09-08 02:41:37,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:41:37,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:41:37,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:41:37,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:41:37,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:41:37,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:41:37,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:41:37,497 INFO L392 ElimStorePlain]: Different costs {10=[v_prenex_50, v_prenex_35, v_prenex_44, |#memory_int|], 18=[v_prenex_31, v_prenex_40]} [2019-09-08 02:41:37,593 INFO L341 Elim1Store]: treesize reduction 17, result has 79.8 percent of original size [2019-09-08 02:41:37,594 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 99 [2019-09-08 02:41:37,595 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:41:37,803 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 105 [2019-09-08 02:41:37,803 INFO L567 ElimStorePlain]: treesize reduction 183, result has 59.9 percent of original size [2019-09-08 02:41:37,873 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:41:37,874 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 114 [2019-09-08 02:41:37,875 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:41:38,082 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 101 [2019-09-08 02:41:38,083 INFO L567 ElimStorePlain]: treesize reduction 12, result has 95.4 percent of original size [2019-09-08 02:41:38,135 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:41:38,136 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 107 [2019-09-08 02:41:38,137 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:41:38,360 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 97 [2019-09-08 02:41:38,360 INFO L567 ElimStorePlain]: treesize reduction 12, result has 94.9 percent of original size [2019-09-08 02:41:38,457 INFO L341 Elim1Store]: treesize reduction 17, result has 79.8 percent of original size [2019-09-08 02:41:38,458 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 93 [2019-09-08 02:41:38,459 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:41:38,686 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-09-08 02:41:38,686 INFO L567 ElimStorePlain]: treesize reduction 8, result has 95.9 percent of original size [2019-09-08 02:41:38,687 INFO L464 ElimStorePlain]: Eliminatee v_prenex_31 vanished before elimination [2019-09-08 02:41:38,687 INFO L464 ElimStorePlain]: Eliminatee v_prenex_40 vanished before elimination [2019-09-08 02:41:38,692 INFO L496 ElimStorePlain]: Start of recursive call 1: 30 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:41:38,692 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 36 variables, input treesize:485, output treesize:4 [2019-09-08 02:41:38,730 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 17 proven. 23 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-08 02:41:38,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:41:38,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 25 [2019-09-08 02:41:38,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 02:41:38,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 02:41:38,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2019-09-08 02:41:38,737 INFO L87 Difference]: Start difference. First operand 1444 states and 1706 transitions. Second operand 25 states. [2019-09-08 02:41:41,310 WARN L188 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-09-08 02:41:41,453 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-08 02:41:42,529 WARN L188 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-09-08 02:41:43,724 WARN L188 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 43 [2019-09-08 02:41:44,150 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-09-08 02:41:45,516 WARN L188 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 81 [2019-09-08 02:41:45,728 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-08 02:41:46,253 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-09-08 02:41:46,402 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-09-08 02:41:46,678 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-09-08 02:41:47,049 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-08 02:41:47,275 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-09-08 02:41:47,439 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-09-08 02:41:47,710 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-09-08 02:41:48,279 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-09-08 02:41:48,475 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-09-08 02:41:48,996 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-09-08 02:41:50,111 WARN L188 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-09-08 02:41:53,459 WARN L188 SmtUtils]: Spent 2.99 s on a formula simplification that was a NOOP. DAG size: 64 [2019-09-08 02:41:53,642 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-09-08 02:41:54,801 WARN L188 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-09-08 02:41:55,182 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-09-08 02:41:55,988 WARN L188 SmtUtils]: Spent 715.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-09-08 02:41:56,208 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-08 02:41:56,770 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-09-08 02:41:58,019 WARN L188 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-09-08 02:41:59,646 WARN L188 SmtUtils]: Spent 1.49 s on a formula simplification that was a NOOP. DAG size: 64 [2019-09-08 02:42:00,034 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-08 02:42:00,251 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2019-09-08 02:42:00,824 WARN L188 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-09-08 02:42:02,460 WARN L188 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-08 02:42:03,290 WARN L188 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-09-08 02:42:03,523 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-09-08 02:42:03,870 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-09-08 02:42:04,152 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2019-09-08 02:42:04,706 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-09-08 02:42:06,156 WARN L188 SmtUtils]: Spent 999.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-09-08 02:42:07,228 WARN L188 SmtUtils]: Spent 552.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-09-08 02:42:08,427 WARN L188 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 49 [2019-09-08 02:42:10,939 WARN L188 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2019-09-08 02:42:11,169 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-09-08 02:42:11,552 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-09-08 02:42:12,386 WARN L188 SmtUtils]: Spent 434.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-09-08 02:42:13,246 WARN L188 SmtUtils]: Spent 775.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-08 02:42:13,649 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2019-09-08 02:42:14,161 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-09-08 02:42:16,523 WARN L188 SmtUtils]: Spent 1.81 s on a formula simplification that was a NOOP. DAG size: 51 [2019-09-08 02:42:16,998 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-09-08 02:42:17,612 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-09-08 02:42:18,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:42:18,615 INFO L93 Difference]: Finished difference Result 3595 states and 4336 transitions. [2019-09-08 02:42:18,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2019-09-08 02:42:18,616 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 72 [2019-09-08 02:42:18,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:42:18,621 INFO L225 Difference]: With dead ends: 3595 [2019-09-08 02:42:18,621 INFO L226 Difference]: Without dead ends: 3352 [2019-09-08 02:42:18,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9386 ImplicationChecksByTransitivity, 42.2s TimeCoverageRelationStatistics Valid=1429, Invalid=23693, Unknown=0, NotChecked=0, Total=25122 [2019-09-08 02:42:18,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3352 states. [2019-09-08 02:42:19,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3352 to 1907. [2019-09-08 02:42:19,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1907 states. [2019-09-08 02:42:19,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1907 states and 2277 transitions. [2019-09-08 02:42:19,058 INFO L78 Accepts]: Start accepts. Automaton has 1907 states and 2277 transitions. Word has length 72 [2019-09-08 02:42:19,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:42:19,059 INFO L475 AbstractCegarLoop]: Abstraction has 1907 states and 2277 transitions. [2019-09-08 02:42:19,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 02:42:19,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 2277 transitions. [2019-09-08 02:42:19,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 02:42:19,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:42:19,062 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:42:19,062 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:42:19,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:42:19,062 INFO L82 PathProgramCache]: Analyzing trace with hash -981181543, now seen corresponding path program 2 times [2019-09-08 02:42:19,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:42:19,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:42:19,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:42:19,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:42:19,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:42:19,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:42:19,156 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 11 proven. 25 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-09-08 02:42:19,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:42:19,156 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:42:19,181 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:42:19,231 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:42:19,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:42:19,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-08 02:42:19,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:42:19,438 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 02:42:19,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:42:19,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 18] total 20 [2019-09-08 02:42:19,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 02:42:19,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 02:42:19,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2019-09-08 02:42:19,445 INFO L87 Difference]: Start difference. First operand 1907 states and 2277 transitions. Second operand 20 states. [2019-09-08 02:42:25,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:42:25,179 INFO L93 Difference]: Finished difference Result 10162 states and 13029 transitions. [2019-09-08 02:42:25,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-08 02:42:25,180 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 74 [2019-09-08 02:42:25,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:42:25,193 INFO L225 Difference]: With dead ends: 10162 [2019-09-08 02:42:25,194 INFO L226 Difference]: Without dead ends: 8290 [2019-09-08 02:42:25,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1546 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=303, Invalid=5099, Unknown=0, NotChecked=0, Total=5402 [2019-09-08 02:42:25,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8290 states. [2019-09-08 02:42:25,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8290 to 2087. [2019-09-08 02:42:25,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2087 states. [2019-09-08 02:42:25,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2087 states to 2087 states and 2496 transitions. [2019-09-08 02:42:25,826 INFO L78 Accepts]: Start accepts. Automaton has 2087 states and 2496 transitions. Word has length 74 [2019-09-08 02:42:25,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:42:25,826 INFO L475 AbstractCegarLoop]: Abstraction has 2087 states and 2496 transitions. [2019-09-08 02:42:25,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 02:42:25,826 INFO L276 IsEmpty]: Start isEmpty. Operand 2087 states and 2496 transitions. [2019-09-08 02:42:25,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 02:42:25,829 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:42:25,829 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:42:25,830 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:42:25,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:42:25,830 INFO L82 PathProgramCache]: Analyzing trace with hash -650112925, now seen corresponding path program 9 times [2019-09-08 02:42:25,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:42:25,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:42:25,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:42:25,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:42:25,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:42:25,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:42:26,175 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 26 [2019-09-08 02:42:26,330 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 35 [2019-09-08 02:42:26,478 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 34 [2019-09-08 02:42:26,640 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 36 [2019-09-08 02:42:26,932 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 60 [2019-09-08 02:42:27,105 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 28 [2019-09-08 02:42:27,486 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 50 [2019-09-08 02:42:27,649 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 38 [2019-09-08 02:42:27,721 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 43 proven. 50 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-08 02:42:27,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:42:27,721 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:42:27,732 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 02:42:27,850 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-08 02:42:27,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:42:27,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-08 02:42:27,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:42:28,376 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-08 02:42:28,377 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:42:28,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:42:28,378 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:42:28,378 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-08 02:42:28,413 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 42 proven. 75 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 02:42:28,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:42:28,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21] total 35 [2019-09-08 02:42:28,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-08 02:42:28,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-08 02:42:28,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1033, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 02:42:28,419 INFO L87 Difference]: Start difference. First operand 2087 states and 2496 transitions. Second operand 35 states. [2019-09-08 02:42:31,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:42:31,005 INFO L93 Difference]: Finished difference Result 2931 states and 3600 transitions. [2019-09-08 02:42:31,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 02:42:31,006 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 82 [2019-09-08 02:42:31,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:42:31,011 INFO L225 Difference]: With dead ends: 2931 [2019-09-08 02:42:31,011 INFO L226 Difference]: Without dead ends: 2625 [2019-09-08 02:42:31,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 63 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=389, Invalid=2061, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 02:42:31,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2625 states. [2019-09-08 02:42:31,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2625 to 2001. [2019-09-08 02:42:31,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2001 states. [2019-09-08 02:42:31,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 2001 states and 2400 transitions. [2019-09-08 02:42:31,636 INFO L78 Accepts]: Start accepts. Automaton has 2001 states and 2400 transitions. Word has length 82 [2019-09-08 02:42:31,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:42:31,636 INFO L475 AbstractCegarLoop]: Abstraction has 2001 states and 2400 transitions. [2019-09-08 02:42:31,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-08 02:42:31,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 2400 transitions. [2019-09-08 02:42:31,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 02:42:31,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:42:31,641 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:42:31,641 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:42:31,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:42:31,641 INFO L82 PathProgramCache]: Analyzing trace with hash -123343640, now seen corresponding path program 10 times [2019-09-08 02:42:31,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:42:31,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:42:31,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:42:31,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:42:31,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:42:31,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:42:32,851 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-08 02:42:32,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:42:32,852 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:42:32,862 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 02:42:32,911 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 02:42:32,911 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:42:32,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-08 02:42:32,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:42:32,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:42:33,651 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:42:33,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:42:33,653 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:42:33,654 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:42:33,659 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:42:33,660 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 25 [2019-09-08 02:42:33,660 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:42:33,675 INFO L567 ElimStorePlain]: treesize reduction 5, result has 82.8 percent of original size [2019-09-08 02:42:33,677 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:42:33,677 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:78, output treesize:4 [2019-09-08 02:42:33,757 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-08 02:42:33,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:42:33,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 29 [2019-09-08 02:42:33,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 02:42:33,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 02:42:33,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2019-09-08 02:42:33,765 INFO L87 Difference]: Start difference. First operand 2001 states and 2400 transitions. Second operand 29 states. [2019-09-08 02:42:39,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:42:39,131 INFO L93 Difference]: Finished difference Result 7470 states and 9586 transitions. [2019-09-08 02:42:39,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 02:42:39,132 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 83 [2019-09-08 02:42:39,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:42:39,137 INFO L225 Difference]: With dead ends: 7470 [2019-09-08 02:42:39,138 INFO L226 Difference]: Without dead ends: 7465 [2019-09-08 02:42:39,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 68 SyntacticMatches, 9 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 835 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=407, Invalid=2785, Unknown=0, NotChecked=0, Total=3192 [2019-09-08 02:42:39,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7465 states. [2019-09-08 02:42:39,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7465 to 2046. [2019-09-08 02:42:39,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2046 states. [2019-09-08 02:42:39,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 2046 states and 2445 transitions. [2019-09-08 02:42:39,751 INFO L78 Accepts]: Start accepts. Automaton has 2046 states and 2445 transitions. Word has length 83 [2019-09-08 02:42:39,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:42:39,751 INFO L475 AbstractCegarLoop]: Abstraction has 2046 states and 2445 transitions. [2019-09-08 02:42:39,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 02:42:39,751 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 2445 transitions. [2019-09-08 02:42:39,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 02:42:39,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:42:39,753 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:42:39,753 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:42:39,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:42:39,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1617120574, now seen corresponding path program 11 times [2019-09-08 02:42:39,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:42:39,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:42:39,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:42:39,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:42:39,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:42:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:42:39,928 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-09-08 02:42:39,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:42:39,929 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:42:39,949 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:42:40,918 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-08 02:42:40,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:42:40,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-08 02:42:40,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:42:41,022 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-09-08 02:42:41,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:42:41,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 16 [2019-09-08 02:42:41,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 02:42:41,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 02:42:41,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-09-08 02:42:41,027 INFO L87 Difference]: Start difference. First operand 2046 states and 2445 transitions. Second operand 16 states. [2019-09-08 02:42:43,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:42:43,066 INFO L93 Difference]: Finished difference Result 7703 states and 9550 transitions. [2019-09-08 02:42:43,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 02:42:43,066 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 84 [2019-09-08 02:42:43,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:42:43,070 INFO L225 Difference]: With dead ends: 7703 [2019-09-08 02:42:43,071 INFO L226 Difference]: Without dead ends: 5750 [2019-09-08 02:42:43,073 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-09-08 02:42:43,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5750 states. [2019-09-08 02:42:43,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5750 to 2534. [2019-09-08 02:42:43,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-09-08 02:42:43,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3086 transitions. [2019-09-08 02:42:43,780 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3086 transitions. Word has length 84 [2019-09-08 02:42:43,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:42:43,780 INFO L475 AbstractCegarLoop]: Abstraction has 2534 states and 3086 transitions. [2019-09-08 02:42:43,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 02:42:43,780 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3086 transitions. [2019-09-08 02:42:43,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 02:42:43,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:42:43,783 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:42:43,783 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:42:43,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:42:43,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1414873255, now seen corresponding path program 12 times [2019-09-08 02:42:43,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:42:43,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:42:43,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:42:43,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:42:43,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:42:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:42:43,994 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-09-08 02:42:43,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:42:43,994 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:42:44,009 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:42:44,087 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-08 02:42:44,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:42:44,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-08 02:42:44,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:42:44,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:42:46,531 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:42:46,533 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:42:46,533 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2019-09-08 02:42:46,533 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:42:46,546 INFO L567 ElimStorePlain]: treesize reduction 5, result has 73.7 percent of original size [2019-09-08 02:42:46,547 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:42:46,548 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:3 [2019-09-08 02:42:46,595 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 46 proven. 50 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-08 02:42:46,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:42:46,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 17] total 25 [2019-09-08 02:42:46,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 02:42:46,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 02:42:46,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=520, Unknown=2, NotChecked=0, Total=600 [2019-09-08 02:42:46,600 INFO L87 Difference]: Start difference. First operand 2534 states and 3086 transitions. Second operand 25 states. [2019-09-08 02:43:09,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:43:09,477 INFO L93 Difference]: Finished difference Result 7169 states and 8660 transitions. [2019-09-08 02:43:09,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 02:43:09,477 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 86 [2019-09-08 02:43:09,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:43:09,482 INFO L225 Difference]: With dead ends: 7169 [2019-09-08 02:43:09,482 INFO L226 Difference]: Without dead ends: 6809 [2019-09-08 02:43:09,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=260, Invalid=2282, Unknown=8, NotChecked=0, Total=2550 [2019-09-08 02:43:09,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6809 states. [2019-09-08 02:43:10,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6809 to 2554. [2019-09-08 02:43:10,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2554 states. [2019-09-08 02:43:10,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2554 states and 3106 transitions. [2019-09-08 02:43:10,163 INFO L78 Accepts]: Start accepts. Automaton has 2554 states and 3106 transitions. Word has length 86 [2019-09-08 02:43:10,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:43:10,164 INFO L475 AbstractCegarLoop]: Abstraction has 2554 states and 3106 transitions. [2019-09-08 02:43:10,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 02:43:10,164 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 3106 transitions. [2019-09-08 02:43:10,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 02:43:10,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:43:10,168 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:43:10,168 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:43:10,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:43:10,168 INFO L82 PathProgramCache]: Analyzing trace with hash -189434726, now seen corresponding path program 13 times [2019-09-08 02:43:10,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:43:10,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:43:10,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:43:10,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:43:10,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:43:10,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:43:10,696 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 39 [2019-09-08 02:43:10,867 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 35 [2019-09-08 02:43:11,386 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 47 [2019-09-08 02:43:11,631 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 28 [2019-09-08 02:43:11,668 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 35 proven. 98 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-08 02:43:11,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:43:11,669 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:43:11,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:43:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:43:11,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-08 02:43:11,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:43:11,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:43:12,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:43:12,011 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-08 02:43:12,012 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:43:12,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:43:12,017 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:43:12,019 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:43:12,020 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:43:12,024 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:43:12,025 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 37 [2019-09-08 02:43:12,025 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:43:12,043 INFO L567 ElimStorePlain]: treesize reduction 5, result has 80.0 percent of original size [2019-09-08 02:43:12,044 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:43:12,044 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:106, output treesize:3 [2019-09-08 02:43:12,081 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 35 proven. 118 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 02:43:12,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:43:12,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2019-09-08 02:43:12,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 02:43:12,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 02:43:12,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2019-09-08 02:43:12,085 INFO L87 Difference]: Start difference. First operand 2554 states and 3106 transitions. Second operand 22 states. [2019-09-08 02:43:13,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:43:13,910 INFO L93 Difference]: Finished difference Result 4594 states and 5717 transitions. [2019-09-08 02:43:13,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 02:43:13,911 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 93 [2019-09-08 02:43:13,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:43:13,916 INFO L225 Difference]: With dead ends: 4594 [2019-09-08 02:43:13,916 INFO L226 Difference]: Without dead ends: 4442 [2019-09-08 02:43:13,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 81 SyntacticMatches, 12 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2019-09-08 02:43:13,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4442 states. [2019-09-08 02:43:14,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4442 to 3696. [2019-09-08 02:43:14,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3696 states. [2019-09-08 02:43:14,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3696 states to 3696 states and 4471 transitions. [2019-09-08 02:43:14,863 INFO L78 Accepts]: Start accepts. Automaton has 3696 states and 4471 transitions. Word has length 93 [2019-09-08 02:43:14,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:43:14,864 INFO L475 AbstractCegarLoop]: Abstraction has 3696 states and 4471 transitions. [2019-09-08 02:43:14,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 02:43:14,864 INFO L276 IsEmpty]: Start isEmpty. Operand 3696 states and 4471 transitions. [2019-09-08 02:43:14,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 02:43:14,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:43:14,868 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:43:14,868 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:43:14,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:43:14,868 INFO L82 PathProgramCache]: Analyzing trace with hash 455905118, now seen corresponding path program 14 times [2019-09-08 02:43:14,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:43:14,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:43:14,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:43:14,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:43:14,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:43:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:43:15,482 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 48 [2019-09-08 02:43:15,742 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 45 [2019-09-08 02:43:16,017 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 41 [2019-09-08 02:43:16,544 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 37 [2019-09-08 02:43:17,159 WARN L188 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 91 [2019-09-08 02:43:17,245 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 21 proven. 115 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 02:43:17,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:43:17,246 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:43:17,255 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:43:17,314 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:43:17,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:43:17,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-08 02:43:17,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:43:17,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:43:17,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:43:17,743 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-08 02:43:17,744 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:43:17,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:43:17,748 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:43:17,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:43:17,750 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:43:17,754 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:43:17,755 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 32 [2019-09-08 02:43:17,755 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:43:17,771 INFO L567 ElimStorePlain]: treesize reduction 5, result has 75.0 percent of original size [2019-09-08 02:43:17,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:43:17,771 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:100, output treesize:3 [2019-09-08 02:43:17,813 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 21 proven. 139 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 02:43:17,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:43:17,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 27 [2019-09-08 02:43:17,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 02:43:17,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 02:43:17,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=582, Unknown=0, NotChecked=0, Total=702 [2019-09-08 02:43:17,818 INFO L87 Difference]: Start difference. First operand 3696 states and 4471 transitions. Second operand 27 states. [2019-09-08 02:43:18,338 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 28 [2019-09-08 02:43:18,817 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 45 [2019-09-08 02:43:18,973 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 36 [2019-09-08 02:43:20,081 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 36 [2019-09-08 02:43:20,389 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 37 [2019-09-08 02:43:21,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:43:21,973 INFO L93 Difference]: Finished difference Result 9964 states and 12203 transitions. [2019-09-08 02:43:21,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 02:43:21,974 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-09-08 02:43:21,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:43:21,978 INFO L225 Difference]: With dead ends: 9964 [2019-09-08 02:43:21,978 INFO L226 Difference]: Without dead ends: 5789 [2019-09-08 02:43:21,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 78 SyntacticMatches, 13 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=258, Invalid=1302, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 02:43:21,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5789 states. [2019-09-08 02:43:23,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5789 to 5381. [2019-09-08 02:43:23,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5381 states. [2019-09-08 02:43:23,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5381 states to 5381 states and 6436 transitions. [2019-09-08 02:43:23,419 INFO L78 Accepts]: Start accepts. Automaton has 5381 states and 6436 transitions. Word has length 93 [2019-09-08 02:43:23,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:43:23,420 INFO L475 AbstractCegarLoop]: Abstraction has 5381 states and 6436 transitions. [2019-09-08 02:43:23,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-08 02:43:23,420 INFO L276 IsEmpty]: Start isEmpty. Operand 5381 states and 6436 transitions. [2019-09-08 02:43:23,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 02:43:23,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:43:23,425 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:43:23,425 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:43:23,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:43:23,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1290857626, now seen corresponding path program 15 times [2019-09-08 02:43:23,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:43:23,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:43:23,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:43:23,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:43:23,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:43:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-08 02:43:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:43:23,555 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: program execution has not yet been computed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.getRcfgProgramExecution(TraceCheck.java:440) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.(TraceCheck.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-09-08 02:43:23,561 INFO L168 Benchmark]: Toolchain (without parser) took 606783.75 ms. Allocated memory was 133.7 MB in the beginning and 1.0 GB in the end (delta: 887.1 MB). Free memory was 89.9 MB in the beginning and 102.3 MB in the end (delta: -12.4 MB). Peak memory consumption was 874.7 MB. Max. memory is 7.1 GB. [2019-09-08 02:43:23,562 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory was 108.2 MB in the beginning and 108.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-08 02:43:23,562 INFO L168 Benchmark]: CACSL2BoogieTranslator took 391.22 ms. Allocated memory was 133.7 MB in the beginning and 199.8 MB in the end (delta: 66.1 MB). Free memory was 89.7 MB in the beginning and 177.2 MB in the end (delta: -87.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2019-09-08 02:43:23,563 INFO L168 Benchmark]: Boogie Preprocessor took 42.70 ms. Allocated memory is still 199.8 MB. Free memory was 177.2 MB in the beginning and 174.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-09-08 02:43:23,563 INFO L168 Benchmark]: RCFGBuilder took 429.20 ms. Allocated memory is still 199.8 MB. Free memory was 174.9 MB in the beginning and 156.0 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. [2019-09-08 02:43:23,564 INFO L168 Benchmark]: TraceAbstraction took 605915.75 ms. Allocated memory was 199.8 MB in the beginning and 1.0 GB in the end (delta: 821.0 MB). Free memory was 155.4 MB in the beginning and 102.3 MB in the end (delta: 53.1 MB). Peak memory consumption was 874.1 MB. Max. memory is 7.1 GB. [2019-09-08 02:43:23,565 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory was 108.2 MB in the beginning and 108.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 391.22 ms. Allocated memory was 133.7 MB in the beginning and 199.8 MB in the end (delta: 66.1 MB). Free memory was 89.7 MB in the beginning and 177.2 MB in the end (delta: -87.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.70 ms. Allocated memory is still 199.8 MB. Free memory was 177.2 MB in the beginning and 174.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 429.20 ms. Allocated memory is still 199.8 MB. Free memory was 174.9 MB in the beginning and 156.0 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 605915.75 ms. Allocated memory was 199.8 MB in the beginning and 1.0 GB in the end (delta: 821.0 MB). Free memory was 155.4 MB in the beginning and 102.3 MB in the end (delta: 53.1 MB). Peak memory consumption was 874.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: program execution has not yet been computed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: program execution has not yet been computed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.getRcfgProgramExecution(TraceCheck.java:440) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...