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/systemc/mem_slave_tlm.1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 06:28:59,938 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 06:28:59,940 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 06:28:59,952 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 06:28:59,952 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 06:28:59,954 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 06:28:59,955 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 06:28:59,957 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 06:28:59,959 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 06:28:59,960 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 06:28:59,961 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 06:28:59,962 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 06:28:59,962 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 06:28:59,963 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 06:28:59,964 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 06:28:59,965 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 06:28:59,966 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 06:28:59,967 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 06:28:59,969 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 06:28:59,971 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 06:28:59,972 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 06:28:59,973 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 06:28:59,974 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 06:28:59,975 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 06:28:59,977 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 06:28:59,978 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 06:28:59,978 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 06:28:59,979 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 06:28:59,980 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 06:28:59,980 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 06:28:59,981 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 06:28:59,981 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 06:28:59,982 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 06:28:59,983 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 06:28:59,984 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 06:28:59,984 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 06:28:59,985 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 06:28:59,985 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 06:28:59,985 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 06:28:59,986 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 06:28:59,987 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 06:28:59,987 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 06:29:00,002 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 06:29:00,002 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 06:29:00,003 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 06:29:00,004 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 06:29:00,004 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 06:29:00,006 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 06:29:00,007 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 06:29:00,007 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 06:29:00,007 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 06:29:00,007 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 06:29:00,007 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 06:29:00,007 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 06:29:00,008 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 06:29:00,008 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 06:29:00,008 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 06:29:00,008 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 06:29:00,008 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 06:29:00,008 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 06:29:00,009 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 06:29:00,009 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 06:29:00,009 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 06:29:00,009 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 06:29:00,010 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 06:29:00,010 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 06:29:00,010 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 06:29:00,010 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 06:29:00,010 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 06:29:00,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 06:29:00,011 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 06:29:00,041 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 06:29:00,053 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 06:29:00,056 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 06:29:00,058 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 06:29:00,058 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 06:29:00,059 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/mem_slave_tlm.1.cil.c [2019-09-08 06:29:00,131 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9861ade89/e78f8f000d5d4488ad247954c7df306c/FLAGe0a951cc5 [2019-09-08 06:29:00,741 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 06:29:00,744 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/mem_slave_tlm.1.cil.c [2019-09-08 06:29:00,767 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9861ade89/e78f8f000d5d4488ad247954c7df306c/FLAGe0a951cc5 [2019-09-08 06:29:01,004 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9861ade89/e78f8f000d5d4488ad247954c7df306c [2019-09-08 06:29:01,014 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 06:29:01,016 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 06:29:01,016 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 06:29:01,016 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 06:29:01,019 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 06:29:01,020 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:29:01" (1/1) ... [2019-09-08 06:29:01,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6072a93d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:29:01, skipping insertion in model container [2019-09-08 06:29:01,022 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:29:01" (1/1) ... [2019-09-08 06:29:01,029 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 06:29:01,073 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 06:29:01,481 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:29:01,487 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 06:29:01,583 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:29:01,608 INFO L192 MainTranslator]: Completed translation [2019-09-08 06:29:01,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:29:01 WrapperNode [2019-09-08 06:29:01,608 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 06:29:01,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 06:29:01,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 06:29:01,610 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 06:29:01,621 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:29:01" (1/1) ... [2019-09-08 06:29:01,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:29:01" (1/1) ... [2019-09-08 06:29:01,634 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:29:01" (1/1) ... [2019-09-08 06:29:01,634 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:29:01" (1/1) ... [2019-09-08 06:29:01,666 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:29:01" (1/1) ... [2019-09-08 06:29:01,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:29:01" (1/1) ... [2019-09-08 06:29:01,699 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:29:01" (1/1) ... [2019-09-08 06:29:01,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 06:29:01,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 06:29:01,706 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 06:29:01,706 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 06:29:01,707 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:29:01" (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 06:29:01,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 06:29:01,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 06:29:01,774 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-08 06:29:01,775 INFO L138 BoogieDeclarations]: Found implementation of procedure s_memory_read [2019-09-08 06:29:01,775 INFO L138 BoogieDeclarations]: Found implementation of procedure s_memory_write [2019-09-08 06:29:01,775 INFO L138 BoogieDeclarations]: Found implementation of procedure m_run [2019-09-08 06:29:01,775 INFO L138 BoogieDeclarations]: Found implementation of procedure s_run [2019-09-08 06:29:01,775 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-08 06:29:01,775 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-08 06:29:01,776 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 06:29:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 06:29:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 06:29:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-08 06:29:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure s_memory_read [2019-09-08 06:29:01,777 INFO L130 BoogieDeclarations]: Found specification of procedure s_memory_write [2019-09-08 06:29:01,777 INFO L130 BoogieDeclarations]: Found specification of procedure m_run [2019-09-08 06:29:01,777 INFO L130 BoogieDeclarations]: Found specification of procedure s_run [2019-09-08 06:29:01,777 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-08 06:29:01,777 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-08 06:29:01,777 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 06:29:01,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 06:29:01,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 06:29:03,030 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 06:29:03,031 INFO L283 CfgBuilder]: Removed 13 assume(true) statements. [2019-09-08 06:29:03,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:29:03 BoogieIcfgContainer [2019-09-08 06:29:03,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 06:29:03,034 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 06:29:03,034 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 06:29:03,036 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 06:29:03,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 06:29:01" (1/3) ... [2019-09-08 06:29:03,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@204dfc5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:29:03, skipping insertion in model container [2019-09-08 06:29:03,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:29:01" (2/3) ... [2019-09-08 06:29:03,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@204dfc5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:29:03, skipping insertion in model container [2019-09-08 06:29:03,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:29:03" (3/3) ... [2019-09-08 06:29:03,040 INFO L109 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.1.cil.c [2019-09-08 06:29:03,050 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 06:29:03,059 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 06:29:03,076 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 06:29:03,109 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 06:29:03,125 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 06:29:03,125 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 06:29:03,125 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 06:29:03,126 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 06:29:03,126 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 06:29:03,126 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 06:29:03,126 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 06:29:03,126 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 06:29:03,158 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states. [2019-09-08 06:29:03,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-08 06:29:03,171 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:03,172 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:29:03,174 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:03,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:03,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1545125351, now seen corresponding path program 1 times [2019-09-08 06:29:03,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:03,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:03,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:03,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:03,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:03,561 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 06:29:03,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:29:03,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:29:03,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:29:03,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:29:03,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:29:03,589 INFO L87 Difference]: Start difference. First operand 298 states. Second operand 3 states. [2019-09-08 06:29:04,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:04,160 INFO L93 Difference]: Finished difference Result 786 states and 1400 transitions. [2019-09-08 06:29:04,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:29:04,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-09-08 06:29:04,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:04,180 INFO L225 Difference]: With dead ends: 786 [2019-09-08 06:29:04,180 INFO L226 Difference]: Without dead ends: 485 [2019-09-08 06:29:04,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 06:29:04,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-09-08 06:29:04,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 472. [2019-09-08 06:29:04,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-09-08 06:29:04,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 779 transitions. [2019-09-08 06:29:04,300 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 779 transitions. Word has length 39 [2019-09-08 06:29:04,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:04,300 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 779 transitions. [2019-09-08 06:29:04,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:29:04,301 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 779 transitions. [2019-09-08 06:29:04,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-08 06:29:04,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:04,305 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:29:04,305 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:04,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:04,306 INFO L82 PathProgramCache]: Analyzing trace with hash -378698495, now seen corresponding path program 1 times [2019-09-08 06:29:04,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:04,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:04,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:04,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:04,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:04,399 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 06:29:04,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:29:04,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:29:04,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:29:04,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:29:04,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:29:04,403 INFO L87 Difference]: Start difference. First operand 472 states and 779 transitions. Second operand 3 states. [2019-09-08 06:29:04,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:04,806 INFO L93 Difference]: Finished difference Result 1129 states and 1872 transitions. [2019-09-08 06:29:04,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:29:04,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-09-08 06:29:04,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:04,814 INFO L225 Difference]: With dead ends: 1129 [2019-09-08 06:29:04,814 INFO L226 Difference]: Without dead ends: 669 [2019-09-08 06:29:04,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 06:29:04,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2019-09-08 06:29:04,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 656. [2019-09-08 06:29:04,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2019-09-08 06:29:04,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1061 transitions. [2019-09-08 06:29:04,880 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1061 transitions. Word has length 42 [2019-09-08 06:29:04,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:04,881 INFO L475 AbstractCegarLoop]: Abstraction has 656 states and 1061 transitions. [2019-09-08 06:29:04,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:29:04,881 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1061 transitions. [2019-09-08 06:29:04,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-08 06:29:04,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:04,884 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, 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 06:29:04,884 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:04,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:04,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1388106977, now seen corresponding path program 1 times [2019-09-08 06:29:04,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:04,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:04,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:04,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:04,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:05,001 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 06:29:05,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:29:05,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:29:05,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:29:05,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:29:05,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:29:05,003 INFO L87 Difference]: Start difference. First operand 656 states and 1061 transitions. Second operand 3 states. [2019-09-08 06:29:05,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:05,329 INFO L93 Difference]: Finished difference Result 1497 states and 2444 transitions. [2019-09-08 06:29:05,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:29:05,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-09-08 06:29:05,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:05,337 INFO L225 Difference]: With dead ends: 1497 [2019-09-08 06:29:05,338 INFO L226 Difference]: Without dead ends: 854 [2019-09-08 06:29:05,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 06:29:05,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2019-09-08 06:29:05,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 841. [2019-09-08 06:29:05,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2019-09-08 06:29:05,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1330 transitions. [2019-09-08 06:29:05,399 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1330 transitions. Word has length 44 [2019-09-08 06:29:05,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:05,399 INFO L475 AbstractCegarLoop]: Abstraction has 841 states and 1330 transitions. [2019-09-08 06:29:05,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:29:05,399 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1330 transitions. [2019-09-08 06:29:05,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-08 06:29:05,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:05,402 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, 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 06:29:05,402 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:05,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:05,403 INFO L82 PathProgramCache]: Analyzing trace with hash -15599756, now seen corresponding path program 1 times [2019-09-08 06:29:05,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:05,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:05,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:05,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:05,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:05,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:05,515 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 06:29:05,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:29:05,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:29:05,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:29:05,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:29:05,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:29:05,517 INFO L87 Difference]: Start difference. First operand 841 states and 1330 transitions. Second operand 3 states. [2019-09-08 06:29:05,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:05,824 INFO L93 Difference]: Finished difference Result 1812 states and 2910 transitions. [2019-09-08 06:29:05,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:29:05,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-09-08 06:29:05,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:05,832 INFO L225 Difference]: With dead ends: 1812 [2019-09-08 06:29:05,832 INFO L226 Difference]: Without dead ends: 985 [2019-09-08 06:29:05,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 06:29:05,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2019-09-08 06:29:05,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 976. [2019-09-08 06:29:05,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2019-09-08 06:29:05,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1506 transitions. [2019-09-08 06:29:05,901 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1506 transitions. Word has length 47 [2019-09-08 06:29:05,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:05,901 INFO L475 AbstractCegarLoop]: Abstraction has 976 states and 1506 transitions. [2019-09-08 06:29:05,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:29:05,902 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1506 transitions. [2019-09-08 06:29:05,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-08 06:29:05,903 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:05,903 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, 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 06:29:05,904 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:05,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:05,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1883107672, now seen corresponding path program 1 times [2019-09-08 06:29:05,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:05,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:05,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:05,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:05,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:06,001 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 06:29:06,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:29:06,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:29:06,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:29:06,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:29:06,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:29:06,003 INFO L87 Difference]: Start difference. First operand 976 states and 1506 transitions. Second operand 3 states. [2019-09-08 06:29:06,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:06,303 INFO L93 Difference]: Finished difference Result 2082 states and 3281 transitions. [2019-09-08 06:29:06,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:29:06,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-09-08 06:29:06,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:06,315 INFO L225 Difference]: With dead ends: 2082 [2019-09-08 06:29:06,315 INFO L226 Difference]: Without dead ends: 1121 [2019-09-08 06:29:06,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 06:29:06,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2019-09-08 06:29:06,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1112. [2019-09-08 06:29:06,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1112 states. [2019-09-08 06:29:06,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1675 transitions. [2019-09-08 06:29:06,435 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1675 transitions. Word has length 49 [2019-09-08 06:29:06,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:06,437 INFO L475 AbstractCegarLoop]: Abstraction has 1112 states and 1675 transitions. [2019-09-08 06:29:06,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:29:06,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1675 transitions. [2019-09-08 06:29:06,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-08 06:29:06,439 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:06,440 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, 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 06:29:06,440 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:06,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:06,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1247138858, now seen corresponding path program 1 times [2019-09-08 06:29:06,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:06,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:06,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:06,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:06,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:06,516 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 06:29:06,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:29:06,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:29:06,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:29:06,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:29:06,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:29:06,519 INFO L87 Difference]: Start difference. First operand 1112 states and 1675 transitions. Second operand 3 states. [2019-09-08 06:29:06,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:06,750 INFO L93 Difference]: Finished difference Result 3182 states and 4885 transitions. [2019-09-08 06:29:06,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:29:06,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-09-08 06:29:06,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:06,767 INFO L225 Difference]: With dead ends: 3182 [2019-09-08 06:29:06,767 INFO L226 Difference]: Without dead ends: 2091 [2019-09-08 06:29:06,774 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 06:29:06,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2019-09-08 06:29:06,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 2078. [2019-09-08 06:29:06,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2078 states. [2019-09-08 06:29:06,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2078 states to 2078 states and 3137 transitions. [2019-09-08 06:29:06,917 INFO L78 Accepts]: Start accepts. Automaton has 2078 states and 3137 transitions. Word has length 49 [2019-09-08 06:29:06,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:06,919 INFO L475 AbstractCegarLoop]: Abstraction has 2078 states and 3137 transitions. [2019-09-08 06:29:06,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:29:06,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2078 states and 3137 transitions. [2019-09-08 06:29:06,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-08 06:29:06,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:06,922 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, 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, 1] [2019-09-08 06:29:06,922 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:06,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:06,926 INFO L82 PathProgramCache]: Analyzing trace with hash -552063609, now seen corresponding path program 1 times [2019-09-08 06:29:06,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:06,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:06,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:06,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:06,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:07,007 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 06:29:07,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:29:07,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:29:07,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:29:07,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:29:07,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:29:07,009 INFO L87 Difference]: Start difference. First operand 2078 states and 3137 transitions. Second operand 3 states. [2019-09-08 06:29:07,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:07,235 INFO L93 Difference]: Finished difference Result 5008 states and 8024 transitions. [2019-09-08 06:29:07,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:29:07,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-09-08 06:29:07,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:07,262 INFO L225 Difference]: With dead ends: 5008 [2019-09-08 06:29:07,262 INFO L226 Difference]: Without dead ends: 2963 [2019-09-08 06:29:07,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 06:29:07,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2963 states. [2019-09-08 06:29:07,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2963 to 2946. [2019-09-08 06:29:07,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2946 states. [2019-09-08 06:29:07,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2946 states to 2946 states and 4673 transitions. [2019-09-08 06:29:07,641 INFO L78 Accepts]: Start accepts. Automaton has 2946 states and 4673 transitions. Word has length 50 [2019-09-08 06:29:07,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:07,642 INFO L475 AbstractCegarLoop]: Abstraction has 2946 states and 4673 transitions. [2019-09-08 06:29:07,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:29:07,643 INFO L276 IsEmpty]: Start isEmpty. Operand 2946 states and 4673 transitions. [2019-09-08 06:29:07,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-08 06:29:07,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:07,645 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, 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, 1, 1] [2019-09-08 06:29:07,646 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:07,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:07,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1043519970, now seen corresponding path program 1 times [2019-09-08 06:29:07,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:07,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:07,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:07,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:07,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:07,703 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 06:29:07,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:29:07,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:29:07,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:29:07,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:29:07,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:29:07,706 INFO L87 Difference]: Start difference. First operand 2946 states and 4673 transitions. Second operand 3 states. [2019-09-08 06:29:08,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:08,106 INFO L93 Difference]: Finished difference Result 6259 states and 10465 transitions. [2019-09-08 06:29:08,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:29:08,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-09-08 06:29:08,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:08,134 INFO L225 Difference]: With dead ends: 6259 [2019-09-08 06:29:08,134 INFO L226 Difference]: Without dead ends: 3336 [2019-09-08 06:29:08,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 06:29:08,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3336 states. [2019-09-08 06:29:08,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3336 to 3326. [2019-09-08 06:29:08,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3326 states. [2019-09-08 06:29:08,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3326 states to 3326 states and 5197 transitions. [2019-09-08 06:29:08,459 INFO L78 Accepts]: Start accepts. Automaton has 3326 states and 5197 transitions. Word has length 51 [2019-09-08 06:29:08,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:08,460 INFO L475 AbstractCegarLoop]: Abstraction has 3326 states and 5197 transitions. [2019-09-08 06:29:08,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:29:08,460 INFO L276 IsEmpty]: Start isEmpty. Operand 3326 states and 5197 transitions. [2019-09-08 06:29:08,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 06:29:08,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:08,464 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:29:08,464 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:08,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:08,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1852463729, now seen corresponding path program 1 times [2019-09-08 06:29:08,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:08,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:08,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:08,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:08,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:08,525 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 06:29:08,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:29:08,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:29:08,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:29:08,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:29:08,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:29:08,527 INFO L87 Difference]: Start difference. First operand 3326 states and 5197 transitions. Second operand 3 states. [2019-09-08 06:29:09,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:09,059 INFO L93 Difference]: Finished difference Result 9318 states and 16762 transitions. [2019-09-08 06:29:09,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:29:09,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-09-08 06:29:09,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:09,263 INFO L225 Difference]: With dead ends: 9318 [2019-09-08 06:29:09,263 INFO L226 Difference]: Without dead ends: 6017 [2019-09-08 06:29:09,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 06:29:09,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6017 states. [2019-09-08 06:29:09,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6017 to 5912. [2019-09-08 06:29:09,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5912 states. [2019-09-08 06:29:09,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5912 states to 5912 states and 10109 transitions. [2019-09-08 06:29:09,875 INFO L78 Accepts]: Start accepts. Automaton has 5912 states and 10109 transitions. Word has length 63 [2019-09-08 06:29:09,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:09,876 INFO L475 AbstractCegarLoop]: Abstraction has 5912 states and 10109 transitions. [2019-09-08 06:29:09,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:29:09,876 INFO L276 IsEmpty]: Start isEmpty. Operand 5912 states and 10109 transitions. [2019-09-08 06:29:09,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 06:29:09,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:09,881 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:29:09,881 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:09,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:09,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1607730664, now seen corresponding path program 1 times [2019-09-08 06:29:09,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:09,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:09,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:09,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:09,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:09,944 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 06:29:09,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:29:09,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:29:09,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:29:09,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:29:09,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:29:09,946 INFO L87 Difference]: Start difference. First operand 5912 states and 10109 transitions. Second operand 4 states. [2019-09-08 06:29:10,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:10,952 INFO L93 Difference]: Finished difference Result 9741 states and 20679 transitions. [2019-09-08 06:29:10,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:29:10,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-08 06:29:10,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:11,046 INFO L225 Difference]: With dead ends: 9741 [2019-09-08 06:29:11,046 INFO L226 Difference]: Without dead ends: 9737 [2019-09-08 06:29:11,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:29:11,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9737 states. [2019-09-08 06:29:12,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9737 to 9646. [2019-09-08 06:29:12,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9646 states. [2019-09-08 06:29:12,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9646 states to 9646 states and 20516 transitions. [2019-09-08 06:29:12,857 INFO L78 Accepts]: Start accepts. Automaton has 9646 states and 20516 transitions. Word has length 63 [2019-09-08 06:29:12,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:12,858 INFO L475 AbstractCegarLoop]: Abstraction has 9646 states and 20516 transitions. [2019-09-08 06:29:12,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:29:12,858 INFO L276 IsEmpty]: Start isEmpty. Operand 9646 states and 20516 transitions. [2019-09-08 06:29:12,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 06:29:12,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:12,868 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, 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, 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 06:29:12,869 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:12,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:12,869 INFO L82 PathProgramCache]: Analyzing trace with hash -297288247, now seen corresponding path program 1 times [2019-09-08 06:29:12,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:12,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:12,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:12,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:12,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:12,953 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 06:29:12,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:29:12,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:29:12,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:29:12,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:29:12,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:29:12,955 INFO L87 Difference]: Start difference. First operand 9646 states and 20516 transitions. Second operand 3 states. [2019-09-08 06:29:13,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:13,911 INFO L93 Difference]: Finished difference Result 18705 states and 46679 transitions. [2019-09-08 06:29:13,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:29:13,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-09-08 06:29:13,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:14,020 INFO L225 Difference]: With dead ends: 18705 [2019-09-08 06:29:14,020 INFO L226 Difference]: Without dead ends: 9088 [2019-09-08 06:29:15,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 06:29:15,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9088 states. [2019-09-08 06:29:16,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9088 to 9048. [2019-09-08 06:29:16,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9048 states. [2019-09-08 06:29:16,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9048 states to 9048 states and 19551 transitions. [2019-09-08 06:29:16,868 INFO L78 Accepts]: Start accepts. Automaton has 9048 states and 19551 transitions. Word has length 75 [2019-09-08 06:29:16,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:16,870 INFO L475 AbstractCegarLoop]: Abstraction has 9048 states and 19551 transitions. [2019-09-08 06:29:16,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:29:16,870 INFO L276 IsEmpty]: Start isEmpty. Operand 9048 states and 19551 transitions. [2019-09-08 06:29:16,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 06:29:16,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:16,886 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, 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, 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, 1] [2019-09-08 06:29:16,887 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:16,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:16,887 INFO L82 PathProgramCache]: Analyzing trace with hash 218696628, now seen corresponding path program 1 times [2019-09-08 06:29:16,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:16,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:16,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:16,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:16,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:16,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:16,949 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 06:29:16,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:29:16,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:29:16,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:29:16,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:29:16,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:29:16,951 INFO L87 Difference]: Start difference. First operand 9048 states and 19551 transitions. Second operand 3 states. [2019-09-08 06:29:17,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:17,858 INFO L93 Difference]: Finished difference Result 18037 states and 45374 transitions. [2019-09-08 06:29:17,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:29:17,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-08 06:29:17,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:17,937 INFO L225 Difference]: With dead ends: 18037 [2019-09-08 06:29:17,937 INFO L226 Difference]: Without dead ends: 9018 [2019-09-08 06:29:18,195 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 06:29:18,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9018 states. [2019-09-08 06:29:19,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9018 to 8994. [2019-09-08 06:29:19,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8994 states. [2019-09-08 06:29:19,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8994 states to 8994 states and 19362 transitions. [2019-09-08 06:29:19,722 INFO L78 Accepts]: Start accepts. Automaton has 8994 states and 19362 transitions. Word has length 77 [2019-09-08 06:29:19,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:19,722 INFO L475 AbstractCegarLoop]: Abstraction has 8994 states and 19362 transitions. [2019-09-08 06:29:19,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:29:19,723 INFO L276 IsEmpty]: Start isEmpty. Operand 8994 states and 19362 transitions. [2019-09-08 06:29:19,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 06:29:19,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:19,734 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, 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, 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, 1, 1] [2019-09-08 06:29:19,735 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:19,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:19,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1591932620, now seen corresponding path program 1 times [2019-09-08 06:29:19,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:19,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:19,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:19,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:19,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:19,878 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 06:29:19,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:29:19,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 06:29:19,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 06:29:19,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 06:29:19,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 06:29:19,880 INFO L87 Difference]: Start difference. First operand 8994 states and 19362 transitions. Second operand 9 states. [2019-09-08 06:29:27,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:27,638 INFO L93 Difference]: Finished difference Result 31869 states and 174747 transitions. [2019-09-08 06:29:27,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 06:29:27,639 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2019-09-08 06:29:27,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:30,354 INFO L225 Difference]: With dead ends: 31869 [2019-09-08 06:29:30,355 INFO L226 Difference]: Without dead ends: 22904 [2019-09-08 06:29:30,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=895, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 06:29:30,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22904 states. [2019-09-08 06:29:43,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22904 to 21760. [2019-09-08 06:29:43,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21760 states. [2019-09-08 06:29:44,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21760 states to 21760 states and 108536 transitions. [2019-09-08 06:29:44,564 INFO L78 Accepts]: Start accepts. Automaton has 21760 states and 108536 transitions. Word has length 78 [2019-09-08 06:29:44,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:44,565 INFO L475 AbstractCegarLoop]: Abstraction has 21760 states and 108536 transitions. [2019-09-08 06:29:44,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 06:29:44,565 INFO L276 IsEmpty]: Start isEmpty. Operand 21760 states and 108536 transitions. [2019-09-08 06:29:44,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 06:29:44,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:44,592 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, 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, 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, 1, 1, 1] [2019-09-08 06:29:44,593 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:44,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:44,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1509689241, now seen corresponding path program 1 times [2019-09-08 06:29:44,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:44,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:44,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:44,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:44,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:45,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:45,468 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 06:29:45,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:29:45,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 06:29:45,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 06:29:45,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 06:29:45,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:29:45,470 INFO L87 Difference]: Start difference. First operand 21760 states and 108536 transitions. Second operand 8 states. [2019-09-08 06:29:56,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:56,795 INFO L93 Difference]: Finished difference Result 51109 states and 397968 transitions. [2019-09-08 06:29:56,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 06:29:56,796 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 79 [2019-09-08 06:29:56,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:57,830 INFO L225 Difference]: With dead ends: 51109 [2019-09-08 06:29:57,830 INFO L226 Difference]: Without dead ends: 29378 [2019-09-08 06:30:00,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-09-08 06:30:01,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29378 states. [2019-09-08 06:30:24,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29378 to 27706. [2019-09-08 06:30:24,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27706 states. [2019-09-08 06:30:26,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27706 states to 27706 states and 178792 transitions. [2019-09-08 06:30:26,868 INFO L78 Accepts]: Start accepts. Automaton has 27706 states and 178792 transitions. Word has length 79 [2019-09-08 06:30:26,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:30:26,869 INFO L475 AbstractCegarLoop]: Abstraction has 27706 states and 178792 transitions. [2019-09-08 06:30:26,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 06:30:26,869 INFO L276 IsEmpty]: Start isEmpty. Operand 27706 states and 178792 transitions. [2019-09-08 06:30:26,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 06:30:26,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:30:26,893 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:30:26,893 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:30:26,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:30:26,894 INFO L82 PathProgramCache]: Analyzing trace with hash -2022082367, now seen corresponding path program 1 times [2019-09-08 06:30:26,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:30:26,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:30:26,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:30:26,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:30:26,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:30:26,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:30:26,948 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 06:30:26,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:30:26,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:30:26,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:30:26,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:30:26,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:30:26,950 INFO L87 Difference]: Start difference. First operand 27706 states and 178792 transitions. Second operand 3 states. [2019-09-08 06:30:33,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:30:33,805 INFO L93 Difference]: Finished difference Result 55297 states and 356689 transitions. [2019-09-08 06:30:33,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:30:33,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-09-08 06:30:33,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:30:34,647 INFO L225 Difference]: With dead ends: 55297 [2019-09-08 06:30:34,647 INFO L226 Difference]: Without dead ends: 27610 [2019-09-08 06:30:44,098 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 06:30:44,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27610 states. [2019-09-08 06:31:04,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27610 to 27610. [2019-09-08 06:31:04,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27610 states. [2019-09-08 06:31:06,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27610 states to 27610 states and 177919 transitions. [2019-09-08 06:31:06,144 INFO L78 Accepts]: Start accepts. Automaton has 27610 states and 177919 transitions. Word has length 84 [2019-09-08 06:31:06,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:31:06,145 INFO L475 AbstractCegarLoop]: Abstraction has 27610 states and 177919 transitions. [2019-09-08 06:31:06,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:31:06,145 INFO L276 IsEmpty]: Start isEmpty. Operand 27610 states and 177919 transitions. [2019-09-08 06:31:06,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 06:31:06,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:31:06,168 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:31:06,168 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:31:06,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:31:06,168 INFO L82 PathProgramCache]: Analyzing trace with hash 55254531, now seen corresponding path program 1 times [2019-09-08 06:31:06,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:31:06,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:31:06,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:31:06,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:31:06,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:31:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:31:06,276 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 06:31:06,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:31:06,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 06:31:06,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 06:31:06,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 06:31:06,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:31:06,280 INFO L87 Difference]: Start difference. First operand 27610 states and 177919 transitions. Second operand 8 states. [2019-09-08 06:31:31,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:31:31,681 INFO L93 Difference]: Finished difference Result 75814 states and 866437 transitions. [2019-09-08 06:31:31,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 06:31:31,681 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2019-09-08 06:31:31,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:31:33,160 INFO L225 Difference]: With dead ends: 75814 [2019-09-08 06:31:33,160 INFO L226 Difference]: Without dead ends: 48222 [2019-09-08 06:31:39,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-09-08 06:31:39,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48222 states. [2019-09-08 06:33:35,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48222 to 42213. [2019-09-08 06:33:35,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42213 states. [2019-09-08 06:33:39,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42213 states to 42213 states and 346124 transitions. [2019-09-08 06:33:39,356 INFO L78 Accepts]: Start accepts. Automaton has 42213 states and 346124 transitions. Word has length 84 [2019-09-08 06:33:39,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:33:39,357 INFO L475 AbstractCegarLoop]: Abstraction has 42213 states and 346124 transitions. [2019-09-08 06:33:39,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 06:33:39,357 INFO L276 IsEmpty]: Start isEmpty. Operand 42213 states and 346124 transitions. [2019-09-08 06:33:39,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 06:33:39,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:33:39,372 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:33:39,373 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:33:39,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:33:39,373 INFO L82 PathProgramCache]: Analyzing trace with hash 748132869, now seen corresponding path program 1 times [2019-09-08 06:33:39,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:33:39,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:33:39,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:39,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:33:39,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:33:39,450 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 06:33:39,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:33:39,451 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 06:33:39,466 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 06:33:39,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:33:39,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 1241 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 06:33:39,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:33:39,720 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:33:39,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:33:39,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-09-08 06:33:39,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:33:39,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:33:39,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:33:39,730 INFO L87 Difference]: Start difference. First operand 42213 states and 346124 transitions. Second operand 6 states. [2019-09-08 06:34:01,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:34:01,503 INFO L93 Difference]: Finished difference Result 83304 states and 756664 transitions. [2019-09-08 06:34:01,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:34:01,505 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-09-08 06:34:01,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:34:02,430 INFO L225 Difference]: With dead ends: 83304 [2019-09-08 06:34:02,431 INFO L226 Difference]: Without dead ends: 37766 [2019-09-08 06:34:23,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:34:23,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37766 states. [2019-09-08 06:34:57,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37766 to 30850. [2019-09-08 06:34:57,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30850 states. [2019-09-08 06:34:58,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30850 states to 30850 states and 138275 transitions. [2019-09-08 06:34:58,573 INFO L78 Accepts]: Start accepts. Automaton has 30850 states and 138275 transitions. Word has length 89 [2019-09-08 06:34:58,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:34:58,574 INFO L475 AbstractCegarLoop]: Abstraction has 30850 states and 138275 transitions. [2019-09-08 06:34:58,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:34:58,574 INFO L276 IsEmpty]: Start isEmpty. Operand 30850 states and 138275 transitions. [2019-09-08 06:34:58,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 06:34:58,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:34:58,582 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1, 1, 1] [2019-09-08 06:34:58,583 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:34:58,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:34:58,583 INFO L82 PathProgramCache]: Analyzing trace with hash -630726888, now seen corresponding path program 1 times [2019-09-08 06:34:58,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:34:58,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:34:58,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:34:58,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:34:58,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:34:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:34:58,650 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:34:58,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:34:58,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:34:58,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:34:58,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:34:58,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:34:58,652 INFO L87 Difference]: Start difference. First operand 30850 states and 138275 transitions. Second operand 3 states. [2019-09-08 06:35:03,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:35:03,931 INFO L93 Difference]: Finished difference Result 54612 states and 304484 transitions. [2019-09-08 06:35:03,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:35:03,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-08 06:35:03,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:35:04,545 INFO L225 Difference]: With dead ends: 54612 [2019-09-08 06:35:04,545 INFO L226 Difference]: Without dead ends: 23813 [2019-09-08 06:35:06,898 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 06:35:06,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23813 states. [2019-09-08 06:35:19,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23813 to 20993. [2019-09-08 06:35:19,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20993 states. [2019-09-08 06:35:19,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20993 states to 20993 states and 59676 transitions. [2019-09-08 06:35:19,497 INFO L78 Accepts]: Start accepts. Automaton has 20993 states and 59676 transitions. Word has length 120 [2019-09-08 06:35:19,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:35:19,498 INFO L475 AbstractCegarLoop]: Abstraction has 20993 states and 59676 transitions. [2019-09-08 06:35:19,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:35:19,498 INFO L276 IsEmpty]: Start isEmpty. Operand 20993 states and 59676 transitions. [2019-09-08 06:35:19,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 06:35:19,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:35:19,512 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1, 1, 1] [2019-09-08 06:35:19,512 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:35:19,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:35:19,513 INFO L82 PathProgramCache]: Analyzing trace with hash 559242779, now seen corresponding path program 1 times [2019-09-08 06:35:19,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:35:19,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:35:19,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:19,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:35:19,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:35:19,609 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 23 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 06:35:19,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:35:19,610 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 06:35:19,625 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 06:35:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:35:19,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 1447 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 06:35:19,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:35:19,874 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 06:35:19,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:35:19,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:35:19,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:35:19,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:35:19,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:35:19,891 INFO L87 Difference]: Start difference. First operand 20993 states and 59676 transitions. Second operand 7 states. [2019-09-08 06:35:22,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:35:22,441 INFO L93 Difference]: Finished difference Result 41391 states and 143461 transitions. [2019-09-08 06:35:22,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 06:35:22,445 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 153 [2019-09-08 06:35:22,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:35:22,750 INFO L225 Difference]: With dead ends: 41391 [2019-09-08 06:35:22,750 INFO L226 Difference]: Without dead ends: 18146 [2019-09-08 06:35:23,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2019-09-08 06:35:23,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18146 states. [2019-09-08 06:35:26,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18146 to 13443. [2019-09-08 06:35:26,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13443 states. [2019-09-08 06:35:26,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13443 states to 13443 states and 34316 transitions. [2019-09-08 06:35:26,289 INFO L78 Accepts]: Start accepts. Automaton has 13443 states and 34316 transitions. Word has length 153 [2019-09-08 06:35:26,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:35:26,290 INFO L475 AbstractCegarLoop]: Abstraction has 13443 states and 34316 transitions. [2019-09-08 06:35:26,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:35:26,290 INFO L276 IsEmpty]: Start isEmpty. Operand 13443 states and 34316 transitions. [2019-09-08 06:35:26,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-08 06:35:26,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:35:26,299 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1, 1] [2019-09-08 06:35:26,299 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:35:26,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:35:26,299 INFO L82 PathProgramCache]: Analyzing trace with hash -759634971, now seen corresponding path program 1 times [2019-09-08 06:35:26,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:35:26,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:35:26,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:26,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:35:26,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:35:26,435 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:35:26,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:35:26,435 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:35:26,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:35:26,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:35:26,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 1465 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:35:26,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:35:26,669 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream closed [2019-09-08 06:35:26,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:35:26,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2019-09-08 06:35:26,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 06:35:26,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 06:35:26,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 06:35:26,689 INFO L87 Difference]: Start difference. First operand 13443 states and 34316 transitions. Second operand 10 states. [2019-09-08 06:35:30,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:35:30,619 INFO L93 Difference]: Finished difference Result 22906 states and 82895 transitions. [2019-09-08 06:35:30,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 06:35:30,619 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 162 [2019-09-08 06:35:30,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:35:30,813 INFO L225 Difference]: With dead ends: 22906 [2019-09-08 06:35:30,813 INFO L226 Difference]: Without dead ends: 9514 [2019-09-08 06:35:31,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=614, Unknown=0, NotChecked=0, Total=812 [2019-09-08 06:35:31,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9514 states. [2019-09-08 06:35:32,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9514 to 7953. [2019-09-08 06:35:32,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7953 states. [2019-09-08 06:35:32,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7953 states to 7953 states and 17542 transitions. [2019-09-08 06:35:32,727 INFO L78 Accepts]: Start accepts. Automaton has 7953 states and 17542 transitions. Word has length 162 [2019-09-08 06:35:32,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:35:32,728 INFO L475 AbstractCegarLoop]: Abstraction has 7953 states and 17542 transitions. [2019-09-08 06:35:32,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 06:35:32,728 INFO L276 IsEmpty]: Start isEmpty. Operand 7953 states and 17542 transitions. [2019-09-08 06:35:32,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:35:32,735 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:35:32,736 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:35:32,736 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:35:32,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:35:32,736 INFO L82 PathProgramCache]: Analyzing trace with hash -2080209341, now seen corresponding path program 1 times [2019-09-08 06:35:32,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:35:32,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:35:32,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:32,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:35:32,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:35:32,841 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 41 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 06:35:32,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:35:32,841 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:35:32,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:35:33,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:35:33,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 1490 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:35:33,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:35:33,170 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:35:33,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:35:33,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:35:33,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:35:33,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:35:33,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:35:33,191 INFO L87 Difference]: Start difference. First operand 7953 states and 17542 transitions. Second operand 7 states. [2019-09-08 06:35:36,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:35:36,102 INFO L93 Difference]: Finished difference Result 13760 states and 31942 transitions. [2019-09-08 06:35:36,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 06:35:36,103 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 176 [2019-09-08 06:35:36,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:35:36,256 INFO L225 Difference]: With dead ends: 13760 [2019-09-08 06:35:36,257 INFO L226 Difference]: Without dead ends: 5840 [2019-09-08 06:35:36,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-09-08 06:35:36,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5840 states. [2019-09-08 06:35:37,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5840 to 5257. [2019-09-08 06:35:37,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5257 states. [2019-09-08 06:35:37,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5257 states to 5257 states and 8568 transitions. [2019-09-08 06:35:37,201 INFO L78 Accepts]: Start accepts. Automaton has 5257 states and 8568 transitions. Word has length 176 [2019-09-08 06:35:37,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:35:37,202 INFO L475 AbstractCegarLoop]: Abstraction has 5257 states and 8568 transitions. [2019-09-08 06:35:37,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:35:37,202 INFO L276 IsEmpty]: Start isEmpty. Operand 5257 states and 8568 transitions. [2019-09-08 06:35:37,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 06:35:37,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:35:37,209 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 1, 1, 1, 1, 1] [2019-09-08 06:35:37,210 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:35:37,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:35:37,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1540183665, now seen corresponding path program 1 times [2019-09-08 06:35:37,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:35:37,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:35:37,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:37,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:35:37,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:35:37,452 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 06:35:37,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:35:37,452 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 06:35:37,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:35:37,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:35:37,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 1513 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 06:35:37,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:35:37,831 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-08 06:35:37,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:35:37,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2019-09-08 06:35:37,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 06:35:37,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 06:35:37,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-08 06:35:37,852 INFO L87 Difference]: Start difference. First operand 5257 states and 8568 transitions. Second operand 10 states. [2019-09-08 06:35:41,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:35:41,981 INFO L93 Difference]: Finished difference Result 12363 states and 28095 transitions. [2019-09-08 06:35:41,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-08 06:35:41,983 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 179 [2019-09-08 06:35:41,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:35:42,145 INFO L225 Difference]: With dead ends: 12363 [2019-09-08 06:35:42,145 INFO L226 Difference]: Without dead ends: 7530 [2019-09-08 06:35:42,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=517, Invalid=2135, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 06:35:42,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7530 states. [2019-09-08 06:35:42,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7530 to 6304. [2019-09-08 06:35:42,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6304 states. [2019-09-08 06:35:42,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6304 states to 6304 states and 10108 transitions. [2019-09-08 06:35:42,671 INFO L78 Accepts]: Start accepts. Automaton has 6304 states and 10108 transitions. Word has length 179 [2019-09-08 06:35:42,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:35:42,671 INFO L475 AbstractCegarLoop]: Abstraction has 6304 states and 10108 transitions. [2019-09-08 06:35:42,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 06:35:42,672 INFO L276 IsEmpty]: Start isEmpty. Operand 6304 states and 10108 transitions. [2019-09-08 06:35:42,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-08 06:35:42,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:35:42,676 INFO L399 BasicCegarLoop]: trace histogram [2, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1] [2019-09-08 06:35:42,676 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:35:42,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:35:42,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1938503982, now seen corresponding path program 1 times [2019-09-08 06:35:42,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:35:42,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:35:42,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:42,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:35:42,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:35:42,769 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 06:35:42,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:35:42,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:35:42,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:35:42,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:35:42,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:35:42,771 INFO L87 Difference]: Start difference. First operand 6304 states and 10108 transitions. Second operand 3 states. [2019-09-08 06:35:43,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:35:43,782 INFO L93 Difference]: Finished difference Result 8610 states and 14079 transitions. [2019-09-08 06:35:43,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:35:43,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-09-08 06:35:43,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:35:43,826 INFO L225 Difference]: With dead ends: 8610 [2019-09-08 06:35:43,827 INFO L226 Difference]: Without dead ends: 5653 [2019-09-08 06:35:43,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 06:35:43,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5653 states. [2019-09-08 06:35:44,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5653 to 5520. [2019-09-08 06:35:44,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5520 states. [2019-09-08 06:35:44,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5520 states to 5520 states and 8377 transitions. [2019-09-08 06:35:44,145 INFO L78 Accepts]: Start accepts. Automaton has 5520 states and 8377 transitions. Word has length 183 [2019-09-08 06:35:44,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:35:44,146 INFO L475 AbstractCegarLoop]: Abstraction has 5520 states and 8377 transitions. [2019-09-08 06:35:44,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:35:44,146 INFO L276 IsEmpty]: Start isEmpty. Operand 5520 states and 8377 transitions. [2019-09-08 06:35:44,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-08 06:35:44,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:35:44,149 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:35:44,149 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:35:44,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:35:44,149 INFO L82 PathProgramCache]: Analyzing trace with hash 886633830, now seen corresponding path program 1 times [2019-09-08 06:35:44,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:35:44,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:35:44,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:44,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:35:44,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:35:44,399 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 25 proven. 33 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 06:35:44,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:35:44,399 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 06:35:44,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:35:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:35:44,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 1528 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 06:35:44,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:35:44,709 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 32 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 06:35:44,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:35:44,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2019-09-08 06:35:44,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 06:35:44,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 06:35:44,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-09-08 06:35:44,717 INFO L87 Difference]: Start difference. First operand 5520 states and 8377 transitions. Second operand 15 states. [2019-09-08 06:35:46,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:35:46,975 INFO L93 Difference]: Finished difference Result 9810 states and 16997 transitions. [2019-09-08 06:35:46,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 06:35:46,975 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 187 [2019-09-08 06:35:46,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:35:47,062 INFO L225 Difference]: With dead ends: 9810 [2019-09-08 06:35:47,062 INFO L226 Difference]: Without dead ends: 4712 [2019-09-08 06:35:47,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=675, Unknown=0, NotChecked=0, Total=870 [2019-09-08 06:35:47,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4712 states. [2019-09-08 06:35:47,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4712 to 3823. [2019-09-08 06:35:47,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3823 states. [2019-09-08 06:35:47,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3823 states to 3823 states and 5362 transitions. [2019-09-08 06:35:47,773 INFO L78 Accepts]: Start accepts. Automaton has 3823 states and 5362 transitions. Word has length 187 [2019-09-08 06:35:47,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:35:47,773 INFO L475 AbstractCegarLoop]: Abstraction has 3823 states and 5362 transitions. [2019-09-08 06:35:47,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 06:35:47,773 INFO L276 IsEmpty]: Start isEmpty. Operand 3823 states and 5362 transitions. [2019-09-08 06:35:47,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-08 06:35:47,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:35:47,776 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1] [2019-09-08 06:35:47,776 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:35:47,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:35:47,776 INFO L82 PathProgramCache]: Analyzing trace with hash 361004245, now seen corresponding path program 1 times [2019-09-08 06:35:47,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:35:47,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:35:47,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:47,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:35:47,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:47,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:35:47,858 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 06:35:47,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:35:47,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:35:47,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:35:47,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:35:47,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:35:47,860 INFO L87 Difference]: Start difference. First operand 3823 states and 5362 transitions. Second operand 3 states. [2019-09-08 06:35:48,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:35:48,195 INFO L93 Difference]: Finished difference Result 6439 states and 9086 transitions. [2019-09-08 06:35:48,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:35:48,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-09-08 06:35:48,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:35:48,259 INFO L225 Difference]: With dead ends: 6439 [2019-09-08 06:35:48,259 INFO L226 Difference]: Without dead ends: 3038 [2019-09-08 06:35:48,279 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 06:35:48,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3038 states. [2019-09-08 06:35:48,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3038 to 2961. [2019-09-08 06:35:48,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2961 states. [2019-09-08 06:35:48,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2961 states to 2961 states and 3768 transitions. [2019-09-08 06:35:48,444 INFO L78 Accepts]: Start accepts. Automaton has 2961 states and 3768 transitions. Word has length 188 [2019-09-08 06:35:48,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:35:48,444 INFO L475 AbstractCegarLoop]: Abstraction has 2961 states and 3768 transitions. [2019-09-08 06:35:48,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:35:48,444 INFO L276 IsEmpty]: Start isEmpty. Operand 2961 states and 3768 transitions. [2019-09-08 06:35:48,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-08 06:35:48,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:35:48,447 INFO L399 BasicCegarLoop]: trace histogram [2, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:35:48,447 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:35:48,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:35:48,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1209532997, now seen corresponding path program 1 times [2019-09-08 06:35:48,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:35:48,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:35:48,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:48,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:35:48,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:35:48,529 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 06:35:48,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:35:48,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:35:48,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:35:48,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:35:48,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:35:48,539 INFO L87 Difference]: Start difference. First operand 2961 states and 3768 transitions. Second operand 3 states. [2019-09-08 06:35:48,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:35:48,631 INFO L93 Difference]: Finished difference Result 3329 states and 4211 transitions. [2019-09-08 06:35:48,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:35:48,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-09-08 06:35:48,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:35:48,639 INFO L225 Difference]: With dead ends: 3329 [2019-09-08 06:35:48,639 INFO L226 Difference]: Without dead ends: 617 [2019-09-08 06:35:48,645 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 06:35:48,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-08 06:35:48,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 588. [2019-09-08 06:35:48,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-09-08 06:35:48,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 654 transitions. [2019-09-08 06:35:48,683 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 654 transitions. Word has length 186 [2019-09-08 06:35:48,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:35:48,683 INFO L475 AbstractCegarLoop]: Abstraction has 588 states and 654 transitions. [2019-09-08 06:35:48,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:35:48,683 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 654 transitions. [2019-09-08 06:35:48,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-08 06:35:48,685 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:35:48,685 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:35:48,685 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:35:48,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:35:48,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1457633071, now seen corresponding path program 1 times [2019-09-08 06:35:48,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:35:48,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:35:48,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:48,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:35:48,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:35:48,816 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 06:35:48,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:35:48,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 06:35:48,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 06:35:48,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 06:35:48,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:35:48,817 INFO L87 Difference]: Start difference. First operand 588 states and 654 transitions. Second operand 8 states. [2019-09-08 06:35:48,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:35:48,992 INFO L93 Difference]: Finished difference Result 590 states and 655 transitions. [2019-09-08 06:35:48,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 06:35:48,992 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 189 [2019-09-08 06:35:48,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:35:48,995 INFO L225 Difference]: With dead ends: 590 [2019-09-08 06:35:48,995 INFO L226 Difference]: Without dead ends: 587 [2019-09-08 06:35:48,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-09-08 06:35:48,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-09-08 06:35:49,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-09-08 06:35:49,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-09-08 06:35:49,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 652 transitions. [2019-09-08 06:35:49,046 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 652 transitions. Word has length 189 [2019-09-08 06:35:49,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:35:49,047 INFO L475 AbstractCegarLoop]: Abstraction has 587 states and 652 transitions. [2019-09-08 06:35:49,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 06:35:49,047 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 652 transitions. [2019-09-08 06:35:49,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-08 06:35:49,048 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:35:49,048 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 1, 1] [2019-09-08 06:35:49,048 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:35:49,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:35:49,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1641370518, now seen corresponding path program 1 times [2019-09-08 06:35:49,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:35:49,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:35:49,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:49,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:35:49,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:49,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:35:49,138 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 06:35:49,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:35:49,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:35:49,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:35:49,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:35:49,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:35:49,140 INFO L87 Difference]: Start difference. First operand 587 states and 652 transitions. Second operand 5 states. [2019-09-08 06:35:49,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:35:49,228 INFO L93 Difference]: Finished difference Result 665 states and 732 transitions. [2019-09-08 06:35:49,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:35:49,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 190 [2019-09-08 06:35:49,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:35:49,230 INFO L225 Difference]: With dead ends: 665 [2019-09-08 06:35:49,230 INFO L226 Difference]: Without dead ends: 579 [2019-09-08 06:35:49,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:35:49,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-09-08 06:35:49,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2019-09-08 06:35:49,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-09-08 06:35:49,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 641 transitions. [2019-09-08 06:35:49,265 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 641 transitions. Word has length 190 [2019-09-08 06:35:49,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:35:49,265 INFO L475 AbstractCegarLoop]: Abstraction has 579 states and 641 transitions. [2019-09-08 06:35:49,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:35:49,266 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 641 transitions. [2019-09-08 06:35:49,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-09-08 06:35:49,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:35:49,267 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 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, 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 06:35:49,267 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:35:49,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:35:49,268 INFO L82 PathProgramCache]: Analyzing trace with hash 57072559, now seen corresponding path program 1 times [2019-09-08 06:35:49,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:35:49,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:35:49,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:49,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:35:49,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:35:49,370 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-09-08 06:35:49,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:35:49,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:35:49,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:35:49,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:35:49,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:35:49,371 INFO L87 Difference]: Start difference. First operand 579 states and 641 transitions. Second operand 3 states. [2019-09-08 06:35:49,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:35:49,451 INFO L93 Difference]: Finished difference Result 1416 states and 1584 transitions. [2019-09-08 06:35:49,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:35:49,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 282 [2019-09-08 06:35:49,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:35:49,459 INFO L225 Difference]: With dead ends: 1416 [2019-09-08 06:35:49,460 INFO L226 Difference]: Without dead ends: 859 [2019-09-08 06:35:49,461 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 06:35:49,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2019-09-08 06:35:49,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 805. [2019-09-08 06:35:49,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2019-09-08 06:35:49,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 877 transitions. [2019-09-08 06:35:49,921 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 877 transitions. Word has length 282 [2019-09-08 06:35:49,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:35:49,921 INFO L475 AbstractCegarLoop]: Abstraction has 805 states and 877 transitions. [2019-09-08 06:35:49,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:35:49,921 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 877 transitions. [2019-09-08 06:35:49,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-08 06:35:49,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:35:49,924 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:35:49,924 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:35:49,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:35:49,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1045053333, now seen corresponding path program 1 times [2019-09-08 06:35:49,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:35:49,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:35:49,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:49,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:35:49,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:35:50,005 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-09-08 06:35:50,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:35:50,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:35:50,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:35:50,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:35:50,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:35:50,007 INFO L87 Difference]: Start difference. First operand 805 states and 877 transitions. Second operand 3 states. [2019-09-08 06:35:50,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:35:50,088 INFO L93 Difference]: Finished difference Result 1481 states and 1608 transitions. [2019-09-08 06:35:50,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:35:50,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2019-09-08 06:35:50,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:35:50,096 INFO L225 Difference]: With dead ends: 1481 [2019-09-08 06:35:50,097 INFO L226 Difference]: Without dead ends: 698 [2019-09-08 06:35:50,098 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 06:35:50,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2019-09-08 06:35:50,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2019-09-08 06:35:50,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2019-09-08 06:35:50,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 756 transitions. [2019-09-08 06:35:50,184 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 756 transitions. Word has length 261 [2019-09-08 06:35:50,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:35:50,184 INFO L475 AbstractCegarLoop]: Abstraction has 698 states and 756 transitions. [2019-09-08 06:35:50,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:35:50,185 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 756 transitions. [2019-09-08 06:35:50,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-09-08 06:35:50,187 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:35:50,188 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 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, 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 06:35:50,188 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:35:50,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:35:50,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1411237403, now seen corresponding path program 1 times [2019-09-08 06:35:50,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:35:50,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:35:50,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:50,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:35:50,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:35:50,306 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-09-08 06:35:50,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:35:50,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:35:50,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:35:50,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:35:50,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:35:50,308 INFO L87 Difference]: Start difference. First operand 698 states and 756 transitions. Second operand 3 states. [2019-09-08 06:35:50,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:35:50,386 INFO L93 Difference]: Finished difference Result 1036 states and 1117 transitions. [2019-09-08 06:35:50,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:35:50,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 283 [2019-09-08 06:35:50,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:35:50,390 INFO L225 Difference]: With dead ends: 1036 [2019-09-08 06:35:50,391 INFO L226 Difference]: Without dead ends: 589 [2019-09-08 06:35:50,392 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 06:35:50,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-09-08 06:35:50,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 414. [2019-09-08 06:35:50,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-09-08 06:35:50,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 436 transitions. [2019-09-08 06:35:50,440 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 436 transitions. Word has length 283 [2019-09-08 06:35:50,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:35:50,440 INFO L475 AbstractCegarLoop]: Abstraction has 414 states and 436 transitions. [2019-09-08 06:35:50,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:35:50,441 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 436 transitions. [2019-09-08 06:35:50,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-08 06:35:50,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:35:50,443 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:35:50,443 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:35:50,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:35:50,443 INFO L82 PathProgramCache]: Analyzing trace with hash -926086275, now seen corresponding path program 1 times [2019-09-08 06:35:50,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:35:50,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:35:50,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:50,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:35:50,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:35:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:35:51,070 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 26 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:35:51,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:35:51,070 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:35:51,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:35:51,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:35:51,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 1776 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-08 06:35:51,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:35:51,925 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 19 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:35:51,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:35:51,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23] total 46 [2019-09-08 06:35:51,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-08 06:35:51,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-08 06:35:51,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1924, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 06:35:51,932 INFO L87 Difference]: Start difference. First operand 414 states and 436 transitions. Second operand 46 states. [2019-09-08 06:35:58,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:35:58,308 INFO L93 Difference]: Finished difference Result 509 states and 548 transitions. [2019-09-08 06:35:58,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-08 06:35:58,308 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 255 [2019-09-08 06:35:58,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:35:58,311 INFO L225 Difference]: With dead ends: 509 [2019-09-08 06:35:58,311 INFO L226 Difference]: Without dead ends: 0 [2019-09-08 06:35:58,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1903 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=781, Invalid=6875, Unknown=0, NotChecked=0, Total=7656 [2019-09-08 06:35:58,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-08 06:35:58,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-08 06:35:58,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-08 06:35:58,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-08 06:35:58,317 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 255 [2019-09-08 06:35:58,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:35:58,317 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-08 06:35:58,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-08 06:35:58,317 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-08 06:35:58,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-08 06:35:58,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-08 06:36:03,157 WARN L188 SmtUtils]: Spent 541.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 06:36:06,750 WARN L188 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-08 06:36:10,128 WARN L188 SmtUtils]: Spent 559.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 06:36:13,008 WARN L188 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 36 [2019-09-08 06:36:15,476 WARN L188 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 38 [2019-09-08 06:36:17,869 WARN L188 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 06:36:20,511 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 362 DAG size of output: 97 [2019-09-08 06:36:20,986 WARN L188 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 362 DAG size of output: 97 [2019-09-08 06:36:24,118 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-08 06:36:26,611 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-08 06:36:29,096 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-09-08 06:36:30,641 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 362 DAG size of output: 97 [2019-09-08 06:36:31,928 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 06:36:35,214 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 60 [2019-09-08 06:36:37,595 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 60 [2019-09-08 06:36:40,123 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 47 [2019-09-08 06:36:42,511 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 47 [2019-09-08 06:36:44,694 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 406 DAG size of output: 170 [2019-09-08 06:36:44,915 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 55 [2019-09-08 06:36:49,735 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 93 [2019-09-08 06:36:52,120 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 258 DAG size of output: 74 [2019-09-08 06:37:01,296 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 362 DAG size of output: 97 [2019-09-08 06:37:09,641 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 362 DAG size of output: 97 [2019-09-08 06:37:11,466 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 60 [2019-09-08 06:37:14,071 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 60 [2019-09-08 06:37:36,641 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 362 DAG size of output: 97 [2019-09-08 06:37:39,124 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 404 DAG size of output: 131 [2019-09-08 06:37:54,683 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 60 [2019-09-08 06:37:57,324 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 60 [2019-09-08 06:38:01,385 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 406 DAG size of output: 165 [2019-09-08 06:38:05,378 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 60 [2019-09-08 06:38:13,697 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 60 [2019-09-08 06:38:16,488 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 60 [2019-09-08 06:38:23,931 WARN L188 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 201 DAG size of output: 127 [2019-09-08 06:38:25,588 WARN L188 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 234 DAG size of output: 143 [2019-09-08 06:38:26,751 WARN L188 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 201 DAG size of output: 127 [2019-09-08 06:38:35,836 WARN L188 SmtUtils]: Spent 9.02 s on a formula simplification. DAG size of input: 395 DAG size of output: 180 [2019-09-08 06:38:36,123 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 104 [2019-09-08 06:38:37,879 WARN L188 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 260 DAG size of output: 143 [2019-09-08 06:38:39,057 WARN L188 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 197 DAG size of output: 122 [2019-09-08 06:38:40,777 WARN L188 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 221 DAG size of output: 136 [2019-09-08 06:38:40,945 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-08 06:38:42,789 WARN L188 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 253 DAG size of output: 139 [2019-09-08 06:38:45,813 WARN L188 SmtUtils]: Spent 2.98 s on a formula simplification. DAG size of input: 323 DAG size of output: 131 [2019-09-08 06:38:47,503 WARN L188 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 241 DAG size of output: 144 [2019-09-08 06:38:57,000 WARN L188 SmtUtils]: Spent 9.45 s on a formula simplification. DAG size of input: 377 DAG size of output: 186 [2019-09-08 06:38:58,150 WARN L188 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 202 DAG size of output: 128 [2019-09-08 06:39:01,478 WARN L188 SmtUtils]: Spent 3.30 s on a formula simplification. DAG size of input: 332 DAG size of output: 148 [2019-09-08 06:39:02,601 WARN L188 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 201 DAG size of output: 127 [2019-09-08 06:39:03,601 WARN L188 SmtUtils]: Spent 989.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 103 [2019-09-08 06:39:06,952 WARN L188 SmtUtils]: Spent 3.32 s on a formula simplification. DAG size of input: 332 DAG size of output: 148 [2019-09-08 06:39:07,234 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 104 [2019-09-08 06:39:08,113 WARN L188 SmtUtils]: Spent 877.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 113 [2019-09-08 06:39:08,978 WARN L188 SmtUtils]: Spent 862.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 113 [2019-09-08 06:39:14,483 WARN L188 SmtUtils]: Spent 5.48 s on a formula simplification. DAG size of input: 406 DAG size of output: 161 [2019-09-08 06:39:15,931 WARN L188 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 223 DAG size of output: 131 [2019-09-08 06:39:17,007 WARN L188 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 156 DAG size of output: 103 [2019-09-08 06:39:21,556 WARN L188 SmtUtils]: Spent 4.52 s on a formula simplification. DAG size of input: 363 DAG size of output: 155 [2019-09-08 06:39:22,717 WARN L188 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 206 DAG size of output: 130 [2019-09-08 06:39:28,116 WARN L188 SmtUtils]: Spent 5.37 s on a formula simplification. DAG size of input: 360 DAG size of output: 164 [2019-09-08 06:39:33,621 WARN L188 SmtUtils]: Spent 5.48 s on a formula simplification. DAG size of input: 356 DAG size of output: 159 [2019-09-08 06:39:34,506 WARN L188 SmtUtils]: Spent 882.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 113 [2019-09-08 06:39:37,799 WARN L188 SmtUtils]: Spent 3.26 s on a formula simplification. DAG size of input: 332 DAG size of output: 148 [2019-09-08 06:39:40,593 WARN L188 SmtUtils]: Spent 2.78 s on a formula simplification. DAG size of input: 318 DAG size of output: 147 [2019-09-08 06:39:41,806 WARN L188 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 208 DAG size of output: 133 [2019-09-08 06:39:45,120 WARN L188 SmtUtils]: Spent 3.29 s on a formula simplification. DAG size of input: 323 DAG size of output: 140 [2019-09-08 06:39:45,396 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 109 [2019-09-08 06:39:47,425 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 253 DAG size of output: 173 [2019-09-08 06:39:47,713 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 104 [2019-09-08 06:39:47,928 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 88 [2019-09-08 06:39:51,220 WARN L188 SmtUtils]: Spent 3.27 s on a formula simplification. DAG size of input: 331 DAG size of output: 148 [2019-09-08 06:40:04,475 WARN L188 SmtUtils]: Spent 13.24 s on a formula simplification. DAG size of input: 398 DAG size of output: 211 [2019-09-08 06:40:05,072 WARN L188 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 74 [2019-09-08 06:40:05,949 WARN L188 SmtUtils]: Spent 875.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 113 [2019-09-08 06:40:08,439 WARN L188 SmtUtils]: Spent 2.47 s on a formula simplification. DAG size of input: 326 DAG size of output: 135 [2019-09-08 06:40:10,072 WARN L188 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 225 DAG size of output: 138 [2019-09-08 06:40:11,212 WARN L188 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 206 DAG size of output: 130 [2019-09-08 06:40:12,374 WARN L188 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 203 DAG size of output: 128 [2019-09-08 06:40:16,133 WARN L188 SmtUtils]: Spent 3.73 s on a formula simplification. DAG size of input: 355 DAG size of output: 155 [2019-09-08 06:40:17,307 WARN L188 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 208 DAG size of output: 133 [2019-09-08 06:40:21,047 WARN L188 SmtUtils]: Spent 3.71 s on a formula simplification. DAG size of input: 355 DAG size of output: 155 [2019-09-08 06:40:22,406 WARN L188 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 229 DAG size of output: 131 [2019-09-08 06:40:23,288 WARN L188 SmtUtils]: Spent 880.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 113 [2019-09-08 06:40:24,580 WARN L188 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 226 DAG size of output: 134