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.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:23:18,742 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:23:18,744 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:23:18,756 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:23:18,757 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:23:18,758 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:23:18,759 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:23:18,761 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:23:18,763 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:23:18,764 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:23:18,765 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:23:18,766 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:23:18,766 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:23:18,767 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:23:18,768 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:23:18,770 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:23:18,771 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:23:18,772 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:23:18,773 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:23:18,775 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:23:18,777 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:23:18,778 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:23:18,779 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:23:18,780 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:23:18,782 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:23:18,782 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:23:18,782 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:23:18,783 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:23:18,784 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:23:18,785 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:23:18,785 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:23:18,786 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:23:18,787 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:23:18,788 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:23:18,789 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:23:18,789 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:23:18,790 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:23:18,790 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:23:18,790 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:23:18,791 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:23:18,792 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:23:18,793 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 12:23:18,808 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:23:18,809 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:23:18,810 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:23:18,812 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:23:18,812 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:23:18,812 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:23:18,812 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:23:18,812 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:23:18,813 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:23:18,813 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:23:18,813 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:23:18,814 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:23:18,814 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:23:18,815 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:23:18,815 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:23:18,815 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:23:18,815 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:23:18,816 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:23:18,816 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:23:18,816 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:23:18,816 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:23:18,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:23:18,817 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:23:18,817 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:23:18,817 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:23:18,817 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:23:18,818 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:23:18,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:23:18,818 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:23:18,866 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:23:18,885 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:23:18,891 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:23:18,892 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:23:18,893 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:23:18,893 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 12:23:18,964 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa02f2931/195be651a96f4c87adb13c5fbf58c3de/FLAG9006a190b [2019-09-08 12:23:19,500 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:23:19,502 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 12:23:19,514 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa02f2931/195be651a96f4c87adb13c5fbf58c3de/FLAG9006a190b [2019-09-08 12:23:19,803 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa02f2931/195be651a96f4c87adb13c5fbf58c3de [2019-09-08 12:23:19,813 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:23:19,815 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:23:19,816 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:23:19,816 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:23:19,820 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:23:19,821 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:23:19" (1/1) ... [2019-09-08 12:23:19,823 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f3c99dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:23:19, skipping insertion in model container [2019-09-08 12:23:19,824 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:23:19" (1/1) ... [2019-09-08 12:23:19,830 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:23:19,883 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:23:20,311 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:23:20,326 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:23:20,464 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:23:20,487 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:23:20,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:23:20 WrapperNode [2019-09-08 12:23:20,488 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:23:20,488 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:23:20,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:23:20,489 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:23:20,500 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:23:20" (1/1) ... [2019-09-08 12:23:20,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:23:20" (1/1) ... [2019-09-08 12:23:20,519 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:23:20" (1/1) ... [2019-09-08 12:23:20,519 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:23:20" (1/1) ... [2019-09-08 12:23:20,539 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:23:20" (1/1) ... [2019-09-08 12:23:20,553 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:23:20" (1/1) ... [2019-09-08 12:23:20,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:23:20" (1/1) ... [2019-09-08 12:23:20,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:23:20,571 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:23:20,572 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:23:20,572 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:23:20,573 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:23:20" (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 12:23:20,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:23:20,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:23:20,650 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:23:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:23:20,651 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:23:20,651 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:23:20,651 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 12:23:20,651 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:23:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:23:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:23:20,653 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:23:20,653 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:23:20,653 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:23:20,653 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:23:20,655 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:23:20,655 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:23:20,657 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 12:23:20,658 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:23:20,658 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:23:20,658 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:23:20,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:23:20,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:23:21,705 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:23:21,706 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:23:21,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:23:21 BoogieIcfgContainer [2019-09-08 12:23:21,707 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:23:21,708 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:23:21,708 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:23:21,711 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:23:21,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:23:19" (1/3) ... [2019-09-08 12:23:21,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e43393a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:23:21, skipping insertion in model container [2019-09-08 12:23:21,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:23:20" (2/3) ... [2019-09-08 12:23:21,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e43393a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:23:21, skipping insertion in model container [2019-09-08 12:23:21,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:23:21" (3/3) ... [2019-09-08 12:23:21,715 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 12:23:21,725 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:23:21,734 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 12:23:21,752 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 12:23:21,787 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:23:21,788 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:23:21,788 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:23:21,788 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:23:21,789 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:23:21,789 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:23:21,789 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:23:21,790 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:23:21,790 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:23:21,814 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states. [2019-09-08 12:23:21,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 12:23:21,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:21,827 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:23:21,829 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:21,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:21,837 INFO L82 PathProgramCache]: Analyzing trace with hash -911853224, now seen corresponding path program 1 times [2019-09-08 12:23:21,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:21,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:21,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:21,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:21,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:22,382 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 12:23:22,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:22,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:23:22,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:23:22,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:23:22,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:23:22,407 INFO L87 Difference]: Start difference. First operand 182 states. Second operand 3 states. [2019-09-08 12:23:22,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:22,571 INFO L93 Difference]: Finished difference Result 354 states and 585 transitions. [2019-09-08 12:23:22,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:23:22,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-09-08 12:23:22,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:22,588 INFO L225 Difference]: With dead ends: 354 [2019-09-08 12:23:22,588 INFO L226 Difference]: Without dead ends: 271 [2019-09-08 12:23:22,592 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 12:23:22,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-09-08 12:23:22,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 269. [2019-09-08 12:23:22,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-08 12:23:22,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 388 transitions. [2019-09-08 12:23:22,708 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 388 transitions. Word has length 94 [2019-09-08 12:23:22,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:22,709 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 388 transitions. [2019-09-08 12:23:22,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:23:22,709 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 388 transitions. [2019-09-08 12:23:22,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 12:23:22,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:22,717 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:23:22,717 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:22,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:22,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1894560043, now seen corresponding path program 1 times [2019-09-08 12:23:22,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:22,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:22,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:22,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:22,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:22,961 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 12:23:22,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:22,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:23:22,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:23:22,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:23:22,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:23:22,964 INFO L87 Difference]: Start difference. First operand 269 states and 388 transitions. Second operand 5 states. [2019-09-08 12:23:23,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:23,422 INFO L93 Difference]: Finished difference Result 671 states and 1015 transitions. [2019-09-08 12:23:23,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:23:23,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-09-08 12:23:23,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:23,427 INFO L225 Difference]: With dead ends: 671 [2019-09-08 12:23:23,428 INFO L226 Difference]: Without dead ends: 452 [2019-09-08 12:23:23,432 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 12:23:23,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-09-08 12:23:23,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 450. [2019-09-08 12:23:23,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-09-08 12:23:23,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 674 transitions. [2019-09-08 12:23:23,477 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 674 transitions. Word has length 96 [2019-09-08 12:23:23,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:23,480 INFO L475 AbstractCegarLoop]: Abstraction has 450 states and 674 transitions. [2019-09-08 12:23:23,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:23:23,480 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 674 transitions. [2019-09-08 12:23:23,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:23:23,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:23,491 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:23,492 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:23,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:23,492 INFO L82 PathProgramCache]: Analyzing trace with hash -787666345, now seen corresponding path program 1 times [2019-09-08 12:23:23,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:23,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:23,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:23,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:23,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:23,636 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 12:23:23,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:23,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:23:23,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:23:23,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:23:23,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:23:23,639 INFO L87 Difference]: Start difference. First operand 450 states and 674 transitions. Second operand 5 states. [2019-09-08 12:23:23,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:23,860 INFO L93 Difference]: Finished difference Result 846 states and 1293 transitions. [2019-09-08 12:23:23,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:23:23,862 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 12:23:23,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:23,866 INFO L225 Difference]: With dead ends: 846 [2019-09-08 12:23:23,866 INFO L226 Difference]: Without dead ends: 450 [2019-09-08 12:23:23,871 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 12:23:23,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-09-08 12:23:23,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2019-09-08 12:23:23,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-09-08 12:23:23,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 669 transitions. [2019-09-08 12:23:23,912 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 669 transitions. Word has length 97 [2019-09-08 12:23:23,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:23,914 INFO L475 AbstractCegarLoop]: Abstraction has 450 states and 669 transitions. [2019-09-08 12:23:23,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:23:23,915 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 669 transitions. [2019-09-08 12:23:23,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:23:23,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:23,921 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:23:23,921 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:23,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:23,922 INFO L82 PathProgramCache]: Analyzing trace with hash 263026140, now seen corresponding path program 1 times [2019-09-08 12:23:23,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:23,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:23,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:23,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:23,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:24,077 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 12:23:24,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:24,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:23:24,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:23:24,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:23:24,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:23:24,079 INFO L87 Difference]: Start difference. First operand 450 states and 669 transitions. Second operand 5 states. [2019-09-08 12:23:24,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:24,336 INFO L93 Difference]: Finished difference Result 838 states and 1274 transitions. [2019-09-08 12:23:24,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:23:24,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-09-08 12:23:24,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:24,340 INFO L225 Difference]: With dead ends: 838 [2019-09-08 12:23:24,340 INFO L226 Difference]: Without dead ends: 450 [2019-09-08 12:23:24,342 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 12:23:24,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-09-08 12:23:24,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2019-09-08 12:23:24,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-09-08 12:23:24,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 664 transitions. [2019-09-08 12:23:24,368 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 664 transitions. Word has length 98 [2019-09-08 12:23:24,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:24,368 INFO L475 AbstractCegarLoop]: Abstraction has 450 states and 664 transitions. [2019-09-08 12:23:24,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:23:24,368 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 664 transitions. [2019-09-08 12:23:24,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:23:24,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:24,372 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:23:24,373 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:24,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:24,373 INFO L82 PathProgramCache]: Analyzing trace with hash 699898071, now seen corresponding path program 1 times [2019-09-08 12:23:24,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:24,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:24,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:24,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:24,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:24,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:24,519 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 12:23:24,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:24,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:23:24,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:23:24,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:23:24,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:23:24,522 INFO L87 Difference]: Start difference. First operand 450 states and 664 transitions. Second operand 5 states. [2019-09-08 12:23:24,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:24,723 INFO L93 Difference]: Finished difference Result 834 states and 1260 transitions. [2019-09-08 12:23:24,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:23:24,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-08 12:23:24,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:24,727 INFO L225 Difference]: With dead ends: 834 [2019-09-08 12:23:24,727 INFO L226 Difference]: Without dead ends: 450 [2019-09-08 12:23:24,728 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 12:23:24,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-09-08 12:23:24,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2019-09-08 12:23:24,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-09-08 12:23:24,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 659 transitions. [2019-09-08 12:23:24,754 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 659 transitions. Word has length 99 [2019-09-08 12:23:24,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:24,754 INFO L475 AbstractCegarLoop]: Abstraction has 450 states and 659 transitions. [2019-09-08 12:23:24,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:23:24,755 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 659 transitions. [2019-09-08 12:23:24,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:23:24,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:24,756 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:23:24,756 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:24,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:24,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1306674069, now seen corresponding path program 1 times [2019-09-08 12:23:24,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:24,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:24,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:24,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:24,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:24,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:24,853 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 12:23:24,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:24,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:23:24,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:23:24,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:23:24,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:23:24,855 INFO L87 Difference]: Start difference. First operand 450 states and 659 transitions. Second operand 5 states. [2019-09-08 12:23:25,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:25,053 INFO L93 Difference]: Finished difference Result 842 states and 1259 transitions. [2019-09-08 12:23:25,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:23:25,054 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-09-08 12:23:25,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:25,057 INFO L225 Difference]: With dead ends: 842 [2019-09-08 12:23:25,057 INFO L226 Difference]: Without dead ends: 450 [2019-09-08 12:23:25,058 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 12:23:25,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-09-08 12:23:25,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2019-09-08 12:23:25,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-09-08 12:23:25,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 654 transitions. [2019-09-08 12:23:25,084 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 654 transitions. Word has length 100 [2019-09-08 12:23:25,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:25,084 INFO L475 AbstractCegarLoop]: Abstraction has 450 states and 654 transitions. [2019-09-08 12:23:25,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:23:25,084 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 654 transitions. [2019-09-08 12:23:25,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:23:25,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:25,086 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:23:25,086 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:25,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:25,087 INFO L82 PathProgramCache]: Analyzing trace with hash 2126638581, now seen corresponding path program 1 times [2019-09-08 12:23:25,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:25,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:25,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:25,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:25,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:25,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:25,199 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 12:23:25,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:25,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:23:25,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:23:25,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:23:25,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:23:25,202 INFO L87 Difference]: Start difference. First operand 450 states and 654 transitions. Second operand 5 states. [2019-09-08 12:23:25,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:25,392 INFO L93 Difference]: Finished difference Result 830 states and 1237 transitions. [2019-09-08 12:23:25,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:23:25,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-09-08 12:23:25,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:25,396 INFO L225 Difference]: With dead ends: 830 [2019-09-08 12:23:25,396 INFO L226 Difference]: Without dead ends: 450 [2019-09-08 12:23:25,398 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 12:23:25,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-09-08 12:23:25,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2019-09-08 12:23:25,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-09-08 12:23:25,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 649 transitions. [2019-09-08 12:23:25,424 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 649 transitions. Word has length 101 [2019-09-08 12:23:25,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:25,425 INFO L475 AbstractCegarLoop]: Abstraction has 450 states and 649 transitions. [2019-09-08 12:23:25,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:23:25,425 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 649 transitions. [2019-09-08 12:23:25,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:23:25,426 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:25,426 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:23:25,427 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:25,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:25,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1373809086, now seen corresponding path program 1 times [2019-09-08 12:23:25,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:25,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:25,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:25,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:25,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:25,645 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 12:23:25,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:25,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:23:25,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:23:25,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:23:25,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:23:25,647 INFO L87 Difference]: Start difference. First operand 450 states and 649 transitions. Second operand 8 states. [2019-09-08 12:23:26,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:26,139 INFO L93 Difference]: Finished difference Result 2255 states and 3383 transitions. [2019-09-08 12:23:26,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:23:26,140 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2019-09-08 12:23:26,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:26,150 INFO L225 Difference]: With dead ends: 2255 [2019-09-08 12:23:26,150 INFO L226 Difference]: Without dead ends: 1985 [2019-09-08 12:23:26,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:23:26,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2019-09-08 12:23:26,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 583. [2019-09-08 12:23:26,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-09-08 12:23:26,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 852 transitions. [2019-09-08 12:23:26,220 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 852 transitions. Word has length 102 [2019-09-08 12:23:26,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:26,221 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 852 transitions. [2019-09-08 12:23:26,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:23:26,221 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 852 transitions. [2019-09-08 12:23:26,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:23:26,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:26,222 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:23:26,223 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:26,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:26,223 INFO L82 PathProgramCache]: Analyzing trace with hash 2021773123, now seen corresponding path program 1 times [2019-09-08 12:23:26,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:26,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:26,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:26,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:26,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:26,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:26,416 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 12:23:26,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:26,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:23:26,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:23:26,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:23:26,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:23:26,418 INFO L87 Difference]: Start difference. First operand 583 states and 852 transitions. Second operand 8 states. [2019-09-08 12:23:26,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:26,890 INFO L93 Difference]: Finished difference Result 2405 states and 3614 transitions. [2019-09-08 12:23:26,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:23:26,890 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2019-09-08 12:23:26,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:26,902 INFO L225 Difference]: With dead ends: 2405 [2019-09-08 12:23:26,902 INFO L226 Difference]: Without dead ends: 2135 [2019-09-08 12:23:26,904 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:23:26,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2135 states. [2019-09-08 12:23:27,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2135 to 933. [2019-09-08 12:23:27,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2019-09-08 12:23:27,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1390 transitions. [2019-09-08 12:23:27,005 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1390 transitions. Word has length 102 [2019-09-08 12:23:27,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:27,006 INFO L475 AbstractCegarLoop]: Abstraction has 933 states and 1390 transitions. [2019-09-08 12:23:27,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:23:27,006 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1390 transitions. [2019-09-08 12:23:27,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:23:27,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:27,008 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:23:27,008 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:27,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:27,008 INFO L82 PathProgramCache]: Analyzing trace with hash -323435815, now seen corresponding path program 1 times [2019-09-08 12:23:27,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:27,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:27,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:27,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:27,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:27,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:27,117 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 12:23:27,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:27,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:23:27,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:23:27,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:23:27,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:23:27,118 INFO L87 Difference]: Start difference. First operand 933 states and 1390 transitions. Second operand 5 states. [2019-09-08 12:23:27,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:27,418 INFO L93 Difference]: Finished difference Result 1797 states and 2701 transitions. [2019-09-08 12:23:27,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:23:27,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-08 12:23:27,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:27,427 INFO L225 Difference]: With dead ends: 1797 [2019-09-08 12:23:27,427 INFO L226 Difference]: Without dead ends: 1527 [2019-09-08 12:23:27,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:23:27,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2019-09-08 12:23:27,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1359. [2019-09-08 12:23:27,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1359 states. [2019-09-08 12:23:27,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 2041 transitions. [2019-09-08 12:23:27,621 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 2041 transitions. Word has length 102 [2019-09-08 12:23:27,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:27,622 INFO L475 AbstractCegarLoop]: Abstraction has 1359 states and 2041 transitions. [2019-09-08 12:23:27,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:23:27,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 2041 transitions. [2019-09-08 12:23:27,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:23:27,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:27,624 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:23:27,624 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:27,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:27,625 INFO L82 PathProgramCache]: Analyzing trace with hash 602278735, now seen corresponding path program 1 times [2019-09-08 12:23:27,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:27,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:27,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:27,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:27,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:27,693 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 12:23:27,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:27,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:23:27,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:23:27,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:23:27,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:23:27,695 INFO L87 Difference]: Start difference. First operand 1359 states and 2041 transitions. Second operand 3 states. [2019-09-08 12:23:27,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:27,907 INFO L93 Difference]: Finished difference Result 2597 states and 3928 transitions. [2019-09-08 12:23:27,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:23:27,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-08 12:23:27,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:27,916 INFO L225 Difference]: With dead ends: 2597 [2019-09-08 12:23:27,916 INFO L226 Difference]: Without dead ends: 1499 [2019-09-08 12:23:27,921 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 12:23:27,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2019-09-08 12:23:28,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1497. [2019-09-08 12:23:28,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1497 states. [2019-09-08 12:23:28,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 2236 transitions. [2019-09-08 12:23:28,150 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 2236 transitions. Word has length 102 [2019-09-08 12:23:28,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:28,150 INFO L475 AbstractCegarLoop]: Abstraction has 1497 states and 2236 transitions. [2019-09-08 12:23:28,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:23:28,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 2236 transitions. [2019-09-08 12:23:28,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:23:28,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:28,154 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:23:28,155 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:28,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:28,155 INFO L82 PathProgramCache]: Analyzing trace with hash 359154384, now seen corresponding path program 1 times [2019-09-08 12:23:28,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:28,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:28,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:28,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:28,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:28,221 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 12:23:28,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:28,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:23:28,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:23:28,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:23:28,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:23:28,223 INFO L87 Difference]: Start difference. First operand 1497 states and 2236 transitions. Second operand 3 states. [2019-09-08 12:23:28,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:28,649 INFO L93 Difference]: Finished difference Result 3857 states and 5786 transitions. [2019-09-08 12:23:28,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:23:28,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-08 12:23:28,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:28,663 INFO L225 Difference]: With dead ends: 3857 [2019-09-08 12:23:28,663 INFO L226 Difference]: Without dead ends: 2621 [2019-09-08 12:23:28,667 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 12:23:28,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2621 states. [2019-09-08 12:23:28,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2621 to 2583. [2019-09-08 12:23:28,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2583 states. [2019-09-08 12:23:28,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2583 states to 2583 states and 3829 transitions. [2019-09-08 12:23:28,968 INFO L78 Accepts]: Start accepts. Automaton has 2583 states and 3829 transitions. Word has length 102 [2019-09-08 12:23:28,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:28,969 INFO L475 AbstractCegarLoop]: Abstraction has 2583 states and 3829 transitions. [2019-09-08 12:23:28,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:23:28,969 INFO L276 IsEmpty]: Start isEmpty. Operand 2583 states and 3829 transitions. [2019-09-08 12:23:28,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:23:28,971 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:28,971 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:23:28,971 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:28,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:28,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1507490450, now seen corresponding path program 1 times [2019-09-08 12:23:28,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:28,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:28,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:28,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:28,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:29,205 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 12:23:29,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:29,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:23:29,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:23:29,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:23:29,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:23:29,207 INFO L87 Difference]: Start difference. First operand 2583 states and 3829 transitions. Second operand 8 states. [2019-09-08 12:23:30,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:30,355 INFO L93 Difference]: Finished difference Result 8311 states and 12381 transitions. [2019-09-08 12:23:30,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:23:30,356 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2019-09-08 12:23:30,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:30,390 INFO L225 Difference]: With dead ends: 8311 [2019-09-08 12:23:30,390 INFO L226 Difference]: Without dead ends: 7285 [2019-09-08 12:23:30,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:23:30,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7285 states. [2019-09-08 12:23:30,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7285 to 3103. [2019-09-08 12:23:30,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3103 states. [2019-09-08 12:23:30,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3103 states to 3103 states and 4603 transitions. [2019-09-08 12:23:30,870 INFO L78 Accepts]: Start accepts. Automaton has 3103 states and 4603 transitions. Word has length 102 [2019-09-08 12:23:30,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:30,870 INFO L475 AbstractCegarLoop]: Abstraction has 3103 states and 4603 transitions. [2019-09-08 12:23:30,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:23:30,870 INFO L276 IsEmpty]: Start isEmpty. Operand 3103 states and 4603 transitions. [2019-09-08 12:23:30,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:23:30,872 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:30,872 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:23:30,873 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:30,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:30,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1474006360, now seen corresponding path program 1 times [2019-09-08 12:23:30,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:30,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:30,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:30,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:30,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:30,991 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 12:23:30,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:30,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:23:30,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:23:30,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:23:30,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:23:30,993 INFO L87 Difference]: Start difference. First operand 3103 states and 4603 transitions. Second operand 5 states. [2019-09-08 12:23:31,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:31,473 INFO L93 Difference]: Finished difference Result 4765 states and 7080 transitions. [2019-09-08 12:23:31,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:23:31,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-08 12:23:31,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:31,492 INFO L225 Difference]: With dead ends: 4765 [2019-09-08 12:23:31,492 INFO L226 Difference]: Without dead ends: 3739 [2019-09-08 12:23:31,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:23:31,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3739 states. [2019-09-08 12:23:31,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3739 to 3383. [2019-09-08 12:23:31,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3383 states. [2019-09-08 12:23:31,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3383 states to 3383 states and 5023 transitions. [2019-09-08 12:23:31,862 INFO L78 Accepts]: Start accepts. Automaton has 3383 states and 5023 transitions. Word has length 102 [2019-09-08 12:23:31,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:31,863 INFO L475 AbstractCegarLoop]: Abstraction has 3383 states and 5023 transitions. [2019-09-08 12:23:31,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:23:31,863 INFO L276 IsEmpty]: Start isEmpty. Operand 3383 states and 5023 transitions. [2019-09-08 12:23:31,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:23:31,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:31,865 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:23:31,865 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:31,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:31,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1383468205, now seen corresponding path program 1 times [2019-09-08 12:23:31,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:31,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:31,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:31,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:31,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:31,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:32,023 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 12:23:32,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:32,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:23:32,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:23:32,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:23:32,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:23:32,059 INFO L87 Difference]: Start difference. First operand 3383 states and 5023 transitions. Second operand 8 states. [2019-09-08 12:23:33,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:33,146 INFO L93 Difference]: Finished difference Result 9730 states and 14504 transitions. [2019-09-08 12:23:33,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:23:33,147 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2019-09-08 12:23:33,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:33,177 INFO L225 Difference]: With dead ends: 9730 [2019-09-08 12:23:33,177 INFO L226 Difference]: Without dead ends: 8446 [2019-09-08 12:23:33,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:23:33,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8446 states. [2019-09-08 12:23:33,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8446 to 3922. [2019-09-08 12:23:33,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3922 states. [2019-09-08 12:23:33,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3922 states to 3922 states and 5828 transitions. [2019-09-08 12:23:33,615 INFO L78 Accepts]: Start accepts. Automaton has 3922 states and 5828 transitions. Word has length 102 [2019-09-08 12:23:33,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:33,616 INFO L475 AbstractCegarLoop]: Abstraction has 3922 states and 5828 transitions. [2019-09-08 12:23:33,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:23:33,616 INFO L276 IsEmpty]: Start isEmpty. Operand 3922 states and 5828 transitions. [2019-09-08 12:23:33,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:23:33,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:33,618 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:23:33,619 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:33,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:33,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1488862363, now seen corresponding path program 1 times [2019-09-08 12:23:33,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:33,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:33,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:33,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:33,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:33,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:33,723 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 12:23:33,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:33,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:23:33,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:23:33,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:23:33,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:23:33,727 INFO L87 Difference]: Start difference. First operand 3922 states and 5828 transitions. Second operand 5 states. [2019-09-08 12:23:34,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:34,350 INFO L93 Difference]: Finished difference Result 6650 states and 9868 transitions. [2019-09-08 12:23:34,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 12:23:34,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-08 12:23:34,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:34,367 INFO L225 Difference]: With dead ends: 6650 [2019-09-08 12:23:34,367 INFO L226 Difference]: Without dead ends: 6648 [2019-09-08 12:23:34,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 12:23:34,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6648 states. [2019-09-08 12:23:34,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6648 to 3950. [2019-09-08 12:23:34,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3950 states. [2019-09-08 12:23:34,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3950 states to 3950 states and 5844 transitions. [2019-09-08 12:23:34,812 INFO L78 Accepts]: Start accepts. Automaton has 3950 states and 5844 transitions. Word has length 103 [2019-09-08 12:23:34,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:34,812 INFO L475 AbstractCegarLoop]: Abstraction has 3950 states and 5844 transitions. [2019-09-08 12:23:34,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:23:34,812 INFO L276 IsEmpty]: Start isEmpty. Operand 3950 states and 5844 transitions. [2019-09-08 12:23:34,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:23:34,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:34,815 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:23:34,815 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:34,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:34,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1518421097, now seen corresponding path program 1 times [2019-09-08 12:23:34,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:34,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:34,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:34,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:34,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:35,063 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 12:23:35,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:35,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:23:35,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:23:35,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:23:35,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:23:35,065 INFO L87 Difference]: Start difference. First operand 3950 states and 5844 transitions. Second operand 9 states. [2019-09-08 12:23:36,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:36,645 INFO L93 Difference]: Finished difference Result 11348 states and 16826 transitions. [2019-09-08 12:23:36,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 12:23:36,645 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-08 12:23:36,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:36,663 INFO L225 Difference]: With dead ends: 11348 [2019-09-08 12:23:36,663 INFO L226 Difference]: Without dead ends: 7607 [2019-09-08 12:23:36,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:23:36,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7607 states. [2019-09-08 12:23:37,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7607 to 3950. [2019-09-08 12:23:37,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3950 states. [2019-09-08 12:23:37,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3950 states to 3950 states and 5843 transitions. [2019-09-08 12:23:37,183 INFO L78 Accepts]: Start accepts. Automaton has 3950 states and 5843 transitions. Word has length 103 [2019-09-08 12:23:37,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:37,183 INFO L475 AbstractCegarLoop]: Abstraction has 3950 states and 5843 transitions. [2019-09-08 12:23:37,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:23:37,184 INFO L276 IsEmpty]: Start isEmpty. Operand 3950 states and 5843 transitions. [2019-09-08 12:23:37,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:23:37,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:37,186 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:23:37,186 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:37,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:37,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1934155735, now seen corresponding path program 1 times [2019-09-08 12:23:37,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:37,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:37,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:37,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:37,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:37,389 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 12:23:37,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:37,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:23:37,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:23:37,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:23:37,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:23:37,391 INFO L87 Difference]: Start difference. First operand 3950 states and 5843 transitions. Second operand 10 states. [2019-09-08 12:23:39,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:39,282 INFO L93 Difference]: Finished difference Result 10627 states and 15712 transitions. [2019-09-08 12:23:39,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 12:23:39,283 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 104 [2019-09-08 12:23:39,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:39,293 INFO L225 Difference]: With dead ends: 10627 [2019-09-08 12:23:39,294 INFO L226 Difference]: Without dead ends: 6825 [2019-09-08 12:23:39,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2019-09-08 12:23:39,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6825 states. [2019-09-08 12:23:39,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6825 to 3950. [2019-09-08 12:23:39,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3950 states. [2019-09-08 12:23:39,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3950 states to 3950 states and 5840 transitions. [2019-09-08 12:23:39,814 INFO L78 Accepts]: Start accepts. Automaton has 3950 states and 5840 transitions. Word has length 104 [2019-09-08 12:23:39,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:39,814 INFO L475 AbstractCegarLoop]: Abstraction has 3950 states and 5840 transitions. [2019-09-08 12:23:39,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:23:39,814 INFO L276 IsEmpty]: Start isEmpty. Operand 3950 states and 5840 transitions. [2019-09-08 12:23:39,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:23:39,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:39,816 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:23:39,816 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:39,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:39,816 INFO L82 PathProgramCache]: Analyzing trace with hash 85263168, now seen corresponding path program 1 times [2019-09-08 12:23:39,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:39,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:39,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:39,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:39,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:40,122 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 18 [2019-09-08 12:23:40,203 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 12:23:40,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:40,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:23:40,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:23:40,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:23:40,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:23:40,205 INFO L87 Difference]: Start difference. First operand 3950 states and 5840 transitions. Second operand 10 states. [2019-09-08 12:23:41,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:41,941 INFO L93 Difference]: Finished difference Result 11651 states and 17236 transitions. [2019-09-08 12:23:41,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:23:41,942 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 104 [2019-09-08 12:23:41,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:41,958 INFO L225 Difference]: With dead ends: 11651 [2019-09-08 12:23:41,959 INFO L226 Difference]: Without dead ends: 7864 [2019-09-08 12:23:41,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:23:41,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7864 states. [2019-09-08 12:23:42,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7864 to 3950. [2019-09-08 12:23:42,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3950 states. [2019-09-08 12:23:42,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3950 states to 3950 states and 5834 transitions. [2019-09-08 12:23:42,619 INFO L78 Accepts]: Start accepts. Automaton has 3950 states and 5834 transitions. Word has length 104 [2019-09-08 12:23:42,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:42,619 INFO L475 AbstractCegarLoop]: Abstraction has 3950 states and 5834 transitions. [2019-09-08 12:23:42,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:23:42,619 INFO L276 IsEmpty]: Start isEmpty. Operand 3950 states and 5834 transitions. [2019-09-08 12:23:42,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:23:42,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:42,621 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:42,621 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:42,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:42,622 INFO L82 PathProgramCache]: Analyzing trace with hash 37876548, now seen corresponding path program 1 times [2019-09-08 12:23:42,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:42,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:42,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:42,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:42,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:42,858 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 12:23:42,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:42,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:23:42,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:23:42,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:23:42,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:23:42,860 INFO L87 Difference]: Start difference. First operand 3950 states and 5834 transitions. Second operand 10 states. [2019-09-08 12:23:44,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:44,660 INFO L93 Difference]: Finished difference Result 11431 states and 16878 transitions. [2019-09-08 12:23:44,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:23:44,661 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-09-08 12:23:44,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:44,674 INFO L225 Difference]: With dead ends: 11431 [2019-09-08 12:23:44,674 INFO L226 Difference]: Without dead ends: 7774 [2019-09-08 12:23:44,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:23:44,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7774 states. [2019-09-08 12:23:45,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7774 to 3950. [2019-09-08 12:23:45,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3950 states. [2019-09-08 12:23:45,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3950 states to 3950 states and 5821 transitions. [2019-09-08 12:23:45,248 INFO L78 Accepts]: Start accepts. Automaton has 3950 states and 5821 transitions. Word has length 105 [2019-09-08 12:23:45,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:45,249 INFO L475 AbstractCegarLoop]: Abstraction has 3950 states and 5821 transitions. [2019-09-08 12:23:45,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:23:45,249 INFO L276 IsEmpty]: Start isEmpty. Operand 3950 states and 5821 transitions. [2019-09-08 12:23:45,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 12:23:45,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:45,250 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:45,250 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:45,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:45,251 INFO L82 PathProgramCache]: Analyzing trace with hash -6182625, now seen corresponding path program 1 times [2019-09-08 12:23:45,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:45,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:45,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:45,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:45,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:45,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:45,472 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 12:23:45,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:45,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:23:45,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:23:45,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:23:45,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:23:45,474 INFO L87 Difference]: Start difference. First operand 3950 states and 5821 transitions. Second operand 10 states. [2019-09-08 12:23:47,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:47,559 INFO L93 Difference]: Finished difference Result 11606 states and 17123 transitions. [2019-09-08 12:23:47,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:23:47,560 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-09-08 12:23:47,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:47,570 INFO L225 Difference]: With dead ends: 11606 [2019-09-08 12:23:47,570 INFO L226 Difference]: Without dead ends: 7849 [2019-09-08 12:23:47,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:23:47,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7849 states. [2019-09-08 12:23:48,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7849 to 3950. [2019-09-08 12:23:48,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3950 states. [2019-09-08 12:23:48,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3950 states to 3950 states and 5812 transitions. [2019-09-08 12:23:48,514 INFO L78 Accepts]: Start accepts. Automaton has 3950 states and 5812 transitions. Word has length 106 [2019-09-08 12:23:48,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:48,514 INFO L475 AbstractCegarLoop]: Abstraction has 3950 states and 5812 transitions. [2019-09-08 12:23:48,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:23:48,514 INFO L276 IsEmpty]: Start isEmpty. Operand 3950 states and 5812 transitions. [2019-09-08 12:23:48,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:23:48,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:48,516 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:48,516 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:48,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:48,517 INFO L82 PathProgramCache]: Analyzing trace with hash -361867127, now seen corresponding path program 1 times [2019-09-08 12:23:48,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:48,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:48,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:48,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:48,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:48,734 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 12:23:48,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:48,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:23:48,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:23:48,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:23:48,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:23:48,736 INFO L87 Difference]: Start difference. First operand 3950 states and 5812 transitions. Second operand 10 states. [2019-09-08 12:23:50,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:50,765 INFO L93 Difference]: Finished difference Result 11531 states and 16994 transitions. [2019-09-08 12:23:50,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:23:50,766 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 107 [2019-09-08 12:23:50,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:50,773 INFO L225 Difference]: With dead ends: 11531 [2019-09-08 12:23:50,773 INFO L226 Difference]: Without dead ends: 7819 [2019-09-08 12:23:50,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:23:50,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7819 states. [2019-09-08 12:23:51,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7819 to 3950. [2019-09-08 12:23:51,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3950 states. [2019-09-08 12:23:51,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3950 states to 3950 states and 5801 transitions. [2019-09-08 12:23:51,359 INFO L78 Accepts]: Start accepts. Automaton has 3950 states and 5801 transitions. Word has length 107 [2019-09-08 12:23:51,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:51,360 INFO L475 AbstractCegarLoop]: Abstraction has 3950 states and 5801 transitions. [2019-09-08 12:23:51,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:23:51,360 INFO L276 IsEmpty]: Start isEmpty. Operand 3950 states and 5801 transitions. [2019-09-08 12:23:51,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:23:51,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:51,361 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:51,361 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:51,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:51,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1928807370, now seen corresponding path program 1 times [2019-09-08 12:23:51,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:51,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:51,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:51,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:51,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:52,346 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-08 12:23:53,230 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 12:23:53,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:53,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-08 12:23:53,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 12:23:53,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 12:23:53,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:23:53,232 INFO L87 Difference]: Start difference. First operand 3950 states and 5801 transitions. Second operand 25 states. [2019-09-08 12:23:54,402 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 41 [2019-09-08 12:23:54,769 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2019-09-08 12:23:55,198 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 81 [2019-09-08 12:23:55,611 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 92 [2019-09-08 12:23:56,139 WARN L188 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 123 [2019-09-08 12:23:56,860 WARN L188 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 138 [2019-09-08 12:23:57,126 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 [2019-09-08 12:23:57,310 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-09-08 12:23:57,698 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-09-08 12:23:58,129 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2019-09-08 12:23:58,372 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2019-09-08 12:23:58,741 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2019-09-08 12:23:59,239 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 44 [2019-09-08 12:23:59,653 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 44 [2019-09-08 12:24:04,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:04,054 INFO L93 Difference]: Finished difference Result 14397 states and 21276 transitions. [2019-09-08 12:24:04,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 12:24:04,054 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 108 [2019-09-08 12:24:04,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:04,066 INFO L225 Difference]: With dead ends: 14397 [2019-09-08 12:24:04,066 INFO L226 Difference]: Without dead ends: 12535 [2019-09-08 12:24:04,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=495, Invalid=2055, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 12:24:04,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12535 states. [2019-09-08 12:24:04,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12535 to 3965. [2019-09-08 12:24:04,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3965 states. [2019-09-08 12:24:04,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3965 states to 3965 states and 5814 transitions. [2019-09-08 12:24:04,787 INFO L78 Accepts]: Start accepts. Automaton has 3965 states and 5814 transitions. Word has length 108 [2019-09-08 12:24:04,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:04,787 INFO L475 AbstractCegarLoop]: Abstraction has 3965 states and 5814 transitions. [2019-09-08 12:24:04,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 12:24:04,788 INFO L276 IsEmpty]: Start isEmpty. Operand 3965 states and 5814 transitions. [2019-09-08 12:24:04,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:24:04,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:04,789 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:04,789 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:04,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:04,790 INFO L82 PathProgramCache]: Analyzing trace with hash -2012504660, now seen corresponding path program 1 times [2019-09-08 12:24:04,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:04,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:04,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:04,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:04,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:05,842 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-08 12:24:06,006 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-09-08 12:24:06,154 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-08 12:24:06,339 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-09-08 12:24:06,492 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-08 12:24:06,695 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-08 12:24:06,854 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-08 12:24:07,039 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-09-08 12:24:07,207 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-08 12:24:07,402 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-09-08 12:24:08,772 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 12:24:08,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:08,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2019-09-08 12:24:08,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 12:24:08,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 12:24:08,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1167, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 12:24:08,774 INFO L87 Difference]: Start difference. First operand 3965 states and 5814 transitions. Second operand 36 states. [2019-09-08 12:24:08,989 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2019-09-08 12:24:10,279 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 42 [2019-09-08 12:24:10,477 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 41 [2019-09-08 12:24:11,106 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2019-09-08 12:24:11,431 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 59 [2019-09-08 12:24:11,791 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 73 [2019-09-08 12:24:12,250 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 92 [2019-09-08 12:24:12,764 WARN L188 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 103 [2019-09-08 12:24:13,423 WARN L188 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 124 [2019-09-08 12:24:14,202 WARN L188 SmtUtils]: Spent 685.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 137 [2019-09-08 12:24:15,151 WARN L188 SmtUtils]: Spent 816.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 156 [2019-09-08 12:24:16,320 WARN L188 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 228 DAG size of output: 176 [2019-09-08 12:24:17,731 WARN L188 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 250 DAG size of output: 195 [2019-09-08 12:24:18,105 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 86 [2019-09-08 12:24:18,470 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 86 [2019-09-08 12:24:19,224 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 83 [2019-09-08 12:24:19,793 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 83 [2019-09-08 12:24:20,564 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 77 [2019-09-08 12:24:21,252 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 77 [2019-09-08 12:24:22,157 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 71 [2019-09-08 12:24:22,859 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 71 [2019-09-08 12:24:24,889 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 64 [2019-09-08 12:24:35,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:35,427 INFO L93 Difference]: Finished difference Result 18592 states and 27478 transitions. [2019-09-08 12:24:35,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-08 12:24:35,427 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 108 [2019-09-08 12:24:35,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:35,443 INFO L225 Difference]: With dead ends: 18592 [2019-09-08 12:24:35,443 INFO L226 Difference]: Without dead ends: 16772 [2019-09-08 12:24:35,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=961, Invalid=4441, Unknown=0, NotChecked=0, Total=5402 [2019-09-08 12:24:35,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16772 states. [2019-09-08 12:24:36,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16772 to 4050. [2019-09-08 12:24:36,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4050 states. [2019-09-08 12:24:36,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4050 states to 4050 states and 5927 transitions. [2019-09-08 12:24:36,348 INFO L78 Accepts]: Start accepts. Automaton has 4050 states and 5927 transitions. Word has length 108 [2019-09-08 12:24:36,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:36,349 INFO L475 AbstractCegarLoop]: Abstraction has 4050 states and 5927 transitions. [2019-09-08 12:24:36,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 12:24:36,349 INFO L276 IsEmpty]: Start isEmpty. Operand 4050 states and 5927 transitions. [2019-09-08 12:24:36,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:24:36,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:36,351 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:36,351 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:36,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:36,351 INFO L82 PathProgramCache]: Analyzing trace with hash -409687476, now seen corresponding path program 1 times [2019-09-08 12:24:36,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:36,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:36,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:36,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:36,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:36,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:37,780 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-08 12:24:40,052 WARN L188 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-09-08 12:24:40,207 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 12:24:40,516 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-08 12:24:41,017 WARN L188 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-08 12:24:43,820 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-08 12:24:44,889 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 12:24:44,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:44,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2019-09-08 12:24:44,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 12:24:44,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 12:24:44,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1169, Unknown=1, NotChecked=0, Total=1260 [2019-09-08 12:24:44,891 INFO L87 Difference]: Start difference. First operand 4050 states and 5927 transitions. Second operand 36 states. [2019-09-08 12:24:45,419 WARN L188 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 140 [2019-09-08 12:24:46,275 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-08 12:24:46,462 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-08 12:24:46,687 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-08 12:24:46,921 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 12:24:47,205 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-08 12:24:47,951 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-08 12:24:48,406 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2019-09-08 12:24:48,885 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 112 [2019-09-08 12:24:49,627 WARN L188 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 134 [2019-09-08 12:24:50,512 WARN L188 SmtUtils]: Spent 698.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 151 [2019-09-08 12:24:53,178 WARN L188 SmtUtils]: Spent 2.42 s on a formula simplification. DAG size of input: 190 DAG size of output: 168 [2019-09-08 12:24:58,609 WARN L188 SmtUtils]: Spent 5.23 s on a formula simplification. DAG size of input: 212 DAG size of output: 190 [2019-09-08 12:25:49,133 WARN L188 SmtUtils]: Spent 50.19 s on a formula simplification. DAG size of input: 241 DAG size of output: 218 [2019-09-08 12:26:43,510 WARN L188 SmtUtils]: Spent 54.14 s on a formula simplification. DAG size of input: 267 DAG size of output: 243 [2019-09-08 12:27:14,453 WARN L188 SmtUtils]: Spent 28.58 s on a formula simplification. DAG size of input: 292 DAG size of output: 267 [2019-09-08 12:27:17,379 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 111 [2019-09-08 12:27:17,824 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 111 [2019-09-08 12:27:18,189 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 93 [2019-09-08 12:27:18,479 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 81 [2019-09-08 12:27:18,775 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 81 [2019-09-08 12:27:21,730 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 91 [2019-09-08 12:27:33,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:33,146 INFO L93 Difference]: Finished difference Result 16000 states and 23616 transitions. [2019-09-08 12:27:33,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-08 12:27:33,147 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 108 [2019-09-08 12:27:33,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:33,160 INFO L225 Difference]: With dead ends: 16000 [2019-09-08 12:27:33,161 INFO L226 Difference]: Without dead ends: 14702 [2019-09-08 12:27:33,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 156.1s TimeCoverageRelationStatistics Valid=738, Invalid=3551, Unknown=1, NotChecked=0, Total=4290 [2019-09-08 12:27:33,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14702 states. [2019-09-08 12:27:34,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14702 to 4069. [2019-09-08 12:27:34,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4069 states. [2019-09-08 12:27:34,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4069 states to 4069 states and 5951 transitions. [2019-09-08 12:27:34,386 INFO L78 Accepts]: Start accepts. Automaton has 4069 states and 5951 transitions. Word has length 108 [2019-09-08 12:27:34,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:34,386 INFO L475 AbstractCegarLoop]: Abstraction has 4069 states and 5951 transitions. [2019-09-08 12:27:34,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 12:27:34,387 INFO L276 IsEmpty]: Start isEmpty. Operand 4069 states and 5951 transitions. [2019-09-08 12:27:34,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:27:34,388 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:34,388 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:34,388 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:34,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:34,389 INFO L82 PathProgramCache]: Analyzing trace with hash -32217364, now seen corresponding path program 1 times [2019-09-08 12:27:34,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:34,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:34,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:34,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:34,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:35,347 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 12:27:35,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:35,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 12:27:35,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 12:27:35,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 12:27:35,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:27:35,348 INFO L87 Difference]: Start difference. First operand 4069 states and 5951 transitions. Second operand 19 states. [2019-09-08 12:27:35,934 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-08 12:27:36,153 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-08 12:27:36,587 WARN L188 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 82 [2019-09-08 12:27:37,044 WARN L188 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 87 [2019-09-08 12:27:37,233 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-08 12:27:37,583 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-08 12:27:37,902 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-08 12:27:38,068 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-08 12:27:38,342 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-08 12:27:43,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:43,309 INFO L93 Difference]: Finished difference Result 16879 states and 24933 transitions. [2019-09-08 12:27:43,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:27:43,314 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 108 [2019-09-08 12:27:43,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:43,330 INFO L225 Difference]: With dead ends: 16879 [2019-09-08 12:27:43,330 INFO L226 Difference]: Without dead ends: 15545 [2019-09-08 12:27:43,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:27:43,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15545 states. [2019-09-08 12:27:44,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15545 to 4079. [2019-09-08 12:27:44,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4079 states. [2019-09-08 12:27:44,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4079 states to 4079 states and 5953 transitions. [2019-09-08 12:27:44,496 INFO L78 Accepts]: Start accepts. Automaton has 4079 states and 5953 transitions. Word has length 108 [2019-09-08 12:27:44,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:44,496 INFO L475 AbstractCegarLoop]: Abstraction has 4079 states and 5953 transitions. [2019-09-08 12:27:44,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 12:27:44,496 INFO L276 IsEmpty]: Start isEmpty. Operand 4079 states and 5953 transitions. [2019-09-08 12:27:44,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:27:44,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:44,497 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:44,498 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:44,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:44,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1699265207, now seen corresponding path program 1 times [2019-09-08 12:27:44,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:44,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:44,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:44,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:44,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:45,605 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 12:27:45,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:45,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 12:27:45,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 12:27:45,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 12:27:45,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:27:45,607 INFO L87 Difference]: Start difference. First operand 4079 states and 5953 transitions. Second operand 19 states. [2019-09-08 12:27:46,247 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 37 [2019-09-08 12:27:46,435 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-08 12:27:46,808 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 86 [2019-09-08 12:27:47,149 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 99 [2019-09-08 12:27:47,345 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-08 12:27:47,764 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-08 12:27:48,062 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-08 12:27:48,236 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-09-08 12:27:48,505 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-09-08 12:27:53,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:53,998 INFO L93 Difference]: Finished difference Result 16778 states and 24782 transitions. [2019-09-08 12:27:53,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:27:53,998 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 108 [2019-09-08 12:27:53,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:54,012 INFO L225 Difference]: With dead ends: 16778 [2019-09-08 12:27:54,012 INFO L226 Difference]: Without dead ends: 15478 [2019-09-08 12:27:54,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:27:54,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15478 states. [2019-09-08 12:27:55,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15478 to 4069. [2019-09-08 12:27:55,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4069 states. [2019-09-08 12:27:55,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4069 states to 4069 states and 5935 transitions. [2019-09-08 12:27:55,258 INFO L78 Accepts]: Start accepts. Automaton has 4069 states and 5935 transitions. Word has length 108 [2019-09-08 12:27:55,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:55,258 INFO L475 AbstractCegarLoop]: Abstraction has 4069 states and 5935 transitions. [2019-09-08 12:27:55,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 12:27:55,258 INFO L276 IsEmpty]: Start isEmpty. Operand 4069 states and 5935 transitions. [2019-09-08 12:27:55,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:27:55,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:55,259 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:55,260 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:55,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:55,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1049438965, now seen corresponding path program 1 times [2019-09-08 12:27:55,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:55,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:55,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:55,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:55,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:56,078 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 12:27:56,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:56,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:27:56,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:27:56,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:27:56,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:27:56,079 INFO L87 Difference]: Start difference. First operand 4069 states and 5935 transitions. Second operand 17 states. [2019-09-08 12:27:56,699 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-08 12:27:56,866 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-08 12:27:57,143 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2019-09-08 12:27:57,309 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-08 12:27:57,513 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-08 12:27:57,746 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-08 12:27:57,949 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-08 12:27:58,125 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-08 12:28:03,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:03,391 INFO L93 Difference]: Finished difference Result 15076 states and 22249 transitions. [2019-09-08 12:28:03,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 12:28:03,392 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 108 [2019-09-08 12:28:03,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:03,403 INFO L225 Difference]: With dead ends: 15076 [2019-09-08 12:28:03,403 INFO L226 Difference]: Without dead ends: 13167 [2019-09-08 12:28:03,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=260, Invalid=862, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 12:28:03,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13167 states. [2019-09-08 12:28:04,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13167 to 4034. [2019-09-08 12:28:04,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4034 states. [2019-09-08 12:28:04,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4034 states to 4034 states and 5885 transitions. [2019-09-08 12:28:04,790 INFO L78 Accepts]: Start accepts. Automaton has 4034 states and 5885 transitions. Word has length 108 [2019-09-08 12:28:04,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:04,790 INFO L475 AbstractCegarLoop]: Abstraction has 4034 states and 5885 transitions. [2019-09-08 12:28:04,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:28:04,790 INFO L276 IsEmpty]: Start isEmpty. Operand 4034 states and 5885 transitions. [2019-09-08 12:28:04,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 12:28:04,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:04,791 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:04,791 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:04,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:04,791 INFO L82 PathProgramCache]: Analyzing trace with hash 914669364, now seen corresponding path program 1 times [2019-09-08 12:28:04,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:04,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:04,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:04,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:04,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:04,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:05,672 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 12:28:05,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:05,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 12:28:05,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 12:28:05,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 12:28:05,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:28:05,674 INFO L87 Difference]: Start difference. First operand 4034 states and 5885 transitions. Second operand 19 states. [2019-09-08 12:28:06,279 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-09-08 12:28:06,493 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-09-08 12:28:06,808 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2019-09-08 12:28:07,135 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-09-08 12:28:07,325 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-08 12:28:07,705 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-08 12:28:07,995 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-08 12:28:12,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:12,979 INFO L93 Difference]: Finished difference Result 14261 states and 21017 transitions. [2019-09-08 12:28:12,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 12:28:12,980 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 109 [2019-09-08 12:28:12,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:12,996 INFO L225 Difference]: With dead ends: 14261 [2019-09-08 12:28:12,996 INFO L226 Difference]: Without dead ends: 12369 [2019-09-08 12:28:13,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=236, Invalid=954, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 12:28:13,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12369 states. [2019-09-08 12:28:14,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12369 to 4009. [2019-09-08 12:28:14,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4009 states. [2019-09-08 12:28:14,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4009 states to 4009 states and 5854 transitions. [2019-09-08 12:28:14,481 INFO L78 Accepts]: Start accepts. Automaton has 4009 states and 5854 transitions. Word has length 109 [2019-09-08 12:28:14,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:14,481 INFO L475 AbstractCegarLoop]: Abstraction has 4009 states and 5854 transitions. [2019-09-08 12:28:14,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 12:28:14,481 INFO L276 IsEmpty]: Start isEmpty. Operand 4009 states and 5854 transitions. [2019-09-08 12:28:14,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 12:28:14,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:14,482 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:14,483 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:14,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:14,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1552482483, now seen corresponding path program 1 times [2019-09-08 12:28:14,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:14,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:14,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:14,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:14,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:14,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:15,462 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 12:28:15,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:15,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 12:28:15,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 12:28:15,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 12:28:15,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-09-08 12:28:15,464 INFO L87 Difference]: Start difference. First operand 4009 states and 5854 transitions. Second operand 18 states. [2019-09-08 12:28:16,239 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-09-08 12:28:16,442 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-09-08 12:28:16,753 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2019-09-08 12:28:16,957 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-08 12:28:17,156 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-08 12:28:17,392 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-08 12:28:17,620 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-08 12:28:17,813 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-08 12:28:18,195 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-09-08 12:28:18,364 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-09-08 12:28:18,645 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-09-08 12:28:29,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:29,357 INFO L93 Difference]: Finished difference Result 29583 states and 43811 transitions. [2019-09-08 12:28:29,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:28:29,358 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 109 [2019-09-08 12:28:29,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:29,385 INFO L225 Difference]: With dead ends: 29583 [2019-09-08 12:28:29,385 INFO L226 Difference]: Without dead ends: 27763 [2019-09-08 12:28:29,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=298, Invalid=1108, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 12:28:29,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27763 states. [2019-09-08 12:28:30,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27763 to 3953. [2019-09-08 12:28:30,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3953 states. [2019-09-08 12:28:30,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3953 states to 3953 states and 5778 transitions. [2019-09-08 12:28:30,922 INFO L78 Accepts]: Start accepts. Automaton has 3953 states and 5778 transitions. Word has length 109 [2019-09-08 12:28:30,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:30,922 INFO L475 AbstractCegarLoop]: Abstraction has 3953 states and 5778 transitions. [2019-09-08 12:28:30,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 12:28:30,922 INFO L276 IsEmpty]: Start isEmpty. Operand 3953 states and 5778 transitions. [2019-09-08 12:28:30,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 12:28:30,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:30,924 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:30,924 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:30,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:30,924 INFO L82 PathProgramCache]: Analyzing trace with hash -528155211, now seen corresponding path program 1 times [2019-09-08 12:28:30,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:30,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:30,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:30,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:30,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:30,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:31,040 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 12:28:31,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:31,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:28:31,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:28:31,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:28:31,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:28:31,042 INFO L87 Difference]: Start difference. First operand 3953 states and 5778 transitions. Second operand 4 states. [2019-09-08 12:28:33,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:33,186 INFO L93 Difference]: Finished difference Result 9244 states and 13638 transitions. [2019-09-08 12:28:33,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:28:33,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-09-08 12:28:33,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:33,191 INFO L225 Difference]: With dead ends: 9244 [2019-09-08 12:28:33,192 INFO L226 Difference]: Without dead ends: 5600 [2019-09-08 12:28:33,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:28:33,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5600 states. [2019-09-08 12:28:35,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5600 to 5572. [2019-09-08 12:28:35,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5572 states. [2019-09-08 12:28:35,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5572 states to 5572 states and 8141 transitions. [2019-09-08 12:28:35,240 INFO L78 Accepts]: Start accepts. Automaton has 5572 states and 8141 transitions. Word has length 109 [2019-09-08 12:28:35,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:35,240 INFO L475 AbstractCegarLoop]: Abstraction has 5572 states and 8141 transitions. [2019-09-08 12:28:35,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:28:35,240 INFO L276 IsEmpty]: Start isEmpty. Operand 5572 states and 8141 transitions. [2019-09-08 12:28:35,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 12:28:35,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:35,241 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:35,241 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:35,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:35,242 INFO L82 PathProgramCache]: Analyzing trace with hash -2012181736, now seen corresponding path program 1 times [2019-09-08 12:28:35,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:35,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:35,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:35,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:35,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:36,324 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 12:28:36,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:36,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 12:28:36,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 12:28:36,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 12:28:36,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:28:36,325 INFO L87 Difference]: Start difference. First operand 5572 states and 8141 transitions. Second operand 19 states. [2019-09-08 12:28:37,121 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-08 12:28:37,428 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2019-09-08 12:28:37,786 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 98 [2019-09-08 12:28:37,964 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-08 12:28:38,348 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-08 12:28:38,577 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-09-08 12:28:38,804 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2019-09-08 12:28:39,036 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2019-09-08 12:28:49,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:49,502 INFO L93 Difference]: Finished difference Result 27137 states and 39946 transitions. [2019-09-08 12:28:49,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:28:49,503 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 109 [2019-09-08 12:28:49,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:49,525 INFO L225 Difference]: With dead ends: 27137 [2019-09-08 12:28:49,525 INFO L226 Difference]: Without dead ends: 24393 [2019-09-08 12:28:49,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:28:49,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24393 states. [2019-09-08 12:28:51,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24393 to 5572. [2019-09-08 12:28:51,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5572 states. [2019-09-08 12:28:51,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5572 states to 5572 states and 8135 transitions. [2019-09-08 12:28:51,886 INFO L78 Accepts]: Start accepts. Automaton has 5572 states and 8135 transitions. Word has length 109 [2019-09-08 12:28:51,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:51,886 INFO L475 AbstractCegarLoop]: Abstraction has 5572 states and 8135 transitions. [2019-09-08 12:28:51,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 12:28:51,887 INFO L276 IsEmpty]: Start isEmpty. Operand 5572 states and 8135 transitions. [2019-09-08 12:28:51,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 12:28:51,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:51,888 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:51,888 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:51,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:51,888 INFO L82 PathProgramCache]: Analyzing trace with hash -584523345, now seen corresponding path program 1 times [2019-09-08 12:28:51,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:51,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:51,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:51,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:51,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:52,241 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2019-09-08 12:28:52,486 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 12:28:52,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:52,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:28:52,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:28:52,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:28:52,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:28:52,489 INFO L87 Difference]: Start difference. First operand 5572 states and 8135 transitions. Second operand 13 states. [2019-09-08 12:28:52,801 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-09-08 12:28:52,952 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-08 12:28:53,115 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-08 12:28:53,426 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-08 12:28:53,638 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-09-08 12:28:58,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:58,964 INFO L93 Difference]: Finished difference Result 14763 states and 21673 transitions. [2019-09-08 12:28:58,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:28:58,964 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 110 [2019-09-08 12:28:58,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:58,974 INFO L225 Difference]: With dead ends: 14763 [2019-09-08 12:28:58,974 INFO L226 Difference]: Without dead ends: 12004 [2019-09-08 12:28:58,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:28:58,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12004 states. [2019-09-08 12:29:01,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12004 to 5520. [2019-09-08 12:29:01,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5520 states. [2019-09-08 12:29:01,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5520 states to 5520 states and 8068 transitions. [2019-09-08 12:29:01,310 INFO L78 Accepts]: Start accepts. Automaton has 5520 states and 8068 transitions. Word has length 110 [2019-09-08 12:29:01,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:01,310 INFO L475 AbstractCegarLoop]: Abstraction has 5520 states and 8068 transitions. [2019-09-08 12:29:01,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:29:01,310 INFO L276 IsEmpty]: Start isEmpty. Operand 5520 states and 8068 transitions. [2019-09-08 12:29:01,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 12:29:01,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:01,311 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:01,312 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:01,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:01,312 INFO L82 PathProgramCache]: Analyzing trace with hash 639012882, now seen corresponding path program 1 times [2019-09-08 12:29:01,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:01,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:01,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:01,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:01,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:01,789 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 12:29:01,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:01,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:29:01,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:29:01,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:29:01,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:29:01,790 INFO L87 Difference]: Start difference. First operand 5520 states and 8068 transitions. Second operand 12 states. [2019-09-08 12:29:02,185 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 41 [2019-09-08 12:29:02,336 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-08 12:29:02,497 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-08 12:29:02,818 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-08 12:29:03,044 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2019-09-08 12:29:03,197 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-08 12:29:05,904 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-08 12:29:15,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:15,264 INFO L93 Difference]: Finished difference Result 28580 states and 42110 transitions. [2019-09-08 12:29:15,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:29:15,265 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 110 [2019-09-08 12:29:15,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:15,289 INFO L225 Difference]: With dead ends: 28580 [2019-09-08 12:29:15,289 INFO L226 Difference]: Without dead ends: 26642 [2019-09-08 12:29:15,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:29:15,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26642 states. [2019-09-08 12:29:17,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26642 to 5498. [2019-09-08 12:29:17,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5498 states. [2019-09-08 12:29:17,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5498 states to 5498 states and 8040 transitions. [2019-09-08 12:29:17,937 INFO L78 Accepts]: Start accepts. Automaton has 5498 states and 8040 transitions. Word has length 110 [2019-09-08 12:29:17,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:17,937 INFO L475 AbstractCegarLoop]: Abstraction has 5498 states and 8040 transitions. [2019-09-08 12:29:17,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:29:17,937 INFO L276 IsEmpty]: Start isEmpty. Operand 5498 states and 8040 transitions. [2019-09-08 12:29:17,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 12:29:17,938 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:17,938 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:17,938 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:17,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:17,939 INFO L82 PathProgramCache]: Analyzing trace with hash 2081170354, now seen corresponding path program 1 times [2019-09-08 12:29:17,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:17,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:17,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:17,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:17,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:18,427 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 12:29:18,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:18,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:29:18,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:29:18,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:29:18,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:29:18,428 INFO L87 Difference]: Start difference. First operand 5498 states and 8040 transitions. Second operand 12 states. [2019-09-08 12:29:18,853 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-08 12:29:19,005 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-08 12:29:19,160 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-08 12:29:19,483 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-08 12:29:19,720 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-08 12:29:19,865 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-08 12:29:21,641 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-08 12:29:33,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:33,010 INFO L93 Difference]: Finished difference Result 28589 states and 42119 transitions. [2019-09-08 12:29:33,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:29:33,011 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 110 [2019-09-08 12:29:33,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:33,036 INFO L225 Difference]: With dead ends: 28589 [2019-09-08 12:29:33,036 INFO L226 Difference]: Without dead ends: 26641 [2019-09-08 12:29:33,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:29:33,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26641 states. [2019-09-08 12:29:35,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26641 to 5472. [2019-09-08 12:29:35,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5472 states. [2019-09-08 12:29:35,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5472 states to 5472 states and 8008 transitions. [2019-09-08 12:29:35,898 INFO L78 Accepts]: Start accepts. Automaton has 5472 states and 8008 transitions. Word has length 110 [2019-09-08 12:29:35,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:35,898 INFO L475 AbstractCegarLoop]: Abstraction has 5472 states and 8008 transitions. [2019-09-08 12:29:35,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:29:35,898 INFO L276 IsEmpty]: Start isEmpty. Operand 5472 states and 8008 transitions. [2019-09-08 12:29:35,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 12:29:35,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:35,899 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:35,899 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:35,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:35,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1243814062, now seen corresponding path program 1 times [2019-09-08 12:29:35,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:35,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:35,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:35,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:35,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:35,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:36,479 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2019-09-08 12:29:36,719 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 12:29:36,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:36,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 12:29:36,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 12:29:36,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 12:29:36,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:29:36,721 INFO L87 Difference]: Start difference. First operand 5472 states and 8008 transitions. Second operand 14 states. [2019-09-08 12:29:37,203 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-09-08 12:29:37,351 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-09-08 12:29:37,518 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-09-08 12:29:37,666 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-08 12:29:37,872 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-08 12:29:38,088 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-09-08 12:29:49,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:49,515 INFO L93 Difference]: Finished difference Result 24072 states and 35453 transitions. [2019-09-08 12:29:49,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 12:29:49,516 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 110 [2019-09-08 12:29:49,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:49,539 INFO L225 Difference]: With dead ends: 24072 [2019-09-08 12:29:49,539 INFO L226 Difference]: Without dead ends: 21337 [2019-09-08 12:29:49,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=165, Invalid=435, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:29:49,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21337 states. [2019-09-08 12:29:52,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21337 to 5423. [2019-09-08 12:29:52,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5423 states. [2019-09-08 12:29:52,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5423 states to 5423 states and 7949 transitions. [2019-09-08 12:29:52,492 INFO L78 Accepts]: Start accepts. Automaton has 5423 states and 7949 transitions. Word has length 110 [2019-09-08 12:29:52,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:52,493 INFO L475 AbstractCegarLoop]: Abstraction has 5423 states and 7949 transitions. [2019-09-08 12:29:52,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 12:29:52,493 INFO L276 IsEmpty]: Start isEmpty. Operand 5423 states and 7949 transitions. [2019-09-08 12:29:52,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 12:29:52,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:52,494 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:52,494 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:52,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:52,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1636111030, now seen corresponding path program 1 times [2019-09-08 12:29:52,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:52,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:52,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:52,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:52,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:52,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:53,386 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-09-08 12:29:53,529 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-09-08 12:29:53,676 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-08 12:29:54,034 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-08 12:29:54,184 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-09-08 12:29:54,988 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-09-08 12:29:55,272 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-08 12:29:56,820 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 12:29:56,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:56,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2019-09-08 12:29:56,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-08 12:29:56,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-08 12:29:56,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1310, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 12:29:56,822 INFO L87 Difference]: Start difference. First operand 5423 states and 7949 transitions. Second operand 38 states. [2019-09-08 12:29:57,167 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 55 [2019-09-08 12:29:58,062 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2019-09-08 12:29:58,272 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2019-09-08 12:29:58,523 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2019-09-08 12:29:58,832 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 12:29:59,174 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-09-08 12:29:59,533 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 57 [2019-09-08 12:30:00,266 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 51 [2019-09-08 12:30:00,600 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 58 [2019-09-08 12:30:00,940 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 64 [2019-09-08 12:30:01,293 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 73 [2019-09-08 12:30:01,709 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 85 [2019-09-08 12:30:02,162 WARN L188 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 94 [2019-09-08 12:30:02,677 WARN L188 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 105 [2019-09-08 12:30:03,228 WARN L188 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 113 [2019-09-08 12:30:04,026 WARN L188 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 134 [2019-09-08 12:30:04,827 WARN L188 SmtUtils]: Spent 692.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 150 [2019-09-08 12:30:06,020 WARN L188 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 210 DAG size of output: 160 [2019-09-08 12:30:06,473 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 80 [2019-09-08 12:30:06,912 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 80 [2019-09-08 12:30:07,342 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 77 [2019-09-08 12:30:07,836 WARN L188 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 85 [2019-09-08 12:30:08,302 WARN L188 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 81 [2019-09-08 12:30:08,627 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 48 [2019-09-08 12:30:09,040 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 75 [2019-09-08 12:30:09,467 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 78 [2019-09-08 12:30:09,872 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-08 12:30:11,420 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2019-09-08 12:30:12,302 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-08 12:30:12,915 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-08 12:30:14,182 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2019-09-08 12:30:14,988 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-08 12:30:15,289 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-09-08 12:30:15,696 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 55 [2019-09-08 12:30:16,177 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-08 12:30:16,619 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 58 [2019-09-08 12:30:19,292 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 62 [2019-09-08 12:30:19,826 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 55 [2019-09-08 12:30:20,307 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 65 [2019-09-08 12:31:06,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:06,643 INFO L93 Difference]: Finished difference Result 65051 states and 96138 transitions. [2019-09-08 12:31:06,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-08 12:31:06,644 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 110 [2019-09-08 12:31:06,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:06,704 INFO L225 Difference]: With dead ends: 65051 [2019-09-08 12:31:06,704 INFO L226 Difference]: Without dead ends: 62798 [2019-09-08 12:31:06,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1808 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=1305, Invalid=7067, Unknown=0, NotChecked=0, Total=8372 [2019-09-08 12:31:06,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62798 states. [2019-09-08 12:31:10,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62798 to 5440. [2019-09-08 12:31:10,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5440 states. [2019-09-08 12:31:10,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5440 states to 5440 states and 7970 transitions. [2019-09-08 12:31:10,194 INFO L78 Accepts]: Start accepts. Automaton has 5440 states and 7970 transitions. Word has length 110 [2019-09-08 12:31:10,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:10,194 INFO L475 AbstractCegarLoop]: Abstraction has 5440 states and 7970 transitions. [2019-09-08 12:31:10,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-08 12:31:10,195 INFO L276 IsEmpty]: Start isEmpty. Operand 5440 states and 7970 transitions. [2019-09-08 12:31:10,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 12:31:10,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:10,196 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:10,196 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:10,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:10,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1085275794, now seen corresponding path program 1 times [2019-09-08 12:31:10,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:10,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:10,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:10,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:10,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:10,801 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 12:31:10,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:10,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:31:10,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:31:10,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:31:10,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:31:10,802 INFO L87 Difference]: Start difference. First operand 5440 states and 7970 transitions. Second operand 12 states. [2019-09-08 12:31:11,257 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-08 12:31:11,446 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-08 12:31:11,642 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-09-08 12:31:11,821 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-08 12:31:11,984 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-09-08 12:31:12,158 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-09-08 12:31:12,307 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2019-09-08 12:31:12,588 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2019-09-08 12:31:12,763 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-08 12:31:25,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:25,632 INFO L93 Difference]: Finished difference Result 23641 states and 34974 transitions. [2019-09-08 12:31:25,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:31:25,632 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 110 [2019-09-08 12:31:25,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:25,650 INFO L225 Difference]: With dead ends: 23641 [2019-09-08 12:31:25,651 INFO L226 Difference]: Without dead ends: 21363 [2019-09-08 12:31:25,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:31:25,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21363 states. [2019-09-08 12:31:28,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21363 to 5289. [2019-09-08 12:31:28,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5289 states. [2019-09-08 12:31:28,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5289 states to 5289 states and 7758 transitions. [2019-09-08 12:31:28,951 INFO L78 Accepts]: Start accepts. Automaton has 5289 states and 7758 transitions. Word has length 110 [2019-09-08 12:31:28,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:28,951 INFO L475 AbstractCegarLoop]: Abstraction has 5289 states and 7758 transitions. [2019-09-08 12:31:28,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:31:28,951 INFO L276 IsEmpty]: Start isEmpty. Operand 5289 states and 7758 transitions. [2019-09-08 12:31:28,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 12:31:28,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:28,952 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:28,952 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:28,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:28,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1800056775, now seen corresponding path program 1 times [2019-09-08 12:31:28,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:28,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:28,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:28,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:28,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:28,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:29,529 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 12:31:29,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:29,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 12:31:29,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 12:31:29,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 12:31:29,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:31:29,531 INFO L87 Difference]: Start difference. First operand 5289 states and 7758 transitions. Second operand 14 states. [2019-09-08 12:31:29,653 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2019-09-08 12:31:30,113 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2019-09-08 12:31:30,366 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-08 12:31:30,662 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-08 12:31:30,964 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-08 12:31:31,421 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 12:31:31,661 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-08 12:31:31,919 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-08 12:31:34,265 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-08 12:31:48,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:48,790 INFO L93 Difference]: Finished difference Result 28109 states and 41484 transitions. [2019-09-08 12:31:48,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:31:48,791 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 111 [2019-09-08 12:31:48,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:48,814 INFO L225 Difference]: With dead ends: 28109 [2019-09-08 12:31:48,814 INFO L226 Difference]: Without dead ends: 25856 [2019-09-08 12:31:48,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=189, Invalid=623, Unknown=0, NotChecked=0, Total=812 [2019-09-08 12:31:48,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25856 states. [2019-09-08 12:31:52,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25856 to 5271. [2019-09-08 12:31:52,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5271 states. [2019-09-08 12:31:52,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5271 states to 5271 states and 7735 transitions. [2019-09-08 12:31:52,318 INFO L78 Accepts]: Start accepts. Automaton has 5271 states and 7735 transitions. Word has length 111 [2019-09-08 12:31:52,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:52,318 INFO L475 AbstractCegarLoop]: Abstraction has 5271 states and 7735 transitions. [2019-09-08 12:31:52,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 12:31:52,318 INFO L276 IsEmpty]: Start isEmpty. Operand 5271 states and 7735 transitions. [2019-09-08 12:31:52,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 12:31:52,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:52,321 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:31:52,321 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:52,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:52,321 INFO L82 PathProgramCache]: Analyzing trace with hash 105892615, now seen corresponding path program 1 times [2019-09-08 12:31:52,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:52,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:52,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:52,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:52,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:52,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:52,387 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:31:52,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:52,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:31:52,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:31:52,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:31:52,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:31:52,388 INFO L87 Difference]: Start difference. First operand 5271 states and 7735 transitions. Second operand 3 states. [2019-09-08 12:31:58,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:58,995 INFO L93 Difference]: Finished difference Result 15227 states and 22357 transitions. [2019-09-08 12:31:58,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:31:58,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-09-08 12:31:58,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:59,005 INFO L225 Difference]: With dead ends: 15227 [2019-09-08 12:31:59,005 INFO L226 Difference]: Without dead ends: 10089 [2019-09-08 12:31:59,009 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 12:31:59,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10089 states. [2019-09-08 12:32:05,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10089 to 9767. [2019-09-08 12:32:05,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9767 states. [2019-09-08 12:32:05,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9767 states to 9767 states and 14285 transitions. [2019-09-08 12:32:05,436 INFO L78 Accepts]: Start accepts. Automaton has 9767 states and 14285 transitions. Word has length 141 [2019-09-08 12:32:05,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:05,436 INFO L475 AbstractCegarLoop]: Abstraction has 9767 states and 14285 transitions. [2019-09-08 12:32:05,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:32:05,437 INFO L276 IsEmpty]: Start isEmpty. Operand 9767 states and 14285 transitions. [2019-09-08 12:32:05,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 12:32:05,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:05,439 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:05,439 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:05,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:05,439 INFO L82 PathProgramCache]: Analyzing trace with hash -509787595, now seen corresponding path program 1 times [2019-09-08 12:32:05,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:05,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:05,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:05,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:05,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:05,499 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:05,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:05,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:32:05,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:32:05,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:32:05,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:32:05,501 INFO L87 Difference]: Start difference. First operand 9767 states and 14285 transitions. Second operand 3 states. [2019-09-08 12:32:14,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:14,599 INFO L93 Difference]: Finished difference Result 20365 states and 29888 transitions. [2019-09-08 12:32:14,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:32:14,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-09-08 12:32:14,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:14,613 INFO L225 Difference]: With dead ends: 20365 [2019-09-08 12:32:14,614 INFO L226 Difference]: Without dead ends: 13525 [2019-09-08 12:32:14,620 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 12:32:14,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13525 states. [2019-09-08 12:32:23,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13525 to 13083. [2019-09-08 12:32:23,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13083 states. [2019-09-08 12:32:23,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13083 states to 13083 states and 19081 transitions. [2019-09-08 12:32:23,302 INFO L78 Accepts]: Start accepts. Automaton has 13083 states and 19081 transitions. Word has length 142 [2019-09-08 12:32:23,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:23,302 INFO L475 AbstractCegarLoop]: Abstraction has 13083 states and 19081 transitions. [2019-09-08 12:32:23,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:32:23,302 INFO L276 IsEmpty]: Start isEmpty. Operand 13083 states and 19081 transitions. [2019-09-08 12:32:23,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 12:32:23,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:23,303 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:23,304 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:23,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:23,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1087314025, now seen corresponding path program 1 times [2019-09-08 12:32:23,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:23,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:23,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:23,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:23,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:23,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:23,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:23,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:23,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:32:23,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:32:23,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:32:23,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:32:23,445 INFO L87 Difference]: Start difference. First operand 13083 states and 19081 transitions. Second operand 7 states. [2019-09-08 12:32:47,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:47,529 INFO L93 Difference]: Finished difference Result 47189 states and 68736 transitions. [2019-09-08 12:32:47,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:32:47,530 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 142 [2019-09-08 12:32:47,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:47,567 INFO L225 Difference]: With dead ends: 47189 [2019-09-08 12:32:47,567 INFO L226 Difference]: Without dead ends: 34255 [2019-09-08 12:32:47,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:32:47,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34255 states. [2019-09-08 12:32:57,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34255 to 14073. [2019-09-08 12:32:57,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14073 states. [2019-09-08 12:32:57,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14073 states to 14073 states and 20456 transitions. [2019-09-08 12:32:57,128 INFO L78 Accepts]: Start accepts. Automaton has 14073 states and 20456 transitions. Word has length 142 [2019-09-08 12:32:57,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:57,129 INFO L475 AbstractCegarLoop]: Abstraction has 14073 states and 20456 transitions. [2019-09-08 12:32:57,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:32:57,129 INFO L276 IsEmpty]: Start isEmpty. Operand 14073 states and 20456 transitions. [2019-09-08 12:32:57,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 12:32:57,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:57,130 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:57,130 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:57,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:57,130 INFO L82 PathProgramCache]: Analyzing trace with hash -405334307, now seen corresponding path program 1 times [2019-09-08 12:32:57,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:57,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:57,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:57,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:57,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:57,226 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:57,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:57,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:32:57,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:32:57,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:32:57,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:32:57,227 INFO L87 Difference]: Start difference. First operand 14073 states and 20456 transitions. Second operand 7 states. [2019-09-08 12:33:45,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:45,451 INFO L93 Difference]: Finished difference Result 82225 states and 119468 transitions. [2019-09-08 12:33:45,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:33:45,452 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 142 [2019-09-08 12:33:45,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:45,520 INFO L225 Difference]: With dead ends: 82225 [2019-09-08 12:33:45,520 INFO L226 Difference]: Without dead ends: 68319 [2019-09-08 12:33:45,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:33:45,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68319 states. [2019-09-08 12:34:05,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68319 to 30137. [2019-09-08 12:34:05,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30137 states. [2019-09-08 12:34:05,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30137 states to 30137 states and 43750 transitions. [2019-09-08 12:34:05,576 INFO L78 Accepts]: Start accepts. Automaton has 30137 states and 43750 transitions. Word has length 142 [2019-09-08 12:34:05,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:05,576 INFO L475 AbstractCegarLoop]: Abstraction has 30137 states and 43750 transitions. [2019-09-08 12:34:05,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:34:05,576 INFO L276 IsEmpty]: Start isEmpty. Operand 30137 states and 43750 transitions. [2019-09-08 12:34:05,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 12:34:05,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:05,577 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:34:05,578 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:05,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:05,578 INFO L82 PathProgramCache]: Analyzing trace with hash -819767965, now seen corresponding path program 1 times [2019-09-08 12:34:05,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:05,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:05,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:05,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:05,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:05,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:05,767 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:34:05,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:05,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:34:05,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:34:05,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:34:05,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:34:05,769 INFO L87 Difference]: Start difference. First operand 30137 states and 43750 transitions. Second operand 7 states. [2019-09-08 12:35:40,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:40,218 INFO L93 Difference]: Finished difference Result 166433 states and 240906 transitions. [2019-09-08 12:35:40,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:35:40,261 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 142 [2019-09-08 12:35:40,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:40,413 INFO L225 Difference]: With dead ends: 166433 [2019-09-08 12:35:40,414 INFO L226 Difference]: Without dead ends: 136463 [2019-09-08 12:35:40,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:35:40,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136463 states. [2019-09-08 12:36:21,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136463 to 64425. [2019-09-08 12:36:21,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64425 states. [2019-09-08 12:36:21,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64425 states to 64425 states and 93362 transitions. [2019-09-08 12:36:21,408 INFO L78 Accepts]: Start accepts. Automaton has 64425 states and 93362 transitions. Word has length 142 [2019-09-08 12:36:21,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:36:21,409 INFO L475 AbstractCegarLoop]: Abstraction has 64425 states and 93362 transitions. [2019-09-08 12:36:21,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:36:21,409 INFO L276 IsEmpty]: Start isEmpty. Operand 64425 states and 93362 transitions. [2019-09-08 12:36:21,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 12:36:21,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:36:21,410 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:36:21,410 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:36:21,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:36:21,410 INFO L82 PathProgramCache]: Analyzing trace with hash -926650851, now seen corresponding path program 1 times [2019-09-08 12:36:21,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:36:21,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:36:21,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:21,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:36:21,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:21,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:36:21,519 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:36:21,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:36:21,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:36:21,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:36:21,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:36:21,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:36:21,521 INFO L87 Difference]: Start difference. First operand 64425 states and 93362 transitions. Second operand 7 states.