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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:31:55,667 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:31:55,669 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:31:55,689 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:31:55,689 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:31:55,691 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:31:55,693 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:31:55,706 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:31:55,708 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:31:55,709 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:31:55,710 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:31:55,711 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:31:55,711 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:31:55,712 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:31:55,713 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:31:55,715 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:31:55,715 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:31:55,717 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:31:55,722 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:31:55,724 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:31:55,728 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:31:55,729 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:31:55,730 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:31:55,731 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:31:55,735 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:31:55,735 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:31:55,736 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:31:55,738 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:31:55,739 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:31:55,741 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:31:55,741 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:31:55,744 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:31:55,745 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:31:55,745 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:31:55,749 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:31:55,749 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:31:55,750 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:31:55,750 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:31:55,751 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:31:55,751 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:31:55,752 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:31:55,753 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 11:31:55,779 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:31:55,779 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:31:55,781 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:31:55,782 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:31:55,782 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:31:55,782 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:31:55,782 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:31:55,783 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:31:55,783 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:31:55,783 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:31:55,784 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:31:55,784 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:31:55,785 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:31:55,785 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:31:55,785 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:31:55,785 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:31:55,786 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:31:55,786 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:31:55,786 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:31:55,786 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:31:55,787 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:31:55,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:31:55,787 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:31:55,787 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:31:55,788 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:31:55,788 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:31:55,788 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:31:55,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:31:55,789 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:31:55,837 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:31:55,850 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:31:55,853 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:31:55,855 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:31:55,855 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:31:55,856 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 11:31:55,919 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cac28106/efc3a08293444f35a93bffe3374f6014/FLAG502218169 [2019-09-08 11:31:56,353 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:31:56,354 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 11:31:56,375 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cac28106/efc3a08293444f35a93bffe3374f6014/FLAG502218169 [2019-09-08 11:31:56,742 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cac28106/efc3a08293444f35a93bffe3374f6014 [2019-09-08 11:31:56,755 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:31:56,756 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:31:56,757 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:31:56,757 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:31:56,760 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:31:56,761 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:31:56" (1/1) ... [2019-09-08 11:31:56,764 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b46dfdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:31:56, skipping insertion in model container [2019-09-08 11:31:56,764 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:31:56" (1/1) ... [2019-09-08 11:31:56,772 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:31:56,838 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:31:57,127 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:31:57,230 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:31:57,306 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:31:57,330 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:31:57,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:31:57 WrapperNode [2019-09-08 11:31:57,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:31:57,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:31:57,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:31:57,332 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:31:57,343 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:31:57" (1/1) ... [2019-09-08 11:31:57,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:31:57" (1/1) ... [2019-09-08 11:31:57,352 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:31:57" (1/1) ... [2019-09-08 11:31:57,353 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:31:57" (1/1) ... [2019-09-08 11:31:57,366 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:31:57" (1/1) ... [2019-09-08 11:31:57,374 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:31:57" (1/1) ... [2019-09-08 11:31:57,377 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:31:57" (1/1) ... [2019-09-08 11:31:57,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:31:57,382 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:31:57,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:31:57,382 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:31:57,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:31:57" (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 11:31:57,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:31:57,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:31:57,431 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:31:57,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:31:57,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:31:57,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:31:57,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 11:31:57,432 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:31:57,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:31:57,432 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:31:57,432 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:31:57,433 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:31:57,433 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:31:57,433 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:31:57,433 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:31:57,433 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:31:57,434 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:31:57,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:31:57,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:31:58,074 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:31:58,075 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:31:58,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:31:58 BoogieIcfgContainer [2019-09-08 11:31:58,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:31:58,077 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:31:58,077 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:31:58,080 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:31:58,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:31:56" (1/3) ... [2019-09-08 11:31:58,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ec14a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:31:58, skipping insertion in model container [2019-09-08 11:31:58,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:31:57" (2/3) ... [2019-09-08 11:31:58,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ec14a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:31:58, skipping insertion in model container [2019-09-08 11:31:58,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:31:58" (3/3) ... [2019-09-08 11:31:58,084 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 11:31:58,094 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:31:58,102 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-09-08 11:31:58,119 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-09-08 11:31:58,151 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:31:58,152 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:31:58,152 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:31:58,152 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:31:58,153 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:31:58,153 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:31:58,153 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:31:58,153 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:31:58,153 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:31:58,175 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2019-09-08 11:31:58,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-08 11:31:58,183 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:31:58,184 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 11:31:58,187 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:31:58,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:31:58,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1559662222, now seen corresponding path program 1 times [2019-09-08 11:31:58,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:31:58,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:31:58,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:31:58,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:31:58,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:31:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:31:58,528 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 11:31:58,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:31:58,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:31:58,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:31:58,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:31:58,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:31:58,553 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 3 states. [2019-09-08 11:31:58,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:31:58,701 INFO L93 Difference]: Finished difference Result 213 states and 340 transitions. [2019-09-08 11:31:58,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:31:58,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-09-08 11:31:58,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:31:58,717 INFO L225 Difference]: With dead ends: 213 [2019-09-08 11:31:58,717 INFO L226 Difference]: Without dead ends: 158 [2019-09-08 11:31:58,721 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 11:31:58,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-09-08 11:31:58,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2019-09-08 11:31:58,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-09-08 11:31:58,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 219 transitions. [2019-09-08 11:31:58,783 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 219 transitions. Word has length 51 [2019-09-08 11:31:58,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:31:58,784 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 219 transitions. [2019-09-08 11:31:58,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:31:58,804 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 219 transitions. [2019-09-08 11:31:58,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-08 11:31:58,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:31:58,806 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] [2019-09-08 11:31:58,807 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:31:58,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:31:58,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1275879745, now seen corresponding path program 1 times [2019-09-08 11:31:58,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:31:58,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:31:58,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:31:58,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:31:58,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:31:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:31:58,930 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 11:31:58,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:31:58,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:31:58,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:31:58,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:31:58,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:31:58,933 INFO L87 Difference]: Start difference. First operand 156 states and 219 transitions. Second operand 3 states. [2019-09-08 11:31:59,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:31:59,040 INFO L93 Difference]: Finished difference Result 284 states and 414 transitions. [2019-09-08 11:31:59,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:31:59,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-09-08 11:31:59,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:31:59,045 INFO L225 Difference]: With dead ends: 284 [2019-09-08 11:31:59,045 INFO L226 Difference]: Without dead ends: 201 [2019-09-08 11:31:59,047 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 11:31:59,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-09-08 11:31:59,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2019-09-08 11:31:59,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-08 11:31:59,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 284 transitions. [2019-09-08 11:31:59,069 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 284 transitions. Word has length 52 [2019-09-08 11:31:59,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:31:59,070 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 284 transitions. [2019-09-08 11:31:59,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:31:59,070 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 284 transitions. [2019-09-08 11:31:59,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-08 11:31:59,072 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:31:59,072 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] [2019-09-08 11:31:59,072 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:31:59,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:31:59,073 INFO L82 PathProgramCache]: Analyzing trace with hash 920769505, now seen corresponding path program 1 times [2019-09-08 11:31:59,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:31:59,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:31:59,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:31:59,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:31:59,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:31:59,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:31:59,194 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 11:31:59,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:31:59,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:31:59,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:31:59,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:31:59,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:31:59,197 INFO L87 Difference]: Start difference. First operand 199 states and 284 transitions. Second operand 5 states. [2019-09-08 11:31:59,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:31:59,444 INFO L93 Difference]: Finished difference Result 521 states and 766 transitions. [2019-09-08 11:31:59,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:31:59,444 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-09-08 11:31:59,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:31:59,448 INFO L225 Difference]: With dead ends: 521 [2019-09-08 11:31:59,448 INFO L226 Difference]: Without dead ends: 348 [2019-09-08 11:31:59,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:31:59,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-09-08 11:31:59,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 343. [2019-09-08 11:31:59,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-09-08 11:31:59,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 502 transitions. [2019-09-08 11:31:59,488 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 502 transitions. Word has length 53 [2019-09-08 11:31:59,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:31:59,489 INFO L475 AbstractCegarLoop]: Abstraction has 343 states and 502 transitions. [2019-09-08 11:31:59,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:31:59,489 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 502 transitions. [2019-09-08 11:31:59,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-08 11:31:59,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:31:59,491 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] [2019-09-08 11:31:59,491 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:31:59,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:31:59,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1424755381, now seen corresponding path program 1 times [2019-09-08 11:31:59,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:31:59,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:31:59,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:31:59,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:31:59,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:31:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:31:59,582 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 11:31:59,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:31:59,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:31:59,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:31:59,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:31:59,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:31:59,584 INFO L87 Difference]: Start difference. First operand 343 states and 502 transitions. Second operand 5 states. [2019-09-08 11:31:59,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:31:59,750 INFO L93 Difference]: Finished difference Result 652 states and 968 transitions. [2019-09-08 11:31:59,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:31:59,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-09-08 11:31:59,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:31:59,756 INFO L225 Difference]: With dead ends: 652 [2019-09-08 11:31:59,756 INFO L226 Difference]: Without dead ends: 343 [2019-09-08 11:31:59,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:31:59,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-09-08 11:31:59,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2019-09-08 11:31:59,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-09-08 11:31:59,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 495 transitions. [2019-09-08 11:31:59,801 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 495 transitions. Word has length 54 [2019-09-08 11:31:59,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:31:59,802 INFO L475 AbstractCegarLoop]: Abstraction has 343 states and 495 transitions. [2019-09-08 11:31:59,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:31:59,802 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 495 transitions. [2019-09-08 11:31:59,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 11:31:59,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:31:59,814 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] [2019-09-08 11:31:59,814 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:31:59,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:31:59,815 INFO L82 PathProgramCache]: Analyzing trace with hash 710908993, now seen corresponding path program 1 times [2019-09-08 11:31:59,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:31:59,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:31:59,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:31:59,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:31:59,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:31:59,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:31:59,957 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 11:31:59,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:31:59,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:31:59,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:31:59,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:31:59,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:31:59,959 INFO L87 Difference]: Start difference. First operand 343 states and 495 transitions. Second operand 5 states. [2019-09-08 11:32:00,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:32:00,092 INFO L93 Difference]: Finished difference Result 656 states and 959 transitions. [2019-09-08 11:32:00,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:32:00,093 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-09-08 11:32:00,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:32:00,097 INFO L225 Difference]: With dead ends: 656 [2019-09-08 11:32:00,097 INFO L226 Difference]: Without dead ends: 343 [2019-09-08 11:32:00,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:32:00,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-09-08 11:32:00,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2019-09-08 11:32:00,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-09-08 11:32:00,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 488 transitions. [2019-09-08 11:32:00,124 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 488 transitions. Word has length 55 [2019-09-08 11:32:00,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:32:00,124 INFO L475 AbstractCegarLoop]: Abstraction has 343 states and 488 transitions. [2019-09-08 11:32:00,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:32:00,125 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 488 transitions. [2019-09-08 11:32:00,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 11:32:00,126 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:32:00,126 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] [2019-09-08 11:32:00,126 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:32:00,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:32:00,127 INFO L82 PathProgramCache]: Analyzing trace with hash 885426054, now seen corresponding path program 1 times [2019-09-08 11:32:00,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:32:00,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:32:00,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:00,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:32:00,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:00,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:32:00,255 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 11:32:00,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:32:00,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:32:00,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:32:00,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:32:00,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:32:00,257 INFO L87 Difference]: Start difference. First operand 343 states and 488 transitions. Second operand 5 states. [2019-09-08 11:32:00,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:32:00,391 INFO L93 Difference]: Finished difference Result 1152 states and 1681 transitions. [2019-09-08 11:32:00,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:32:00,391 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-09-08 11:32:00,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:32:00,397 INFO L225 Difference]: With dead ends: 1152 [2019-09-08 11:32:00,397 INFO L226 Difference]: Without dead ends: 912 [2019-09-08 11:32:00,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:32:00,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2019-09-08 11:32:00,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 520. [2019-09-08 11:32:00,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2019-09-08 11:32:00,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 751 transitions. [2019-09-08 11:32:00,440 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 751 transitions. Word has length 56 [2019-09-08 11:32:00,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:32:00,440 INFO L475 AbstractCegarLoop]: Abstraction has 520 states and 751 transitions. [2019-09-08 11:32:00,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:32:00,441 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 751 transitions. [2019-09-08 11:32:00,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 11:32:00,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:32:00,442 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] [2019-09-08 11:32:00,442 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:32:00,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:32:00,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1174705316, now seen corresponding path program 1 times [2019-09-08 11:32:00,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:32:00,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:32:00,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:00,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:32:00,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:32:00,544 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 11:32:00,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:32:00,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:32:00,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:32:00,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:32:00,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:32:00,546 INFO L87 Difference]: Start difference. First operand 520 states and 751 transitions. Second operand 5 states. [2019-09-08 11:32:00,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:32:00,727 INFO L93 Difference]: Finished difference Result 1282 states and 1874 transitions. [2019-09-08 11:32:00,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:32:00,729 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-09-08 11:32:00,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:32:00,735 INFO L225 Difference]: With dead ends: 1282 [2019-09-08 11:32:00,735 INFO L226 Difference]: Without dead ends: 1042 [2019-09-08 11:32:00,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:32:00,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2019-09-08 11:32:00,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 780. [2019-09-08 11:32:00,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-09-08 11:32:00,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1134 transitions. [2019-09-08 11:32:00,800 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1134 transitions. Word has length 56 [2019-09-08 11:32:00,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:32:00,802 INFO L475 AbstractCegarLoop]: Abstraction has 780 states and 1134 transitions. [2019-09-08 11:32:00,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:32:00,802 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1134 transitions. [2019-09-08 11:32:00,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 11:32:00,803 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:32:00,803 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] [2019-09-08 11:32:00,804 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:32:00,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:32:00,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1012396963, now seen corresponding path program 1 times [2019-09-08 11:32:00,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:32:00,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:32:00,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:00,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:32:00,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:00,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:32:00,885 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 11:32:00,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:32:00,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:32:00,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:32:00,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:32:00,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:32:00,887 INFO L87 Difference]: Start difference. First operand 780 states and 1134 transitions. Second operand 5 states. [2019-09-08 11:32:01,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:32:01,079 INFO L93 Difference]: Finished difference Result 1483 states and 2172 transitions. [2019-09-08 11:32:01,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:32:01,080 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-09-08 11:32:01,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:32:01,087 INFO L225 Difference]: With dead ends: 1483 [2019-09-08 11:32:01,087 INFO L226 Difference]: Without dead ends: 1243 [2019-09-08 11:32:01,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:32:01,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2019-09-08 11:32:01,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 961. [2019-09-08 11:32:01,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 961 states. [2019-09-08 11:32:01,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1402 transitions. [2019-09-08 11:32:01,196 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1402 transitions. Word has length 56 [2019-09-08 11:32:01,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:32:01,196 INFO L475 AbstractCegarLoop]: Abstraction has 961 states and 1402 transitions. [2019-09-08 11:32:01,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:32:01,197 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1402 transitions. [2019-09-08 11:32:01,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 11:32:01,197 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:32:01,198 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] [2019-09-08 11:32:01,198 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:32:01,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:32:01,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1507412779, now seen corresponding path program 1 times [2019-09-08 11:32:01,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:32:01,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:32:01,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:01,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:32:01,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:01,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:32:01,413 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 11:32:01,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:32:01,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:32:01,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:32:01,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:32:01,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:32:01,415 INFO L87 Difference]: Start difference. First operand 961 states and 1402 transitions. Second operand 10 states. [2019-09-08 11:32:02,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:32:02,478 INFO L93 Difference]: Finished difference Result 2737 states and 4008 transitions. [2019-09-08 11:32:02,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 11:32:02,479 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2019-09-08 11:32:02,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:32:02,488 INFO L225 Difference]: With dead ends: 2737 [2019-09-08 11:32:02,489 INFO L226 Difference]: Without dead ends: 1869 [2019-09-08 11:32:02,491 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2019-09-08 11:32:02,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869 states. [2019-09-08 11:32:02,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869 to 961. [2019-09-08 11:32:02,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 961 states. [2019-09-08 11:32:02,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1399 transitions. [2019-09-08 11:32:02,586 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1399 transitions. Word has length 57 [2019-09-08 11:32:02,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:32:02,587 INFO L475 AbstractCegarLoop]: Abstraction has 961 states and 1399 transitions. [2019-09-08 11:32:02,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:32:02,587 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1399 transitions. [2019-09-08 11:32:02,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 11:32:02,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:32:02,588 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] [2019-09-08 11:32:02,588 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:32:02,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:32:02,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1490525900, now seen corresponding path program 1 times [2019-09-08 11:32:02,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:32:02,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:32:02,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:02,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:32:02,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:02,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:32:02,773 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 11:32:02,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:32:02,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:32:02,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:32:02,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:32:02,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:32:02,776 INFO L87 Difference]: Start difference. First operand 961 states and 1399 transitions. Second operand 9 states. [2019-09-08 11:32:03,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:32:03,423 INFO L93 Difference]: Finished difference Result 2670 states and 3929 transitions. [2019-09-08 11:32:03,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 11:32:03,424 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-09-08 11:32:03,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:32:03,437 INFO L225 Difference]: With dead ends: 2670 [2019-09-08 11:32:03,437 INFO L226 Difference]: Without dead ends: 1814 [2019-09-08 11:32:03,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-09-08 11:32:03,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1814 states. [2019-09-08 11:32:03,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1814 to 961. [2019-09-08 11:32:03,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 961 states. [2019-09-08 11:32:03,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1398 transitions. [2019-09-08 11:32:03,602 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1398 transitions. Word has length 57 [2019-09-08 11:32:03,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:32:03,603 INFO L475 AbstractCegarLoop]: Abstraction has 961 states and 1398 transitions. [2019-09-08 11:32:03,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:32:03,603 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1398 transitions. [2019-09-08 11:32:03,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 11:32:03,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:32:03,604 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] [2019-09-08 11:32:03,604 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:32:03,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:32:03,605 INFO L82 PathProgramCache]: Analyzing trace with hash 640170611, now seen corresponding path program 1 times [2019-09-08 11:32:03,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:32:03,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:32:03,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:03,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:32:03,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:03,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:32:03,783 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 11:32:03,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:32:03,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:32:03,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:32:03,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:32:03,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:32:03,784 INFO L87 Difference]: Start difference. First operand 961 states and 1398 transitions. Second operand 10 states. [2019-09-08 11:32:04,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:32:04,714 INFO L93 Difference]: Finished difference Result 2722 states and 3982 transitions. [2019-09-08 11:32:04,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 11:32:04,715 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-09-08 11:32:04,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:32:04,725 INFO L225 Difference]: With dead ends: 2722 [2019-09-08 11:32:04,725 INFO L226 Difference]: Without dead ends: 1869 [2019-09-08 11:32:04,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-08 11:32:04,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869 states. [2019-09-08 11:32:04,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869 to 961. [2019-09-08 11:32:04,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 961 states. [2019-09-08 11:32:04,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1392 transitions. [2019-09-08 11:32:04,840 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1392 transitions. Word has length 58 [2019-09-08 11:32:04,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:32:04,840 INFO L475 AbstractCegarLoop]: Abstraction has 961 states and 1392 transitions. [2019-09-08 11:32:04,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:32:04,841 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1392 transitions. [2019-09-08 11:32:04,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 11:32:04,841 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:32:04,842 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] [2019-09-08 11:32:04,842 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:32:04,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:32:04,842 INFO L82 PathProgramCache]: Analyzing trace with hash 783431871, now seen corresponding path program 1 times [2019-09-08 11:32:04,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:32:04,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:32:04,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:04,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:32:04,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:32:05,521 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 11:32:05,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:32:05,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 11:32:05,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 11:32:05,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 11:32:05,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:32:05,523 INFO L87 Difference]: Start difference. First operand 961 states and 1392 transitions. Second operand 21 states. [2019-09-08 11:32:05,696 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-08 11:32:06,447 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-08 11:32:06,608 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-08 11:32:06,859 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2019-09-08 11:32:07,154 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-08 11:32:09,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:32:09,916 INFO L93 Difference]: Finished difference Result 4934 states and 7276 transitions. [2019-09-08 11:32:09,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 11:32:09,917 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 59 [2019-09-08 11:32:09,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:32:09,937 INFO L225 Difference]: With dead ends: 4934 [2019-09-08 11:32:09,938 INFO L226 Difference]: Without dead ends: 4515 [2019-09-08 11:32:09,941 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=316, Invalid=1490, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 11:32:09,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4515 states. [2019-09-08 11:32:10,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4515 to 966. [2019-09-08 11:32:10,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2019-09-08 11:32:10,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1397 transitions. [2019-09-08 11:32:10,146 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1397 transitions. Word has length 59 [2019-09-08 11:32:10,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:32:10,146 INFO L475 AbstractCegarLoop]: Abstraction has 966 states and 1397 transitions. [2019-09-08 11:32:10,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 11:32:10,147 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1397 transitions. [2019-09-08 11:32:10,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 11:32:10,147 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:32:10,148 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] [2019-09-08 11:32:10,148 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:32:10,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:32:10,148 INFO L82 PathProgramCache]: Analyzing trace with hash 125988192, now seen corresponding path program 1 times [2019-09-08 11:32:10,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:32:10,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:32:10,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:10,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:32:10,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:10,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:32:10,659 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 11:32:10,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:32:10,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 11:32:10,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 11:32:10,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 11:32:10,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:32:10,661 INFO L87 Difference]: Start difference. First operand 966 states and 1397 transitions. Second operand 21 states. [2019-09-08 11:32:11,317 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-08 11:32:11,492 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-08 11:32:11,686 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-08 11:32:11,928 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2019-09-08 11:32:12,100 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-08 11:32:12,252 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-08 11:32:12,407 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-08 11:32:15,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:32:15,098 INFO L93 Difference]: Finished difference Result 4710 states and 6948 transitions. [2019-09-08 11:32:15,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 11:32:15,098 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 59 [2019-09-08 11:32:15,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:32:15,114 INFO L225 Difference]: With dead ends: 4710 [2019-09-08 11:32:15,115 INFO L226 Difference]: Without dead ends: 4297 [2019-09-08 11:32:15,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=331, Invalid=1475, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 11:32:15,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4297 states. [2019-09-08 11:32:15,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4297 to 966. [2019-09-08 11:32:15,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2019-09-08 11:32:15,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1396 transitions. [2019-09-08 11:32:15,318 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1396 transitions. Word has length 59 [2019-09-08 11:32:15,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:32:15,318 INFO L475 AbstractCegarLoop]: Abstraction has 966 states and 1396 transitions. [2019-09-08 11:32:15,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 11:32:15,318 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1396 transitions. [2019-09-08 11:32:15,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 11:32:15,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:32:15,319 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:32:15,320 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:32:15,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:32:15,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1854553764, now seen corresponding path program 1 times [2019-09-08 11:32:15,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:32:15,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:32:15,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:15,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:32:15,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:15,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:32:16,033 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 11:32:16,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:32:16,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 11:32:16,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 11:32:16,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 11:32:16,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-08 11:32:16,034 INFO L87 Difference]: Start difference. First operand 966 states and 1396 transitions. Second operand 17 states. [2019-09-08 11:32:16,651 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-09-08 11:32:16,884 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2019-09-08 11:32:17,033 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-08 11:32:17,190 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-08 11:32:17,401 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-08 11:32:17,729 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-08 11:32:18,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:32:18,900 INFO L93 Difference]: Finished difference Result 3248 states and 4781 transitions. [2019-09-08 11:32:18,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 11:32:18,900 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2019-09-08 11:32:18,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:32:18,911 INFO L225 Difference]: With dead ends: 3248 [2019-09-08 11:32:18,911 INFO L226 Difference]: Without dead ends: 2819 [2019-09-08 11:32:18,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=248, Invalid=808, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 11:32:18,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2819 states. [2019-09-08 11:32:19,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2819 to 961. [2019-09-08 11:32:19,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 961 states. [2019-09-08 11:32:19,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1387 transitions. [2019-09-08 11:32:19,141 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1387 transitions. Word has length 59 [2019-09-08 11:32:19,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:32:19,142 INFO L475 AbstractCegarLoop]: Abstraction has 961 states and 1387 transitions. [2019-09-08 11:32:19,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 11:32:19,142 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1387 transitions. [2019-09-08 11:32:19,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 11:32:19,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:32:19,143 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] [2019-09-08 11:32:19,143 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:32:19,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:32:19,143 INFO L82 PathProgramCache]: Analyzing trace with hash -573041072, now seen corresponding path program 1 times [2019-09-08 11:32:19,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:32:19,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:32:19,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:19,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:32:19,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:32:19,716 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 11:32:19,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:32:19,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 11:32:19,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 11:32:19,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 11:32:19,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-09-08 11:32:19,717 INFO L87 Difference]: Start difference. First operand 961 states and 1387 transitions. Second operand 14 states. [2019-09-08 11:32:20,185 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2019-09-08 11:32:20,366 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-09-08 11:32:20,560 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-09-08 11:32:20,701 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-08 11:32:21,023 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2019-09-08 11:32:21,379 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 45 [2019-09-08 11:32:21,875 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-08 11:32:22,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:32:22,337 INFO L93 Difference]: Finished difference Result 3431 states and 5057 transitions. [2019-09-08 11:32:22,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:32:22,338 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-09-08 11:32:22,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:32:22,349 INFO L225 Difference]: With dead ends: 3431 [2019-09-08 11:32:22,349 INFO L226 Difference]: Without dead ends: 2996 [2019-09-08 11:32:22,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=203, Invalid=667, Unknown=0, NotChecked=0, Total=870 [2019-09-08 11:32:22,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2996 states. [2019-09-08 11:32:22,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2996 to 933. [2019-09-08 11:32:22,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2019-09-08 11:32:22,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1351 transitions. [2019-09-08 11:32:22,581 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1351 transitions. Word has length 60 [2019-09-08 11:32:22,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:32:22,582 INFO L475 AbstractCegarLoop]: Abstraction has 933 states and 1351 transitions. [2019-09-08 11:32:22,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 11:32:22,582 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1351 transitions. [2019-09-08 11:32:22,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 11:32:22,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:32:22,582 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] [2019-09-08 11:32:22,583 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:32:22,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:32:22,583 INFO L82 PathProgramCache]: Analyzing trace with hash -2089882996, now seen corresponding path program 1 times [2019-09-08 11:32:22,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:32:22,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:32:22,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:22,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:32:22,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:22,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:32:23,441 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 11:32:23,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:32:23,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 11:32:23,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 11:32:23,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 11:32:23,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2019-09-08 11:32:23,443 INFO L87 Difference]: Start difference. First operand 933 states and 1351 transitions. Second operand 19 states. [2019-09-08 11:32:24,193 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-08 11:32:24,397 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-08 11:32:24,831 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-08 11:32:25,053 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-08 11:32:27,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:32:27,200 INFO L93 Difference]: Finished difference Result 4842 states and 7161 transitions. [2019-09-08 11:32:27,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 11:32:27,200 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2019-09-08 11:32:27,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:32:27,215 INFO L225 Difference]: With dead ends: 4842 [2019-09-08 11:32:27,216 INFO L226 Difference]: Without dead ends: 4417 [2019-09-08 11:32:27,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=299, Invalid=1261, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 11:32:27,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4417 states. [2019-09-08 11:32:27,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4417 to 921. [2019-09-08 11:32:27,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2019-09-08 11:32:27,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1334 transitions. [2019-09-08 11:32:27,447 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1334 transitions. Word has length 60 [2019-09-08 11:32:27,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:32:27,447 INFO L475 AbstractCegarLoop]: Abstraction has 921 states and 1334 transitions. [2019-09-08 11:32:27,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 11:32:27,447 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1334 transitions. [2019-09-08 11:32:27,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 11:32:27,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:32:27,457 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] [2019-09-08 11:32:27,457 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:32:27,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:32:27,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1529221616, now seen corresponding path program 1 times [2019-09-08 11:32:27,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:32:27,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:32:27,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:27,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:32:27,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:32:28,575 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 11:32:28,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:32:28,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-08 11:32:28,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 11:32:28,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 11:32:28,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:32:28,576 INFO L87 Difference]: Start difference. First operand 921 states and 1334 transitions. Second operand 20 states. [2019-09-08 11:32:29,184 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-09-08 11:32:29,328 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-08 11:32:29,497 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-08 11:32:29,764 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-09-08 11:32:29,936 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-08 11:32:30,112 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-08 11:32:30,391 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-08 11:32:30,600 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-08 11:32:30,857 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-08 11:32:31,044 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-08 11:32:31,225 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-08 11:32:32,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:32:32,961 INFO L93 Difference]: Finished difference Result 3783 states and 5586 transitions. [2019-09-08 11:32:32,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 11:32:32,961 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2019-09-08 11:32:32,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:32:32,968 INFO L225 Difference]: With dead ends: 3783 [2019-09-08 11:32:32,968 INFO L226 Difference]: Without dead ends: 3370 [2019-09-08 11:32:32,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=334, Invalid=1306, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 11:32:32,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3370 states. [2019-09-08 11:32:33,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3370 to 921. [2019-09-08 11:32:33,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2019-09-08 11:32:33,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1333 transitions. [2019-09-08 11:32:33,159 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1333 transitions. Word has length 60 [2019-09-08 11:32:33,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:32:33,159 INFO L475 AbstractCegarLoop]: Abstraction has 921 states and 1333 transitions. [2019-09-08 11:32:33,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 11:32:33,159 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1333 transitions. [2019-09-08 11:32:33,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 11:32:33,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:32:33,160 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] [2019-09-08 11:32:33,160 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:32:33,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:32:33,161 INFO L82 PathProgramCache]: Analyzing trace with hash 464532363, now seen corresponding path program 1 times [2019-09-08 11:32:33,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:32:33,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:32:33,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:33,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:32:33,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:33,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:32:33,586 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 11:32:33,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:32:33,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 11:32:33,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 11:32:33,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 11:32:33,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 11:32:33,589 INFO L87 Difference]: Start difference. First operand 921 states and 1333 transitions. Second operand 13 states. [2019-09-08 11:32:33,968 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 37 [2019-09-08 11:32:34,124 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-09-08 11:32:34,284 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-09-08 11:32:34,586 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2019-09-08 11:32:34,808 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-09-08 11:32:35,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:32:35,778 INFO L93 Difference]: Finished difference Result 3811 states and 5632 transitions. [2019-09-08 11:32:35,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:32:35,779 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-09-08 11:32:35,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:32:35,786 INFO L225 Difference]: With dead ends: 3811 [2019-09-08 11:32:35,786 INFO L226 Difference]: Without dead ends: 3398 [2019-09-08 11:32:35,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:32:35,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2019-09-08 11:32:36,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 910. [2019-09-08 11:32:36,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2019-09-08 11:32:36,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1319 transitions. [2019-09-08 11:32:36,111 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1319 transitions. Word has length 60 [2019-09-08 11:32:36,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:32:36,111 INFO L475 AbstractCegarLoop]: Abstraction has 910 states and 1319 transitions. [2019-09-08 11:32:36,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 11:32:36,112 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1319 transitions. [2019-09-08 11:32:36,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 11:32:36,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:32:36,112 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] [2019-09-08 11:32:36,112 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:32:36,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:32:36,113 INFO L82 PathProgramCache]: Analyzing trace with hash -22477888, now seen corresponding path program 1 times [2019-09-08 11:32:36,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:32:36,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:32:36,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:36,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:32:36,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:36,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:32:36,984 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 11:32:36,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:32:36,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 11:32:36,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 11:32:36,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 11:32:36,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-09-08 11:32:36,986 INFO L87 Difference]: Start difference. First operand 910 states and 1319 transitions. Second operand 17 states. [2019-09-08 11:32:37,947 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-08 11:32:38,092 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-08 11:32:38,235 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-08 11:32:38,493 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-08 11:32:38,635 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-08 11:32:40,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:32:40,342 INFO L93 Difference]: Finished difference Result 2976 states and 4393 transitions. [2019-09-08 11:32:40,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 11:32:40,343 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2019-09-08 11:32:40,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:32:40,348 INFO L225 Difference]: With dead ends: 2976 [2019-09-08 11:32:40,348 INFO L226 Difference]: Without dead ends: 2553 [2019-09-08 11:32:40,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=315, Invalid=945, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 11:32:40,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2553 states. [2019-09-08 11:32:40,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2553 to 891. [2019-09-08 11:32:40,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2019-09-08 11:32:40,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1299 transitions. [2019-09-08 11:32:40,809 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1299 transitions. Word has length 61 [2019-09-08 11:32:40,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:32:40,810 INFO L475 AbstractCegarLoop]: Abstraction has 891 states and 1299 transitions. [2019-09-08 11:32:40,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 11:32:40,810 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1299 transitions. [2019-09-08 11:32:40,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 11:32:40,812 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:32:40,812 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 11:32:40,812 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:32:40,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:32:40,813 INFO L82 PathProgramCache]: Analyzing trace with hash 161317224, now seen corresponding path program 1 times [2019-09-08 11:32:40,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:32:40,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:32:40,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:40,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:32:40,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:32:40,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 11:32:40,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:32:40,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:32:40,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:32:40,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:32:40,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:32:40,881 INFO L87 Difference]: Start difference. First operand 891 states and 1299 transitions. Second operand 3 states. [2019-09-08 11:32:41,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:32:41,585 INFO L93 Difference]: Finished difference Result 2395 states and 3525 transitions. [2019-09-08 11:32:41,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:32:41,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-08 11:32:41,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:32:41,591 INFO L225 Difference]: With dead ends: 2395 [2019-09-08 11:32:41,591 INFO L226 Difference]: Without dead ends: 1581 [2019-09-08 11:32:41,594 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 11:32:41,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2019-09-08 11:32:42,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1559. [2019-09-08 11:32:42,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1559 states. [2019-09-08 11:32:42,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2239 transitions. [2019-09-08 11:32:42,163 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2239 transitions. Word has length 79 [2019-09-08 11:32:42,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:32:42,163 INFO L475 AbstractCegarLoop]: Abstraction has 1559 states and 2239 transitions. [2019-09-08 11:32:42,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:32:42,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2239 transitions. [2019-09-08 11:32:42,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 11:32:42,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:32:42,165 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] [2019-09-08 11:32:42,165 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:32:42,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:32:42,166 INFO L82 PathProgramCache]: Analyzing trace with hash 954765304, now seen corresponding path program 1 times [2019-09-08 11:32:42,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:32:42,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:32:42,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:42,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:32:42,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:42,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:32:42,211 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 11:32:42,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:32:42,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:32:42,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:32:42,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:32:42,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:32:42,213 INFO L87 Difference]: Start difference. First operand 1559 states and 2239 transitions. Second operand 3 states. [2019-09-08 11:32:42,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:32:42,783 INFO L93 Difference]: Finished difference Result 3541 states and 5124 transitions. [2019-09-08 11:32:42,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:32:42,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-08 11:32:42,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:32:42,788 INFO L225 Difference]: With dead ends: 3541 [2019-09-08 11:32:42,788 INFO L226 Difference]: Without dead ends: 2059 [2019-09-08 11:32:42,791 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 11:32:42,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2059 states. [2019-09-08 11:32:43,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2059 to 2035. [2019-09-08 11:32:43,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2035 states. [2019-09-08 11:32:43,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 2906 transitions. [2019-09-08 11:32:43,954 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 2906 transitions. Word has length 80 [2019-09-08 11:32:43,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:32:43,955 INFO L475 AbstractCegarLoop]: Abstraction has 2035 states and 2906 transitions. [2019-09-08 11:32:43,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:32:43,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 2906 transitions. [2019-09-08 11:32:43,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 11:32:43,957 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:32:43,957 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] [2019-09-08 11:32:43,957 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:32:43,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:32:43,958 INFO L82 PathProgramCache]: Analyzing trace with hash 271546837, now seen corresponding path program 1 times [2019-09-08 11:32:43,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:32:43,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:32:43,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:43,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:32:43,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:32:44,034 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 11:32:44,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:32:44,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:32:44,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:32:44,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:32:44,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:32:44,036 INFO L87 Difference]: Start difference. First operand 2035 states and 2906 transitions. Second operand 6 states. [2019-09-08 11:32:45,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:32:45,043 INFO L93 Difference]: Finished difference Result 3457 states and 4898 transitions. [2019-09-08 11:32:45,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:32:45,045 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-09-08 11:32:45,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:32:45,050 INFO L225 Difference]: With dead ends: 3457 [2019-09-08 11:32:45,050 INFO L226 Difference]: Without dead ends: 3455 [2019-09-08 11:32:45,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:32:45,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3455 states. [2019-09-08 11:32:45,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3455 to 2059. [2019-09-08 11:32:45,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2059 states. [2019-09-08 11:32:45,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2059 states to 2059 states and 2920 transitions. [2019-09-08 11:32:45,670 INFO L78 Accepts]: Start accepts. Automaton has 2059 states and 2920 transitions. Word has length 80 [2019-09-08 11:32:45,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:32:45,670 INFO L475 AbstractCegarLoop]: Abstraction has 2059 states and 2920 transitions. [2019-09-08 11:32:45,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:32:45,670 INFO L276 IsEmpty]: Start isEmpty. Operand 2059 states and 2920 transitions. [2019-09-08 11:32:45,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 11:32:45,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:32:45,672 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] [2019-09-08 11:32:45,672 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:32:45,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:32:45,672 INFO L82 PathProgramCache]: Analyzing trace with hash -109706295, now seen corresponding path program 1 times [2019-09-08 11:32:45,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:32:45,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:32:45,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:45,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:32:45,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:32:45,740 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 11:32:45,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:32:45,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:32:45,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:32:45,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:32:45,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:32:45,742 INFO L87 Difference]: Start difference. First operand 2059 states and 2920 transitions. Second operand 3 states. [2019-09-08 11:32:46,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:32:46,814 INFO L93 Difference]: Finished difference Result 5783 states and 8176 transitions. [2019-09-08 11:32:46,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:32:46,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-08 11:32:46,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:32:46,820 INFO L225 Difference]: With dead ends: 5783 [2019-09-08 11:32:46,820 INFO L226 Difference]: Without dead ends: 3801 [2019-09-08 11:32:46,825 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 11:32:46,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3801 states. [2019-09-08 11:32:47,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3801 to 3559. [2019-09-08 11:32:47,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3559 states. [2019-09-08 11:32:47,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3559 states to 3559 states and 4977 transitions. [2019-09-08 11:32:47,807 INFO L78 Accepts]: Start accepts. Automaton has 3559 states and 4977 transitions. Word has length 81 [2019-09-08 11:32:47,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:32:47,807 INFO L475 AbstractCegarLoop]: Abstraction has 3559 states and 4977 transitions. [2019-09-08 11:32:47,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:32:47,808 INFO L276 IsEmpty]: Start isEmpty. Operand 3559 states and 4977 transitions. [2019-09-08 11:32:47,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 11:32:47,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:32:47,809 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] [2019-09-08 11:32:47,809 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:32:47,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:32:47,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1521581427, now seen corresponding path program 1 times [2019-09-08 11:32:47,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:32:47,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:32:47,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:47,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:32:47,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:32:47,850 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 11:32:47,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:32:47,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:32:47,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:32:47,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:32:47,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:32:47,851 INFO L87 Difference]: Start difference. First operand 3559 states and 4977 transitions. Second operand 3 states. [2019-09-08 11:32:49,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:32:49,146 INFO L93 Difference]: Finished difference Result 7979 states and 11125 transitions. [2019-09-08 11:32:49,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:32:49,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-08 11:32:49,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:32:49,150 INFO L225 Difference]: With dead ends: 7979 [2019-09-08 11:32:49,150 INFO L226 Difference]: Without dead ends: 4497 [2019-09-08 11:32:49,156 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 11:32:49,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4497 states. [2019-09-08 11:32:50,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4497 to 4191. [2019-09-08 11:32:50,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4191 states. [2019-09-08 11:32:50,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4191 states to 4191 states and 5735 transitions. [2019-09-08 11:32:50,298 INFO L78 Accepts]: Start accepts. Automaton has 4191 states and 5735 transitions. Word has length 82 [2019-09-08 11:32:50,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:32:50,298 INFO L475 AbstractCegarLoop]: Abstraction has 4191 states and 5735 transitions. [2019-09-08 11:32:50,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:32:50,298 INFO L276 IsEmpty]: Start isEmpty. Operand 4191 states and 5735 transitions. [2019-09-08 11:32:50,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 11:32:50,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:32:50,299 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] [2019-09-08 11:32:50,299 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:32:50,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:32:50,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1799551662, now seen corresponding path program 1 times [2019-09-08 11:32:50,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:32:50,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:32:50,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:50,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:32:50,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:50,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:32:50,371 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 11:32:50,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:32:50,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:32:50,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:32:50,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:32:50,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:32:50,373 INFO L87 Difference]: Start difference. First operand 4191 states and 5735 transitions. Second operand 7 states. [2019-09-08 11:32:53,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:32:53,566 INFO L93 Difference]: Finished difference Result 13667 states and 18585 transitions. [2019-09-08 11:32:53,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:32:53,567 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-09-08 11:32:53,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:32:53,579 INFO L225 Difference]: With dead ends: 13667 [2019-09-08 11:32:53,580 INFO L226 Difference]: Without dead ends: 9553 [2019-09-08 11:32:53,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:32:53,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9553 states. [2019-09-08 11:32:54,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9553 to 4875. [2019-09-08 11:32:54,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4875 states. [2019-09-08 11:32:54,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4875 states to 4875 states and 6685 transitions. [2019-09-08 11:32:54,944 INFO L78 Accepts]: Start accepts. Automaton has 4875 states and 6685 transitions. Word has length 82 [2019-09-08 11:32:54,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:32:54,944 INFO L475 AbstractCegarLoop]: Abstraction has 4875 states and 6685 transitions. [2019-09-08 11:32:54,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:32:54,945 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 6685 transitions. [2019-09-08 11:32:54,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 11:32:54,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:32:54,949 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] [2019-09-08 11:32:54,949 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:32:54,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:32:54,949 INFO L82 PathProgramCache]: Analyzing trace with hash -74285142, now seen corresponding path program 1 times [2019-09-08 11:32:54,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:32:54,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:32:54,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:54,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:32:54,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:32:54,999 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:32:54,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:32:54,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:32:55,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:32:55,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:32:55,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:32:55,000 INFO L87 Difference]: Start difference. First operand 4875 states and 6685 transitions. Second operand 3 states. [2019-09-08 11:32:57,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:32:57,592 INFO L93 Difference]: Finished difference Result 13747 states and 18719 transitions. [2019-09-08 11:32:57,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:32:57,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-09-08 11:32:57,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:32:57,603 INFO L225 Difference]: With dead ends: 13747 [2019-09-08 11:32:57,603 INFO L226 Difference]: Without dead ends: 8949 [2019-09-08 11:32:57,609 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 11:32:57,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8949 states. [2019-09-08 11:32:59,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8949 to 7995. [2019-09-08 11:32:59,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7995 states. [2019-09-08 11:32:59,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7995 states to 7995 states and 10725 transitions. [2019-09-08 11:32:59,911 INFO L78 Accepts]: Start accepts. Automaton has 7995 states and 10725 transitions. Word has length 103 [2019-09-08 11:32:59,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:32:59,912 INFO L475 AbstractCegarLoop]: Abstraction has 7995 states and 10725 transitions. [2019-09-08 11:32:59,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:32:59,912 INFO L276 IsEmpty]: Start isEmpty. Operand 7995 states and 10725 transitions. [2019-09-08 11:32:59,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 11:32:59,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:32:59,914 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 11:32:59,914 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:32:59,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:32:59,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1887526267, now seen corresponding path program 1 times [2019-09-08 11:32:59,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:32:59,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:32:59,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:59,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:32:59,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:33:00,137 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:33:00,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:33:00,138 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 11:33:00,153 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 11:33:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:33:00,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-08 11:33:00,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:33:00,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:33:01,053 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-09-08 11:33:01,142 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:33:01,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:33:01,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2019-09-08 11:33:01,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 11:33:01,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 11:33:01,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:33:01,160 INFO L87 Difference]: Start difference. First operand 7995 states and 10725 transitions. Second operand 20 states. [2019-09-08 11:33:03,293 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-08 11:33:04,837 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-08 11:33:06,899 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-08 11:33:07,192 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-08 11:33:07,731 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-08 11:33:07,912 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-08 11:33:08,090 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-08 11:33:08,559 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-08 11:33:08,752 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-08 11:33:09,067 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-08 11:33:09,639 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-08 11:33:09,903 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-08 11:33:10,549 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-08 11:33:10,809 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-08 11:33:11,146 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 11:33:11,388 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-08 11:33:11,572 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-08 11:33:11,765 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 11:33:11,939 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-08 11:33:12,611 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-08 11:33:12,856 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-08 11:33:15,039 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-08 11:33:15,747 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-08 11:33:15,930 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-08 11:33:16,625 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-08 11:33:17,056 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-08 11:33:17,389 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-08 11:33:19,065 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-08 11:33:19,942 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-08 11:33:20,215 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-08 11:33:20,517 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-08 11:33:20,721 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 11:33:21,540 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-08 11:33:22,102 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-08 11:33:22,681 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-09-08 11:33:22,925 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-09-08 11:33:23,206 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-08 11:33:23,549 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-08 11:33:23,923 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-08 11:33:24,125 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-08 11:33:24,940 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-08 11:33:25,387 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-08 11:33:25,687 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-08 11:33:26,098 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-08 11:33:26,294 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-08 11:33:26,769 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-08 11:33:26,982 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-08 11:33:27,161 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-08 11:33:27,370 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-08 11:33:27,740 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-08 11:33:27,930 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-08 11:33:28,116 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-08 11:33:28,372 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-08 11:33:29,208 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-08 11:33:29,591 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-08 11:33:30,275 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-08 11:33:30,568 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-08 11:33:31,061 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-08 11:33:31,288 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-09-08 11:33:31,515 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-09-08 11:33:31,762 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-08 11:33:32,189 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-08 11:33:32,534 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-08 11:33:32,938 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-08 11:33:33,294 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-08 11:33:33,831 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-08 11:33:34,568 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-08 11:33:34,909 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-08 11:33:35,208 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-08 11:33:35,538 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-08 11:33:36,020 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-09-08 11:33:36,210 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-09-08 11:33:36,524 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-08 11:33:36,969 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-08 11:33:37,238 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-08 11:33:37,453 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-08 11:33:37,681 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-08 11:33:37,964 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 11:33:38,161 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-08 11:33:38,443 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 11:33:38,623 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 11:33:38,799 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-08 11:33:39,169 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 11:33:39,551 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-08 11:33:40,036 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-08 11:33:40,350 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-08 11:33:40,582 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-08 11:33:40,921 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-08 11:33:41,120 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-08 11:33:41,361 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-08 11:33:41,761 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-08 11:33:42,003 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-08 11:33:42,236 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-08 11:33:42,601 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-08 11:33:42,781 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-08 11:33:43,072 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-08 11:33:43,406 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-08 11:33:43,641 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-08 11:33:43,895 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-08 11:33:44,067 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-08 11:33:44,343 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 11:33:44,612 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-08 11:33:44,795 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-08 11:33:45,139 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-08 11:33:45,345 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-08 11:33:45,552 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-08 11:33:45,943 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-08 11:33:46,312 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-08 11:33:46,485 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-08 11:33:46,797 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 11:33:48,131 WARN L188 SmtUtils]: Spent 797.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-08 11:33:48,370 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-08 11:33:50,104 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-08 11:33:51,138 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-08 11:33:51,801 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-08 11:33:52,205 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-08 11:33:53,647 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-08 11:33:54,278 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-08 11:33:54,995 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-09-08 11:33:55,502 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-08 11:33:55,897 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-08 11:33:56,325 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-08 11:33:56,673 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-08 11:33:56,962 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-09-08 11:33:57,394 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-08 11:33:58,969 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-08 11:33:59,170 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-08 11:33:59,376 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-08 11:33:59,658 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-09-08 11:34:00,028 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-09-08 11:34:00,986 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-08 11:34:03,906 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-08 11:34:04,512 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-08 11:34:04,727 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-08 11:34:04,935 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-08 11:34:05,603 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-08 11:34:07,263 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-08 11:34:08,124 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-08 11:34:52,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:34:52,214 INFO L93 Difference]: Finished difference Result 140959 states and 184084 transitions. [2019-09-08 11:34:52,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2019-09-08 11:34:52,215 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 104 [2019-09-08 11:34:52,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:34:52,817 INFO L225 Difference]: With dead ends: 140959 [2019-09-08 11:34:52,817 INFO L226 Difference]: Without dead ends: 133041 [2019-09-08 11:34:52,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28591 ImplicationChecksByTransitivity, 49.6s TimeCoverageRelationStatistics Valid=9270, Invalid=59109, Unknown=3, NotChecked=0, Total=68382 [2019-09-08 11:34:53,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133041 states. [2019-09-08 11:35:09,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133041 to 29848. [2019-09-08 11:35:09,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29848 states. [2019-09-08 11:35:09,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29848 states to 29848 states and 39643 transitions. [2019-09-08 11:35:09,600 INFO L78 Accepts]: Start accepts. Automaton has 29848 states and 39643 transitions. Word has length 104 [2019-09-08 11:35:09,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:35:09,601 INFO L475 AbstractCegarLoop]: Abstraction has 29848 states and 39643 transitions. [2019-09-08 11:35:09,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 11:35:09,601 INFO L276 IsEmpty]: Start isEmpty. Operand 29848 states and 39643 transitions. [2019-09-08 11:35:09,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 11:35:09,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:35:09,606 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] [2019-09-08 11:35:09,607 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:35:09,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:35:09,607 INFO L82 PathProgramCache]: Analyzing trace with hash -2056347745, now seen corresponding path program 1 times [2019-09-08 11:35:09,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:35:09,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:35:09,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:35:09,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:35:09,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:35:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:35:09,671 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:35:09,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:35:09,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:35:09,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:35:09,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:35:09,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:35:09,674 INFO L87 Difference]: Start difference. First operand 29848 states and 39643 transitions. Second operand 3 states. [2019-09-08 11:35:20,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:35:20,574 INFO L93 Difference]: Finished difference Result 55292 states and 72866 transitions. [2019-09-08 11:35:20,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:35:20,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-08 11:35:20,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:35:20,656 INFO L225 Difference]: With dead ends: 55292 [2019-09-08 11:35:20,656 INFO L226 Difference]: Without dead ends: 25533 [2019-09-08 11:35:20,697 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 11:35:20,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25533 states. [2019-09-08 11:35:32,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25533 to 25461. [2019-09-08 11:35:32,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25461 states. [2019-09-08 11:35:32,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25461 states to 25461 states and 32539 transitions. [2019-09-08 11:35:32,152 INFO L78 Accepts]: Start accepts. Automaton has 25461 states and 32539 transitions. Word has length 104 [2019-09-08 11:35:32,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:35:32,152 INFO L475 AbstractCegarLoop]: Abstraction has 25461 states and 32539 transitions. [2019-09-08 11:35:32,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:35:32,153 INFO L276 IsEmpty]: Start isEmpty. Operand 25461 states and 32539 transitions. [2019-09-08 11:35:32,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 11:35:32,157 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:35:32,157 INFO L399 BasicCegarLoop]: trace histogram [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 11:35:32,157 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:35:32,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:35:32,158 INFO L82 PathProgramCache]: Analyzing trace with hash -2017194729, now seen corresponding path program 1 times [2019-09-08 11:35:32,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:35:32,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:35:32,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:35:32,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:35:32,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:35:32,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:35:32,516 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:35:32,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:35:32,517 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:35:32,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:35:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:35:32,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 11:35:32,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:35:32,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:35:32,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:35:33,162 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:35:33,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:35:33,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-09-08 11:35:33,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 11:35:33,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 11:35:33,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:35:33,236 INFO L87 Difference]: Start difference. First operand 25461 states and 32539 transitions. Second operand 20 states. [2019-09-08 11:35:33,372 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-08 11:35:33,761 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-09-08 11:35:34,066 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-08 11:35:34,311 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-08 11:35:34,817 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 11:35:35,009 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-08 11:35:35,372 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 11:35:35,539 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-08 11:35:35,913 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 11:35:36,412 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 11:35:36,759 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 11:35:36,969 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 11:35:37,347 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 11:35:38,005 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 11:35:38,345 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 11:35:38,598 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 11:35:39,040 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 11:35:39,398 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-08 11:35:39,758 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-08 11:35:40,369 WARN L188 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-08 11:35:40,864 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 11:35:41,239 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-08 11:35:41,784 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-08 11:35:48,677 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-08 11:35:48,993 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-08 11:35:50,550 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 11:35:51,587 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 11:35:51,942 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 11:35:52,166 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-08 11:35:53,024 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 11:35:53,229 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-08 11:35:53,521 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-08 11:35:53,957 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-08 11:35:54,250 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-08 11:35:55,488 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-08 11:36:15,572 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 11:36:17,247 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-08 11:36:53,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:36:53,345 INFO L93 Difference]: Finished difference Result 155537 states and 196761 transitions. [2019-09-08 11:36:53,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-08 11:36:53,345 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 105 [2019-09-08 11:36:53,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:36:53,526 INFO L225 Difference]: With dead ends: 155537 [2019-09-08 11:36:53,527 INFO L226 Difference]: Without dead ends: 130165 [2019-09-08 11:36:53,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=929, Invalid=2493, Unknown=0, NotChecked=0, Total=3422 [2019-09-08 11:36:53,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130165 states. [2019-09-08 11:37:24,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130165 to 61925. [2019-09-08 11:37:24,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61925 states. [2019-09-08 11:37:24,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61925 states to 61925 states and 79011 transitions. [2019-09-08 11:37:24,524 INFO L78 Accepts]: Start accepts. Automaton has 61925 states and 79011 transitions. Word has length 105 [2019-09-08 11:37:24,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:37:24,524 INFO L475 AbstractCegarLoop]: Abstraction has 61925 states and 79011 transitions. [2019-09-08 11:37:24,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 11:37:24,524 INFO L276 IsEmpty]: Start isEmpty. Operand 61925 states and 79011 transitions. [2019-09-08 11:37:24,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 11:37:24,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:37:24,532 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 11:37:24,533 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:37:24,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:37:24,533 INFO L82 PathProgramCache]: Analyzing trace with hash -530573863, now seen corresponding path program 1 times [2019-09-08 11:37:24,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:37:24,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:37:24,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:37:24,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:37:24,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:37:24,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:37:24,819 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:37:24,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:37:24,819 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 11:37:24,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:37:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:37:24,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 11:37:24,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:37:25,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:37:25,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:37:25,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:37:25,314 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 11:37:25,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:37:25,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2019-09-08 11:37:25,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 11:37:25,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 11:37:25,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:37:25,331 INFO L87 Difference]: Start difference. First operand 61925 states and 79011 transitions. Second operand 20 states. [2019-09-08 11:37:31,708 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 38 [2019-09-08 11:37:31,942 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 34 [2019-09-08 11:37:32,458 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 41 [2019-09-08 11:37:32,970 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2019-09-08 11:37:34,287 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 37 [2019-09-08 11:37:53,364 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2019-09-08 11:39:33,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:39:33,507 INFO L93 Difference]: Finished difference Result 262781 states and 334803 transitions. [2019-09-08 11:39:33,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-08 11:39:33,507 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 106 [2019-09-08 11:39:33,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:39:33,847 INFO L225 Difference]: With dead ends: 262781 [2019-09-08 11:39:33,847 INFO L226 Difference]: Without dead ends: 234345 [2019-09-08 11:39:33,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2724 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=1799, Invalid=7321, Unknown=0, NotChecked=0, Total=9120 [2019-09-08 11:39:34,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234345 states. [2019-09-08 11:40:24,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234345 to 94931. [2019-09-08 11:40:24,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94931 states. [2019-09-08 11:40:24,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94931 states to 94931 states and 120683 transitions. [2019-09-08 11:40:24,861 INFO L78 Accepts]: Start accepts. Automaton has 94931 states and 120683 transitions. Word has length 106 [2019-09-08 11:40:24,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:40:24,862 INFO L475 AbstractCegarLoop]: Abstraction has 94931 states and 120683 transitions. [2019-09-08 11:40:24,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 11:40:24,862 INFO L276 IsEmpty]: Start isEmpty. Operand 94931 states and 120683 transitions. [2019-09-08 11:40:24,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 11:40:24,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:40:24,869 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] [2019-09-08 11:40:24,869 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:40:24,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:40:24,869 INFO L82 PathProgramCache]: Analyzing trace with hash 795611084, now seen corresponding path program 1 times [2019-09-08 11:40:24,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:40:24,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:40:24,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:40:24,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:40:24,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:40:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:40:24,928 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:40:24,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:40:24,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:40:24,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:40:24,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:40:24,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:40:24,929 INFO L87 Difference]: Start difference. First operand 94931 states and 120683 transitions. Second operand 3 states. [2019-09-08 11:40:52,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:40:52,339 INFO L93 Difference]: Finished difference Result 146835 states and 186595 transitions. [2019-09-08 11:40:52,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:40:52,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-08 11:40:52,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:40:52,390 INFO L225 Difference]: With dead ends: 146835 [2019-09-08 11:40:52,390 INFO L226 Difference]: Without dead ends: 52027 [2019-09-08 11:40:52,439 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 11:40:52,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52027 states. [2019-09-08 11:41:20,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52027 to 52025. [2019-09-08 11:41:20,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52025 states. [2019-09-08 11:41:21,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52025 states to 52025 states and 65141 transitions. [2019-09-08 11:41:21,052 INFO L78 Accepts]: Start accepts. Automaton has 52025 states and 65141 transitions. Word has length 106 [2019-09-08 11:41:21,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:41:21,053 INFO L475 AbstractCegarLoop]: Abstraction has 52025 states and 65141 transitions. [2019-09-08 11:41:21,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:41:21,053 INFO L276 IsEmpty]: Start isEmpty. Operand 52025 states and 65141 transitions. [2019-09-08 11:41:21,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 11:41:21,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:41:21,057 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 11:41:21,057 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:41:21,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:41:21,058 INFO L82 PathProgramCache]: Analyzing trace with hash -839839732, now seen corresponding path program 1 times [2019-09-08 11:41:21,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:41:21,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:41:21,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:41:21,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:41:21,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:41:21,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:41:21,582 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:41:21,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:41:21,583 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 11:41:21,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:41:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:41:21,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-08 11:41:21,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:41:22,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:41:22,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:41:22,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:41:22,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:41:22,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:41:22,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:41:22,760 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 29 [2019-09-08 11:41:22,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:41:22,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:41:23,149 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 11:41:23,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 11:41:23,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [19] total 36 [2019-09-08 11:41:23,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 11:41:23,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 11:41:23,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1121, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 11:41:23,154 INFO L87 Difference]: Start difference. First operand 52025 states and 65141 transitions. Second operand 36 states. [2019-09-08 11:41:24,263 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-08 11:41:24,709 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-08 11:42:33,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:42:33,368 INFO L93 Difference]: Finished difference Result 165681 states and 207862 transitions. [2019-09-08 11:42:33,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-08 11:42:33,369 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 106 [2019-09-08 11:42:33,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:42:33,495 INFO L225 Difference]: With dead ends: 165681 [2019-09-08 11:42:33,495 INFO L226 Difference]: Without dead ends: 123259 [2019-09-08 11:42:33,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1503 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=726, Invalid=4824, Unknown=0, NotChecked=0, Total=5550 [2019-09-08 11:42:33,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123259 states. [2019-09-08 11:43:10,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123259 to 66651. [2019-09-08 11:43:10,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66651 states. [2019-09-08 11:43:10,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66651 states to 66651 states and 83484 transitions. [2019-09-08 11:43:10,967 INFO L78 Accepts]: Start accepts. Automaton has 66651 states and 83484 transitions. Word has length 106 [2019-09-08 11:43:10,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:43:10,967 INFO L475 AbstractCegarLoop]: Abstraction has 66651 states and 83484 transitions. [2019-09-08 11:43:10,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 11:43:10,967 INFO L276 IsEmpty]: Start isEmpty. Operand 66651 states and 83484 transitions. [2019-09-08 11:43:10,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 11:43:10,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:43:10,972 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 11:43:10,972 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:43:10,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:43:10,972 INFO L82 PathProgramCache]: Analyzing trace with hash 2059640868, now seen corresponding path program 1 times [2019-09-08 11:43:10,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:43:10,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:43:10,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:43:10,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:43:10,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:43:10,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:43:11,204 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:43:11,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:43:11,204 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) [2019-09-08 11:43:11,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:43:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:43:11,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 11:43:11,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:43:11,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:43:11,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:43:11,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:43:11,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:43:11,700 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 11:43:11,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:43:11,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 21 [2019-09-08 11:43:11,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 11:43:11,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 11:43:11,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:43:11,716 INFO L87 Difference]: Start difference. First operand 66651 states and 83484 transitions. Second operand 21 states. [2019-09-08 11:45:06,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:45:06,086 INFO L93 Difference]: Finished difference Result 211299 states and 261978 transitions. [2019-09-08 11:45:06,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-08 11:45:06,086 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 106 [2019-09-08 11:45:06,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:45:06,307 INFO L225 Difference]: With dead ends: 211299 [2019-09-08 11:45:06,307 INFO L226 Difference]: Without dead ends: 189883 [2019-09-08 11:45:06,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2508 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1496, Invalid=6694, Unknown=0, NotChecked=0, Total=8190 [2019-09-08 11:45:06,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189883 states.