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.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:57:53,723 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:57:53,725 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:57:53,736 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:57:53,737 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:57:53,738 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:57:53,739 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:57:53,741 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:57:53,743 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:57:53,743 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:57:53,744 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:57:53,745 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:57:53,746 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:57:53,747 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:57:53,748 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:57:53,749 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:57:53,749 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:57:53,750 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:57:53,752 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:57:53,754 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:57:53,755 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:57:53,756 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:57:53,757 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:57:53,758 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:57:53,760 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:57:53,761 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:57:53,761 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:57:53,762 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:57:53,762 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:57:53,763 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:57:53,763 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:57:53,764 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:57:53,765 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:57:53,765 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:57:53,766 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:57:53,767 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:57:53,767 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:57:53,767 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:57:53,768 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:57:53,769 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:57:53,769 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:57:53,770 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:57:53,784 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:57:53,784 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:57:53,785 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:57:53,786 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:57:53,786 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:57:53,786 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:57:53,786 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:57:53,786 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:57:53,787 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:57:53,787 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:57:53,787 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:57:53,787 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:57:53,787 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:57:53,788 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:57:53,788 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:57:53,788 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:57:53,788 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:57:53,789 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:57:53,789 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:57:53,789 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:57:53,789 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:57:53,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:57:53,789 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:57:53,790 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:57:53,790 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:57:53,791 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:57:53,791 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:57:53,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:57:53,791 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:57:53,822 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:57:53,834 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:57:53,838 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:57:53,839 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:57:53,840 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:57:53,841 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-08 11:57:53,913 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f59e75831/731569030d7e4963b78c6f42f4a09ce3/FLAG6befd096a [2019-09-08 11:57:54,504 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:57:54,505 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-08 11:57:54,522 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f59e75831/731569030d7e4963b78c6f42f4a09ce3/FLAG6befd096a [2019-09-08 11:57:54,830 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f59e75831/731569030d7e4963b78c6f42f4a09ce3 [2019-09-08 11:57:54,840 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:57:54,842 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:57:54,843 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:57:54,843 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:57:54,846 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:57:54,847 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:57:54" (1/1) ... [2019-09-08 11:57:54,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48607f5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:57:54, skipping insertion in model container [2019-09-08 11:57:54,850 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:57:54" (1/1) ... [2019-09-08 11:57:54,858 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:57:54,904 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:57:55,276 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:57:55,290 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:57:55,350 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:57:55,372 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:57:55,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:57:55 WrapperNode [2019-09-08 11:57:55,373 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:57:55,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:57:55,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:57:55,374 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:57:55,385 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:57:55" (1/1) ... [2019-09-08 11:57:55,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:57:55" (1/1) ... [2019-09-08 11:57:55,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:57:55" (1/1) ... [2019-09-08 11:57:55,399 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:57:55" (1/1) ... [2019-09-08 11:57:55,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:57:55" (1/1) ... [2019-09-08 11:57:55,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:57:55" (1/1) ... [2019-09-08 11:57:55,447 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:57:55" (1/1) ... [2019-09-08 11:57:55,451 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:57:55,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:57:55,452 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:57:55,452 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:57:55,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:57:55" (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:57:55,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:57:55,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:57:55,503 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:57:55,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:57:55,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:57:55,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:57:55,505 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:57:55,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:57:55,505 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:57:55,506 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:57:55,506 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:57:55,506 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:57:55,507 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:57:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:57:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 11:57:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:57:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:57:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:57:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:57:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:57:56,156 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:57:56,157 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:57:56,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:57:56 BoogieIcfgContainer [2019-09-08 11:57:56,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:57:56,159 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:57:56,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:57:56,162 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:57:56,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:57:54" (1/3) ... [2019-09-08 11:57:56,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32be72f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:57:56, skipping insertion in model container [2019-09-08 11:57:56,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:57:55" (2/3) ... [2019-09-08 11:57:56,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32be72f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:57:56, skipping insertion in model container [2019-09-08 11:57:56,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:57:56" (3/3) ... [2019-09-08 11:57:56,166 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-08 11:57:56,177 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:57:56,191 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 11:57:56,206 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 11:57:56,245 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:57:56,246 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:57:56,246 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:57:56,246 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:57:56,247 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:57:56,247 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:57:56,247 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:57:56,247 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:57:56,247 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:57:56,269 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states. [2019-09-08 11:57:56,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 11:57:56,279 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:57:56,280 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:57:56,281 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:57:56,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:57:56,287 INFO L82 PathProgramCache]: Analyzing trace with hash -896938852, now seen corresponding path program 1 times [2019-09-08 11:57:56,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:57:56,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:57:56,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:56,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:57:56,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:57:56,743 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:57:56,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:57:56,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:57:56,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:57:56,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:57:56,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:57:56,770 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 3 states. [2019-09-08 11:57:56,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:57:56,853 INFO L93 Difference]: Finished difference Result 222 states and 357 transitions. [2019-09-08 11:57:56,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:57:56,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-09-08 11:57:56,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:57:56,905 INFO L225 Difference]: With dead ends: 222 [2019-09-08 11:57:56,905 INFO L226 Difference]: Without dead ends: 150 [2019-09-08 11:57:56,910 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:57:56,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-08 11:57:56,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2019-09-08 11:57:56,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-08 11:57:56,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 213 transitions. [2019-09-08 11:57:56,970 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 213 transitions. Word has length 63 [2019-09-08 11:57:56,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:57:56,971 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 213 transitions. [2019-09-08 11:57:56,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:57:56,971 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 213 transitions. [2019-09-08 11:57:56,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-08 11:57:56,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:57:56,974 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] [2019-09-08 11:57:56,974 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:57:56,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:57:56,975 INFO L82 PathProgramCache]: Analyzing trace with hash -196255440, now seen corresponding path program 1 times [2019-09-08 11:57:56,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:57:56,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:57:56,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:56,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:57:56,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:57:57,096 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:57:57,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:57:57,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:57:57,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:57:57,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:57:57,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:57:57,101 INFO L87 Difference]: Start difference. First operand 148 states and 213 transitions. Second operand 3 states. [2019-09-08 11:57:57,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:57:57,179 INFO L93 Difference]: Finished difference Result 352 states and 537 transitions. [2019-09-08 11:57:57,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:57:57,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-09-08 11:57:57,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:57:57,187 INFO L225 Difference]: With dead ends: 352 [2019-09-08 11:57:57,187 INFO L226 Difference]: Without dead ends: 242 [2019-09-08 11:57:57,192 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:57:57,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-09-08 11:57:57,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2019-09-08 11:57:57,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-09-08 11:57:57,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 359 transitions. [2019-09-08 11:57:57,248 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 359 transitions. Word has length 64 [2019-09-08 11:57:57,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:57:57,248 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 359 transitions. [2019-09-08 11:57:57,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:57:57,249 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 359 transitions. [2019-09-08 11:57:57,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 11:57:57,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:57:57,254 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] [2019-09-08 11:57:57,254 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:57:57,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:57:57,255 INFO L82 PathProgramCache]: Analyzing trace with hash -922764682, now seen corresponding path program 1 times [2019-09-08 11:57:57,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:57:57,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:57:57,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:57,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:57:57,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:57,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:57:57,370 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:57:57,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:57:57,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:57:57,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:57:57,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:57:57,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:57:57,372 INFO L87 Difference]: Start difference. First operand 240 states and 359 transitions. Second operand 3 states. [2019-09-08 11:57:57,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:57:57,438 INFO L93 Difference]: Finished difference Result 612 states and 949 transitions. [2019-09-08 11:57:57,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:57:57,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-09-08 11:57:57,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:57:57,442 INFO L225 Difference]: With dead ends: 612 [2019-09-08 11:57:57,442 INFO L226 Difference]: Without dead ends: 410 [2019-09-08 11:57:57,444 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:57:57,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-09-08 11:57:57,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 408. [2019-09-08 11:57:57,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-09-08 11:57:57,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 623 transitions. [2019-09-08 11:57:57,503 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 623 transitions. Word has length 65 [2019-09-08 11:57:57,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:57:57,504 INFO L475 AbstractCegarLoop]: Abstraction has 408 states and 623 transitions. [2019-09-08 11:57:57,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:57:57,504 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 623 transitions. [2019-09-08 11:57:57,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 11:57:57,509 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:57:57,509 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] [2019-09-08 11:57:57,510 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:57:57,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:57:57,510 INFO L82 PathProgramCache]: Analyzing trace with hash -919872372, now seen corresponding path program 1 times [2019-09-08 11:57:57,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:57:57,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:57:57,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:57,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:57:57,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:57,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:57:57,598 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:57:57,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:57:57,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:57:57,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:57:57,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:57:57,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:57:57,600 INFO L87 Difference]: Start difference. First operand 408 states and 623 transitions. Second operand 3 states. [2019-09-08 11:57:57,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:57:57,658 INFO L93 Difference]: Finished difference Result 1084 states and 1689 transitions. [2019-09-08 11:57:57,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:57:57,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-08 11:57:57,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:57:57,666 INFO L225 Difference]: With dead ends: 1084 [2019-09-08 11:57:57,666 INFO L226 Difference]: Without dead ends: 714 [2019-09-08 11:57:57,672 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:57:57,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-09-08 11:57:57,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 712. [2019-09-08 11:57:57,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-09-08 11:57:57,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1095 transitions. [2019-09-08 11:57:57,718 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1095 transitions. Word has length 66 [2019-09-08 11:57:57,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:57:57,720 INFO L475 AbstractCegarLoop]: Abstraction has 712 states and 1095 transitions. [2019-09-08 11:57:57,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:57:57,720 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1095 transitions. [2019-09-08 11:57:57,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 11:57:57,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:57:57,728 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] [2019-09-08 11:57:57,728 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:57:57,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:57:57,728 INFO L82 PathProgramCache]: Analyzing trace with hash -963358397, now seen corresponding path program 1 times [2019-09-08 11:57:57,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:57:57,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:57:57,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:57,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:57:57,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:57,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:57:57,840 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:57:57,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:57:57,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:57:57,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:57:57,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:57:57,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:57:57,843 INFO L87 Difference]: Start difference. First operand 712 states and 1095 transitions. Second operand 3 states. [2019-09-08 11:57:57,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:57:57,931 INFO L93 Difference]: Finished difference Result 1932 states and 3001 transitions. [2019-09-08 11:57:57,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:57:57,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-08 11:57:57,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:57:57,939 INFO L225 Difference]: With dead ends: 1932 [2019-09-08 11:57:57,939 INFO L226 Difference]: Without dead ends: 1258 [2019-09-08 11:57:57,941 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:57:57,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2019-09-08 11:57:57,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1256. [2019-09-08 11:57:57,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-09-08 11:57:58,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1927 transitions. [2019-09-08 11:57:58,008 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1927 transitions. Word has length 67 [2019-09-08 11:57:58,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:57:58,008 INFO L475 AbstractCegarLoop]: Abstraction has 1256 states and 1927 transitions. [2019-09-08 11:57:58,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:57:58,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1927 transitions. [2019-09-08 11:57:58,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 11:57:58,011 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:57:58,011 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] [2019-09-08 11:57:58,011 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:57:58,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:57:58,012 INFO L82 PathProgramCache]: Analyzing trace with hash -295185019, now seen corresponding path program 1 times [2019-09-08 11:57:58,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:57:58,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:57:58,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:58,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:57:58,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:57:58,152 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:57:58,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:57:58,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:57:58,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:57:58,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:57:58,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:57:58,155 INFO L87 Difference]: Start difference. First operand 1256 states and 1927 transitions. Second operand 5 states. [2019-09-08 11:57:58,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:57:58,508 INFO L93 Difference]: Finished difference Result 3692 states and 5705 transitions. [2019-09-08 11:57:58,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:57:58,509 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-08 11:57:58,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:57:58,522 INFO L225 Difference]: With dead ends: 3692 [2019-09-08 11:57:58,522 INFO L226 Difference]: Without dead ends: 2474 [2019-09-08 11:57:58,527 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:57:58,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2019-09-08 11:57:58,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2472. [2019-09-08 11:57:58,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2019-09-08 11:57:58,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3799 transitions. [2019-09-08 11:57:58,714 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3799 transitions. Word has length 68 [2019-09-08 11:57:58,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:57:58,717 INFO L475 AbstractCegarLoop]: Abstraction has 2472 states and 3799 transitions. [2019-09-08 11:57:58,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:57:58,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3799 transitions. [2019-09-08 11:57:58,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 11:57:58,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:57:58,718 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] [2019-09-08 11:57:58,719 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:57:58,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:57:58,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1032200170, now seen corresponding path program 1 times [2019-09-08 11:57:58,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:57:58,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:57:58,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:58,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:57:58,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:57:58,848 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:57:58,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:57:58,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:57:58,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:57:58,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:57:58,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:57:58,850 INFO L87 Difference]: Start difference. First operand 2472 states and 3799 transitions. Second operand 5 states. [2019-09-08 11:57:59,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:57:59,129 INFO L93 Difference]: Finished difference Result 4906 states and 7560 transitions. [2019-09-08 11:57:59,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:57:59,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-08 11:57:59,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:57:59,141 INFO L225 Difference]: With dead ends: 4906 [2019-09-08 11:57:59,142 INFO L226 Difference]: Without dead ends: 2472 [2019-09-08 11:57:59,146 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:57:59,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2472 states. [2019-09-08 11:57:59,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2472 to 2472. [2019-09-08 11:57:59,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2019-09-08 11:57:59,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3767 transitions. [2019-09-08 11:57:59,283 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3767 transitions. Word has length 68 [2019-09-08 11:57:59,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:57:59,284 INFO L475 AbstractCegarLoop]: Abstraction has 2472 states and 3767 transitions. [2019-09-08 11:57:59,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:57:59,284 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3767 transitions. [2019-09-08 11:57:59,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 11:57:59,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:57:59,285 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] [2019-09-08 11:57:59,285 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:57:59,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:57:59,286 INFO L82 PathProgramCache]: Analyzing trace with hash -809830363, now seen corresponding path program 1 times [2019-09-08 11:57:59,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:57:59,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:57:59,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:59,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:57:59,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:57:59,369 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:57:59,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:57:59,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:57:59,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:57:59,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:57:59,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:57:59,371 INFO L87 Difference]: Start difference. First operand 2472 states and 3767 transitions. Second operand 5 states. [2019-09-08 11:57:59,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:57:59,613 INFO L93 Difference]: Finished difference Result 4906 states and 7496 transitions. [2019-09-08 11:57:59,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:57:59,613 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-08 11:57:59,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:57:59,627 INFO L225 Difference]: With dead ends: 4906 [2019-09-08 11:57:59,628 INFO L226 Difference]: Without dead ends: 2472 [2019-09-08 11:57:59,634 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:57:59,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2472 states. [2019-09-08 11:57:59,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2472 to 2472. [2019-09-08 11:57:59,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2019-09-08 11:57:59,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3735 transitions. [2019-09-08 11:57:59,802 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3735 transitions. Word has length 68 [2019-09-08 11:57:59,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:57:59,803 INFO L475 AbstractCegarLoop]: Abstraction has 2472 states and 3735 transitions. [2019-09-08 11:57:59,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:57:59,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3735 transitions. [2019-09-08 11:57:59,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 11:57:59,805 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:57:59,805 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] [2019-09-08 11:57:59,805 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:57:59,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:57:59,806 INFO L82 PathProgramCache]: Analyzing trace with hash 464037642, now seen corresponding path program 1 times [2019-09-08 11:57:59,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:57:59,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:57:59,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:59,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:57:59,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:59,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:57:59,921 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:57:59,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:57:59,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:57:59,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:57:59,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:57:59,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:57:59,924 INFO L87 Difference]: Start difference. First operand 2472 states and 3735 transitions. Second operand 5 states. [2019-09-08 11:58:00,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:00,169 INFO L93 Difference]: Finished difference Result 4906 states and 7432 transitions. [2019-09-08 11:58:00,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:58:00,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-08 11:58:00,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:00,183 INFO L225 Difference]: With dead ends: 4906 [2019-09-08 11:58:00,184 INFO L226 Difference]: Without dead ends: 2472 [2019-09-08 11:58:00,193 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:58:00,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2472 states. [2019-09-08 11:58:00,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2472 to 2472. [2019-09-08 11:58:00,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2019-09-08 11:58:00,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3703 transitions. [2019-09-08 11:58:00,429 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3703 transitions. Word has length 68 [2019-09-08 11:58:00,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:00,430 INFO L475 AbstractCegarLoop]: Abstraction has 2472 states and 3703 transitions. [2019-09-08 11:58:00,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:58:00,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3703 transitions. [2019-09-08 11:58:00,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 11:58:00,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:00,432 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] [2019-09-08 11:58:00,433 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:00,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:00,434 INFO L82 PathProgramCache]: Analyzing trace with hash -982991953, now seen corresponding path program 1 times [2019-09-08 11:58:00,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:00,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:00,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:00,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:00,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:00,625 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:58:00,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:00,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:58:00,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:58:00,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:58:00,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:58:00,628 INFO L87 Difference]: Start difference. First operand 2472 states and 3703 transitions. Second operand 7 states. [2019-09-08 11:58:01,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:01,771 INFO L93 Difference]: Finished difference Result 21944 states and 33023 transitions. [2019-09-08 11:58:01,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:58:01,771 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-09-08 11:58:01,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:01,856 INFO L225 Difference]: With dead ends: 21944 [2019-09-08 11:58:01,857 INFO L226 Difference]: Without dead ends: 19510 [2019-09-08 11:58:01,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:58:01,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19510 states. [2019-09-08 11:58:02,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19510 to 7336. [2019-09-08 11:58:02,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7336 states. [2019-09-08 11:58:02,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7336 states to 7336 states and 10903 transitions. [2019-09-08 11:58:02,562 INFO L78 Accepts]: Start accepts. Automaton has 7336 states and 10903 transitions. Word has length 68 [2019-09-08 11:58:02,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:02,563 INFO L475 AbstractCegarLoop]: Abstraction has 7336 states and 10903 transitions. [2019-09-08 11:58:02,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:58:02,563 INFO L276 IsEmpty]: Start isEmpty. Operand 7336 states and 10903 transitions. [2019-09-08 11:58:02,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 11:58:02,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:02,564 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] [2019-09-08 11:58:02,564 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:02,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:02,565 INFO L82 PathProgramCache]: Analyzing trace with hash -635604215, now seen corresponding path program 1 times [2019-09-08 11:58:02,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:02,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:02,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:02,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:02,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:02,924 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:58:02,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:02,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:58:02,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:58:02,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:58:02,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:58:02,927 INFO L87 Difference]: Start difference. First operand 7336 states and 10903 transitions. Second operand 7 states. [2019-09-08 11:58:03,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:03,749 INFO L93 Difference]: Finished difference Result 17072 states and 25435 transitions. [2019-09-08 11:58:03,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 11:58:03,749 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-09-08 11:58:03,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:03,773 INFO L225 Difference]: With dead ends: 17072 [2019-09-08 11:58:03,774 INFO L226 Difference]: Without dead ends: 9774 [2019-09-08 11:58:03,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:58:03,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9774 states. [2019-09-08 11:58:04,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9774 to 7336. [2019-09-08 11:58:04,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7336 states. [2019-09-08 11:58:04,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7336 states to 7336 states and 10839 transitions. [2019-09-08 11:58:04,224 INFO L78 Accepts]: Start accepts. Automaton has 7336 states and 10839 transitions. Word has length 70 [2019-09-08 11:58:04,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:04,224 INFO L475 AbstractCegarLoop]: Abstraction has 7336 states and 10839 transitions. [2019-09-08 11:58:04,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:58:04,224 INFO L276 IsEmpty]: Start isEmpty. Operand 7336 states and 10839 transitions. [2019-09-08 11:58:04,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 11:58:04,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:04,225 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] [2019-09-08 11:58:04,226 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:04,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:04,226 INFO L82 PathProgramCache]: Analyzing trace with hash -655653558, now seen corresponding path program 1 times [2019-09-08 11:58:04,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:04,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:04,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:04,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:04,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:04,286 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:58:04,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:04,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:58:04,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:58:04,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:58:04,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:58:04,289 INFO L87 Difference]: Start difference. First operand 7336 states and 10839 transitions. Second operand 3 states. [2019-09-08 11:58:04,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:04,804 INFO L93 Difference]: Finished difference Result 16398 states and 24195 transitions. [2019-09-08 11:58:04,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:58:04,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-08 11:58:04,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:04,829 INFO L225 Difference]: With dead ends: 16398 [2019-09-08 11:58:04,829 INFO L226 Difference]: Without dead ends: 9100 [2019-09-08 11:58:04,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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:58:04,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9100 states. [2019-09-08 11:58:05,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9100 to 9098. [2019-09-08 11:58:05,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9098 states. [2019-09-08 11:58:05,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9098 states to 9098 states and 13313 transitions. [2019-09-08 11:58:05,428 INFO L78 Accepts]: Start accepts. Automaton has 9098 states and 13313 transitions. Word has length 70 [2019-09-08 11:58:05,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:05,429 INFO L475 AbstractCegarLoop]: Abstraction has 9098 states and 13313 transitions. [2019-09-08 11:58:05,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:58:05,429 INFO L276 IsEmpty]: Start isEmpty. Operand 9098 states and 13313 transitions. [2019-09-08 11:58:05,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:58:05,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:05,429 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] [2019-09-08 11:58:05,430 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:05,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:05,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1769196458, now seen corresponding path program 1 times [2019-09-08 11:58:05,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:05,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:05,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:05,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:05,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:05,520 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:58:05,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:05,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:58:05,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:58:05,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:58:05,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:58:05,522 INFO L87 Difference]: Start difference. First operand 9098 states and 13313 transitions. Second operand 5 states. [2019-09-08 11:58:06,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:06,761 INFO L93 Difference]: Finished difference Result 17672 states and 25722 transitions. [2019-09-08 11:58:06,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:58:06,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-08 11:58:06,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:06,803 INFO L225 Difference]: With dead ends: 17672 [2019-09-08 11:58:06,803 INFO L226 Difference]: Without dead ends: 17670 [2019-09-08 11:58:06,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:58:06,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17670 states. [2019-09-08 11:58:07,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17670 to 9514. [2019-09-08 11:58:07,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9514 states. [2019-09-08 11:58:07,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9514 states to 9514 states and 13713 transitions. [2019-09-08 11:58:07,985 INFO L78 Accepts]: Start accepts. Automaton has 9514 states and 13713 transitions. Word has length 71 [2019-09-08 11:58:07,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:07,985 INFO L475 AbstractCegarLoop]: Abstraction has 9514 states and 13713 transitions. [2019-09-08 11:58:07,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:58:07,986 INFO L276 IsEmpty]: Start isEmpty. Operand 9514 states and 13713 transitions. [2019-09-08 11:58:07,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 11:58:07,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:07,990 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] [2019-09-08 11:58:07,990 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:07,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:07,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1397736529, now seen corresponding path program 1 times [2019-09-08 11:58:07,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:07,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:07,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:07,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:07,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:08,126 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 11:58:08,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:08,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:58:08,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:58:08,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:58:08,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:58:08,128 INFO L87 Difference]: Start difference. First operand 9514 states and 13713 transitions. Second operand 7 states. [2019-09-08 11:58:10,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:10,164 INFO L93 Difference]: Finished difference Result 40550 states and 58575 transitions. [2019-09-08 11:58:10,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 11:58:10,165 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-09-08 11:58:10,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:10,217 INFO L225 Difference]: With dead ends: 40550 [2019-09-08 11:58:10,218 INFO L226 Difference]: Without dead ends: 37364 [2019-09-08 11:58:10,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:58:10,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37364 states. [2019-09-08 11:58:11,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37364 to 15850. [2019-09-08 11:58:11,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15850 states. [2019-09-08 11:58:11,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15850 states to 15850 states and 22689 transitions. [2019-09-08 11:58:11,375 INFO L78 Accepts]: Start accepts. Automaton has 15850 states and 22689 transitions. Word has length 97 [2019-09-08 11:58:11,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:11,375 INFO L475 AbstractCegarLoop]: Abstraction has 15850 states and 22689 transitions. [2019-09-08 11:58:11,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:58:11,375 INFO L276 IsEmpty]: Start isEmpty. Operand 15850 states and 22689 transitions. [2019-09-08 11:58:11,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 11:58:11,380 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:11,381 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] [2019-09-08 11:58:11,381 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:11,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:11,381 INFO L82 PathProgramCache]: Analyzing trace with hash 887147195, now seen corresponding path program 1 times [2019-09-08 11:58:11,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:11,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:11,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:11,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:11,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:11,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:11,474 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:58:11,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:58:11,475 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:58:11,495 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:58:11,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:11,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 11:58:11,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:58:11,789 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 11:58:11,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 11:58:11,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2019-09-08 11:58:11,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:58:11,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:58:11,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:58:11,807 INFO L87 Difference]: Start difference. First operand 15850 states and 22689 transitions. Second operand 10 states. [2019-09-08 11:58:16,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:16,566 INFO L93 Difference]: Finished difference Result 67638 states and 97599 transitions. [2019-09-08 11:58:16,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 11:58:16,566 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-09-08 11:58:16,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:16,702 INFO L225 Difference]: With dead ends: 67638 [2019-09-08 11:58:16,702 INFO L226 Difference]: Without dead ends: 58164 [2019-09-08 11:58:16,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=329, Unknown=0, NotChecked=0, Total=506 [2019-09-08 11:58:16,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58164 states. [2019-09-08 11:58:19,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58164 to 28442. [2019-09-08 11:58:19,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28442 states. [2019-09-08 11:58:19,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28442 states to 28442 states and 40961 transitions. [2019-09-08 11:58:19,154 INFO L78 Accepts]: Start accepts. Automaton has 28442 states and 40961 transitions. Word has length 97 [2019-09-08 11:58:19,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:19,154 INFO L475 AbstractCegarLoop]: Abstraction has 28442 states and 40961 transitions. [2019-09-08 11:58:19,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:58:19,155 INFO L276 IsEmpty]: Start isEmpty. Operand 28442 states and 40961 transitions. [2019-09-08 11:58:19,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 11:58:19,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:19,161 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] [2019-09-08 11:58:19,161 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:19,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:19,161 INFO L82 PathProgramCache]: Analyzing trace with hash 910892417, now seen corresponding path program 1 times [2019-09-08 11:58:19,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:19,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:19,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:19,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:19,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:19,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:19,260 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:58:19,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:58:19,260 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:58:19,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:19,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 11:58:19,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:58:19,491 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 11:58:19,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 11:58:19,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2019-09-08 11:58:19,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:58:19,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:58:19,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:58:19,505 INFO L87 Difference]: Start difference. First operand 28442 states and 40961 transitions. Second operand 10 states. [2019-09-08 11:58:25,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:25,490 INFO L93 Difference]: Finished difference Result 100502 states and 145391 transitions. [2019-09-08 11:58:25,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 11:58:25,490 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-09-08 11:58:25,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:25,618 INFO L225 Difference]: With dead ends: 100502 [2019-09-08 11:58:25,618 INFO L226 Difference]: Without dead ends: 81572 [2019-09-08 11:58:25,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=302, Unknown=0, NotChecked=0, Total=462 [2019-09-08 11:58:25,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81572 states. [2019-09-08 11:58:28,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81572 to 37850. [2019-09-08 11:58:28,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37850 states. [2019-09-08 11:58:28,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37850 states to 37850 states and 54569 transitions. [2019-09-08 11:58:28,537 INFO L78 Accepts]: Start accepts. Automaton has 37850 states and 54569 transitions. Word has length 97 [2019-09-08 11:58:28,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:28,537 INFO L475 AbstractCegarLoop]: Abstraction has 37850 states and 54569 transitions. [2019-09-08 11:58:28,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:58:28,537 INFO L276 IsEmpty]: Start isEmpty. Operand 37850 states and 54569 transitions. [2019-09-08 11:58:28,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 11:58:28,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:28,543 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] [2019-09-08 11:58:28,543 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:28,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:28,544 INFO L82 PathProgramCache]: Analyzing trace with hash 514621301, now seen corresponding path program 1 times [2019-09-08 11:58:28,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:28,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:28,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:28,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:28,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:28,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:28,677 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 11:58:28,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:28,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:58:28,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:58:28,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:58:28,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:58:28,679 INFO L87 Difference]: Start difference. First operand 37850 states and 54569 transitions. Second operand 7 states. [2019-09-08 11:58:33,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:33,832 INFO L93 Difference]: Finished difference Result 94710 states and 136911 transitions. [2019-09-08 11:58:33,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 11:58:33,833 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-09-08 11:58:33,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:33,919 INFO L225 Difference]: With dead ends: 94710 [2019-09-08 11:58:33,920 INFO L226 Difference]: Without dead ends: 66372 [2019-09-08 11:58:33,962 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:58:34,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66372 states. [2019-09-08 11:58:37,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66372 to 44138. [2019-09-08 11:58:37,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44138 states. [2019-09-08 11:58:37,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44138 states to 44138 states and 63497 transitions. [2019-09-08 11:58:37,204 INFO L78 Accepts]: Start accepts. Automaton has 44138 states and 63497 transitions. Word has length 97 [2019-09-08 11:58:37,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:37,204 INFO L475 AbstractCegarLoop]: Abstraction has 44138 states and 63497 transitions. [2019-09-08 11:58:37,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:58:37,205 INFO L276 IsEmpty]: Start isEmpty. Operand 44138 states and 63497 transitions. [2019-09-08 11:58:37,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 11:58:37,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:37,211 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] [2019-09-08 11:58:37,211 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:37,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:37,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1208876905, now seen corresponding path program 1 times [2019-09-08 11:58:37,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:37,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:37,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:37,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:37,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:37,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:37,345 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 11:58:37,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:37,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:58:37,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:58:37,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:58:37,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:58:37,346 INFO L87 Difference]: Start difference. First operand 44138 states and 63497 transitions. Second operand 7 states. [2019-09-08 11:58:44,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:44,049 INFO L93 Difference]: Finished difference Result 116758 states and 169439 transitions. [2019-09-08 11:58:44,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 11:58:44,050 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-09-08 11:58:44,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:44,177 INFO L225 Difference]: With dead ends: 116758 [2019-09-08 11:58:44,177 INFO L226 Difference]: Without dead ends: 103956 [2019-09-08 11:58:44,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:58:44,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103956 states. [2019-09-08 11:58:49,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103956 to 49258. [2019-09-08 11:58:49,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49258 states. [2019-09-08 11:58:49,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49258 states to 49258 states and 70953 transitions. [2019-09-08 11:58:49,251 INFO L78 Accepts]: Start accepts. Automaton has 49258 states and 70953 transitions. Word has length 97 [2019-09-08 11:58:49,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:49,252 INFO L475 AbstractCegarLoop]: Abstraction has 49258 states and 70953 transitions. [2019-09-08 11:58:49,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:58:49,252 INFO L276 IsEmpty]: Start isEmpty. Operand 49258 states and 70953 transitions. [2019-09-08 11:58:49,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 11:58:49,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:49,258 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:58:49,258 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:49,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:49,259 INFO L82 PathProgramCache]: Analyzing trace with hash -2047399003, now seen corresponding path program 1 times [2019-09-08 11:58:49,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:49,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:49,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:49,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:49,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:49,342 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 11:58:49,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:58:49,343 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:58:49,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:49,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-08 11:58:49,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:58:49,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:58:49,788 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:58:49,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:58:49,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 10] total 12 [2019-09-08 11:58:49,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 11:58:49,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 11:58:49,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-08 11:58:49,795 INFO L87 Difference]: Start difference. First operand 49258 states and 70953 transitions. Second operand 12 states. [2019-09-08 11:59:26,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:26,561 INFO L93 Difference]: Finished difference Result 403092 states and 574128 transitions. [2019-09-08 11:59:26,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-08 11:59:26,561 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-09-08 11:59:26,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:27,020 INFO L225 Difference]: With dead ends: 403092 [2019-09-08 11:59:27,020 INFO L226 Difference]: Without dead ends: 353874 [2019-09-08 11:59:27,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1688 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1086, Invalid=3606, Unknown=0, NotChecked=0, Total=4692 [2019-09-08 11:59:27,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353874 states. [2019-09-08 11:59:50,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353874 to 199146. [2019-09-08 11:59:50,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199146 states. [2019-09-08 11:59:51,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199146 states to 199146 states and 281543 transitions. [2019-09-08 11:59:51,305 INFO L78 Accepts]: Start accepts. Automaton has 199146 states and 281543 transitions. Word has length 98 [2019-09-08 11:59:51,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:59:51,305 INFO L475 AbstractCegarLoop]: Abstraction has 199146 states and 281543 transitions. [2019-09-08 11:59:51,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 11:59:51,305 INFO L276 IsEmpty]: Start isEmpty. Operand 199146 states and 281543 transitions. [2019-09-08 11:59:51,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 11:59:51,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:59:51,315 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] [2019-09-08 11:59:51,316 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:59:51,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:59:51,316 INFO L82 PathProgramCache]: Analyzing trace with hash -2002573344, now seen corresponding path program 1 times [2019-09-08 11:59:51,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:59:51,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:59:51,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:51,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:59:51,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:51,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:59:51,549 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:59:51,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:59:51,550 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:59:51,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:59:52,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:59:52,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-08 11:59:52,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:59:52,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:59:52,342 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:59:52,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:59:52,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-09-08 11:59:52,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 11:59:52,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 11:59:52,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-09-08 11:59:52,348 INFO L87 Difference]: Start difference. First operand 199146 states and 281543 transitions. Second operand 17 states. [2019-09-08 12:01:34,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:01:34,208 INFO L93 Difference]: Finished difference Result 1007946 states and 1413699 transitions. [2019-09-08 12:01:34,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 12:01:34,208 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 99 [2019-09-08 12:01:34,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:01:35,927 INFO L225 Difference]: With dead ends: 1007946 [2019-09-08 12:01:35,927 INFO L226 Difference]: Without dead ends: 877288 [2019-09-08 12:01:36,134 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=489, Invalid=1491, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 12:01:36,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877288 states. [2019-09-08 12:02:41,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877288 to 416190. [2019-09-08 12:02:41,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416190 states. [2019-09-08 12:02:41,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416190 states to 416190 states and 587165 transitions. [2019-09-08 12:02:41,780 INFO L78 Accepts]: Start accepts. Automaton has 416190 states and 587165 transitions. Word has length 99 [2019-09-08 12:02:41,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:41,780 INFO L475 AbstractCegarLoop]: Abstraction has 416190 states and 587165 transitions. [2019-09-08 12:02:41,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:02:41,780 INFO L276 IsEmpty]: Start isEmpty. Operand 416190 states and 587165 transitions. [2019-09-08 12:02:41,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:02:41,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:41,789 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] [2019-09-08 12:02:41,789 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:41,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:41,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1012996838, now seen corresponding path program 1 times [2019-09-08 12:02:41,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:41,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:41,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:41,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:41,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:41,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:42,027 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:02:42,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:02:42,027 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:02:42,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:42,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-08 12:02:42,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:02:42,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:02:42,687 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:02:42,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 12:02:42,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2019-09-08 12:02:42,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 12:02:42,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 12:02:42,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:02:42,693 INFO L87 Difference]: Start difference. First operand 416190 states and 587165 transitions. Second operand 20 states. [2019-09-08 12:02:47,120 WARN L188 SmtUtils]: Spent 853.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-09-08 12:02:47,836 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-09-08 12:02:48,185 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2019-09-08 12:02:49,363 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-08 12:02:49,873 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2019-09-08 12:02:51,080 WARN L188 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-09-08 12:02:51,531 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-09-08 12:02:52,180 WARN L188 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2019-09-08 12:02:55,585 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-09-08 12:02:55,938 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-09-08 12:02:58,009 WARN L188 SmtUtils]: Spent 994.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2019-09-08 12:02:59,713 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-08 12:03:00,597 WARN L188 SmtUtils]: Spent 825.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-09-08 12:03:02,399 WARN L188 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-09-08 12:03:02,572 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-09-08 12:03:02,742 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-08 12:03:02,914 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-08 12:03:05,654 WARN L188 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-09-08 12:03:06,518 WARN L188 SmtUtils]: Spent 705.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-09-08 12:03:07,297 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-08 12:03:07,463 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-08 12:03:07,738 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-08 12:03:07,909 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-08 12:03:09,011 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-08 12:03:09,154 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-08 12:03:11,417 WARN L188 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-09-08 12:03:12,551 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-08 12:03:12,748 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-08 12:03:13,452 WARN L188 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-09-08 12:03:19,898 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-08 12:03:25,645 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-08 12:03:30,882 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-09-08 12:03:33,474 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-08 12:04:26,651 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-09-08 12:04:40,699 WARN L188 SmtUtils]: Spent 796.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-09-08 12:04:44,819 WARN L188 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-09-08 12:04:45,303 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-09-08 12:04:52,311 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37