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.7.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:41:17,712 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:41:17,716 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:41:17,733 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:41:17,733 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:41:17,735 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:41:17,737 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:41:17,747 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:41:17,751 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:41:17,754 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:41:17,757 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:41:17,758 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:41:17,759 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:41:17,761 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:41:17,763 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:41:17,765 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:41:17,767 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:41:17,768 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:41:17,769 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:41:17,771 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:41:17,772 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:41:17,773 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:41:17,774 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:41:17,774 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:41:17,776 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:41:17,776 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:41:17,777 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:41:17,777 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:41:17,778 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:41:17,778 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:41:17,779 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:41:17,779 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:41:17,780 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:41:17,781 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:41:17,782 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:41:17,782 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:41:17,782 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:41:17,783 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:41:17,783 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:41:17,783 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:41:17,784 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:41:17,785 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:41:17,804 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:41:17,807 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:41:17,809 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:41:17,809 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:41:17,809 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:41:17,809 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:41:17,810 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:41:17,810 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:41:17,812 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:41:17,812 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:41:17,813 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:41:17,813 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:41:17,813 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:41:17,813 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:41:17,813 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:41:17,814 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:41:17,814 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:41:17,814 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:41:17,815 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:41:17,816 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:41:17,816 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:41:17,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:41:17,816 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:41:17,816 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:41:17,817 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:41:17,817 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:41:17,817 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:41:17,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:41:17,818 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:41:17,862 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:41:17,875 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:41:17,879 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:41:17,880 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:41:17,880 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:41:17,881 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c [2019-09-08 12:41:17,960 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef9d977bc/70b566e332474e90b347179023577ee9/FLAG995a5329d [2019-09-08 12:41:18,445 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:41:18,446 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c [2019-09-08 12:41:18,463 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef9d977bc/70b566e332474e90b347179023577ee9/FLAG995a5329d [2019-09-08 12:41:18,805 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef9d977bc/70b566e332474e90b347179023577ee9 [2019-09-08 12:41:18,816 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:41:18,818 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:41:18,820 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:41:18,820 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:41:18,824 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:41:18,825 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:41:18" (1/1) ... [2019-09-08 12:41:18,828 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31bacf86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:41:18, skipping insertion in model container [2019-09-08 12:41:18,828 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:41:18" (1/1) ... [2019-09-08 12:41:18,836 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:41:18,889 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:41:19,352 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:41:19,368 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:41:19,448 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:41:19,475 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:41:19,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:41:19 WrapperNode [2019-09-08 12:41:19,475 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:41:19,476 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:41:19,476 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:41:19,476 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:41:19,491 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:41:19" (1/1) ... [2019-09-08 12:41:19,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:41:19" (1/1) ... [2019-09-08 12:41:19,502 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:41:19" (1/1) ... [2019-09-08 12:41:19,503 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:41:19" (1/1) ... [2019-09-08 12:41:19,521 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:41:19" (1/1) ... [2019-09-08 12:41:19,538 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:41:19" (1/1) ... [2019-09-08 12:41:19,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:41:19" (1/1) ... [2019-09-08 12:41:19,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:41:19,561 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:41:19,562 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:41:19,562 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:41:19,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:41:19" (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:41:19,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:41:19,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:41:19,617 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:41:19,617 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:41:19,617 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:41:19,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:41:19,618 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:41:19,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:41:19,618 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:41:19,618 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:41:19,618 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:41:19,619 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:41:19,619 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:41:19,619 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:41:19,619 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:41:19,619 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 12:41:19,619 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-08 12:41:19,620 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:41:19,620 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:41:19,620 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:41:19,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:41:19,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:41:20,428 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:41:20,429 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:41:20,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:41:20 BoogieIcfgContainer [2019-09-08 12:41:20,430 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:41:20,431 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:41:20,432 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:41:20,435 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:41:20,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:41:18" (1/3) ... [2019-09-08 12:41:20,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de2495d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:41:20, skipping insertion in model container [2019-09-08 12:41:20,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:41:19" (2/3) ... [2019-09-08 12:41:20,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de2495d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:41:20, skipping insertion in model container [2019-09-08 12:41:20,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:41:20" (3/3) ... [2019-09-08 12:41:20,438 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c [2019-09-08 12:41:20,448 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:41:20,457 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 12:41:20,474 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 12:41:20,507 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:41:20,508 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:41:20,508 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:41:20,509 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:41:20,509 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:41:20,509 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:41:20,509 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:41:20,510 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:41:20,510 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:41:20,531 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2019-09-08 12:41:20,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 12:41:20,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:20,544 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] [2019-09-08 12:41:20,546 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:20,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:20,551 INFO L82 PathProgramCache]: Analyzing trace with hash -342597549, now seen corresponding path program 1 times [2019-09-08 12:41:20,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:20,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:20,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:20,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:20,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:20,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:21,099 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:41:21,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:21,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:41:21,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:41:21,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:41:21,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:41:21,127 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 3 states. [2019-09-08 12:41:21,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:21,259 INFO L93 Difference]: Finished difference Result 301 states and 491 transitions. [2019-09-08 12:41:21,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:41:21,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-08 12:41:21,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:21,280 INFO L225 Difference]: With dead ends: 301 [2019-09-08 12:41:21,280 INFO L226 Difference]: Without dead ends: 209 [2019-09-08 12:41:21,284 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:41:21,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-08 12:41:21,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2019-09-08 12:41:21,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-09-08 12:41:21,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 296 transitions. [2019-09-08 12:41:21,351 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 296 transitions. Word has length 90 [2019-09-08 12:41:21,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:21,352 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 296 transitions. [2019-09-08 12:41:21,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:41:21,352 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 296 transitions. [2019-09-08 12:41:21,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 12:41:21,359 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:21,359 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] [2019-09-08 12:41:21,361 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:21,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:21,362 INFO L82 PathProgramCache]: Analyzing trace with hash 2032484070, now seen corresponding path program 1 times [2019-09-08 12:41:21,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:21,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:21,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:21,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:21,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:21,539 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:41:21,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:21,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:41:21,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:41:21,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:41:21,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:41:21,542 INFO L87 Difference]: Start difference. First operand 207 states and 296 transitions. Second operand 3 states. [2019-09-08 12:41:21,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:21,610 INFO L93 Difference]: Finished difference Result 491 states and 748 transitions. [2019-09-08 12:41:21,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:41:21,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-09-08 12:41:21,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:21,614 INFO L225 Difference]: With dead ends: 491 [2019-09-08 12:41:21,614 INFO L226 Difference]: Without dead ends: 341 [2019-09-08 12:41:21,616 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:41:21,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-09-08 12:41:21,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 339. [2019-09-08 12:41:21,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2019-09-08 12:41:21,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 506 transitions. [2019-09-08 12:41:21,661 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 506 transitions. Word has length 91 [2019-09-08 12:41:21,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:21,662 INFO L475 AbstractCegarLoop]: Abstraction has 339 states and 506 transitions. [2019-09-08 12:41:21,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:41:21,662 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 506 transitions. [2019-09-08 12:41:21,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 12:41:21,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:21,665 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] [2019-09-08 12:41:21,665 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:21,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:21,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1593427600, now seen corresponding path program 1 times [2019-09-08 12:41:21,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:21,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:21,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:21,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:21,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:21,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:21,778 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:41:21,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:21,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:41:21,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:41:21,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:41:21,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:41:21,779 INFO L87 Difference]: Start difference. First operand 339 states and 506 transitions. Second operand 3 states. [2019-09-08 12:41:21,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:21,845 INFO L93 Difference]: Finished difference Result 871 states and 1352 transitions. [2019-09-08 12:41:21,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:41:21,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-09-08 12:41:21,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:21,865 INFO L225 Difference]: With dead ends: 871 [2019-09-08 12:41:21,865 INFO L226 Difference]: Without dead ends: 589 [2019-09-08 12:41:21,871 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:41:21,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-09-08 12:41:21,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 587. [2019-09-08 12:41:21,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-09-08 12:41:21,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 898 transitions. [2019-09-08 12:41:21,939 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 898 transitions. Word has length 92 [2019-09-08 12:41:21,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:21,940 INFO L475 AbstractCegarLoop]: Abstraction has 587 states and 898 transitions. [2019-09-08 12:41:21,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:41:21,940 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 898 transitions. [2019-09-08 12:41:21,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 12:41:21,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:21,942 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] [2019-09-08 12:41:21,943 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:21,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:21,943 INFO L82 PathProgramCache]: Analyzing trace with hash -304306673, now seen corresponding path program 1 times [2019-09-08 12:41:21,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:21,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:21,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:21,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:21,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:22,092 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:41:22,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:22,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:41:22,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:41:22,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:41:22,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:41:22,094 INFO L87 Difference]: Start difference. First operand 587 states and 898 transitions. Second operand 3 states. [2019-09-08 12:41:22,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:22,155 INFO L93 Difference]: Finished difference Result 1583 states and 2476 transitions. [2019-09-08 12:41:22,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:41:22,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-09-08 12:41:22,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:22,166 INFO L225 Difference]: With dead ends: 1583 [2019-09-08 12:41:22,166 INFO L226 Difference]: Without dead ends: 1053 [2019-09-08 12:41:22,168 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:41:22,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2019-09-08 12:41:22,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1051. [2019-09-08 12:41:22,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1051 states. [2019-09-08 12:41:22,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1626 transitions. [2019-09-08 12:41:22,218 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1626 transitions. Word has length 93 [2019-09-08 12:41:22,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:22,219 INFO L475 AbstractCegarLoop]: Abstraction has 1051 states and 1626 transitions. [2019-09-08 12:41:22,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:41:22,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1626 transitions. [2019-09-08 12:41:22,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 12:41:22,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:22,225 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:22,225 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:22,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:22,226 INFO L82 PathProgramCache]: Analyzing trace with hash 22614474, now seen corresponding path program 1 times [2019-09-08 12:41:22,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:22,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:22,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:22,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:22,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:22,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:22,353 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:41:22,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:22,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:41:22,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:41:22,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:41:22,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:41:22,356 INFO L87 Difference]: Start difference. First operand 1051 states and 1626 transitions. Second operand 3 states. [2019-09-08 12:41:22,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:22,455 INFO L93 Difference]: Finished difference Result 2911 states and 4556 transitions. [2019-09-08 12:41:22,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:41:22,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-09-08 12:41:22,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:22,467 INFO L225 Difference]: With dead ends: 2911 [2019-09-08 12:41:22,467 INFO L226 Difference]: Without dead ends: 1917 [2019-09-08 12:41:22,471 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:41:22,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2019-09-08 12:41:22,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1915. [2019-09-08 12:41:22,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1915 states. [2019-09-08 12:41:22,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1915 states and 2970 transitions. [2019-09-08 12:41:22,566 INFO L78 Accepts]: Start accepts. Automaton has 1915 states and 2970 transitions. Word has length 94 [2019-09-08 12:41:22,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:22,567 INFO L475 AbstractCegarLoop]: Abstraction has 1915 states and 2970 transitions. [2019-09-08 12:41:22,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:41:22,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 2970 transitions. [2019-09-08 12:41:22,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 12:41:22,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:22,571 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] [2019-09-08 12:41:22,571 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:22,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:22,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1677889525, now seen corresponding path program 1 times [2019-09-08 12:41:22,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:22,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:22,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:22,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:22,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:22,696 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:41:22,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:22,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:41:22,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:41:22,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:41:22,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:41:22,698 INFO L87 Difference]: Start difference. First operand 1915 states and 2970 transitions. Second operand 3 states. [2019-09-08 12:41:22,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:22,908 INFO L93 Difference]: Finished difference Result 5375 states and 8380 transitions. [2019-09-08 12:41:22,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:41:22,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-09-08 12:41:22,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:22,936 INFO L225 Difference]: With dead ends: 5375 [2019-09-08 12:41:22,936 INFO L226 Difference]: Without dead ends: 3517 [2019-09-08 12:41:22,943 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:41:22,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3517 states. [2019-09-08 12:41:23,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3517 to 3515. [2019-09-08 12:41:23,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3515 states. [2019-09-08 12:41:23,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3515 states to 3515 states and 5434 transitions. [2019-09-08 12:41:23,209 INFO L78 Accepts]: Start accepts. Automaton has 3515 states and 5434 transitions. Word has length 95 [2019-09-08 12:41:23,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:23,212 INFO L475 AbstractCegarLoop]: Abstraction has 3515 states and 5434 transitions. [2019-09-08 12:41:23,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:41:23,212 INFO L276 IsEmpty]: Start isEmpty. Operand 3515 states and 5434 transitions. [2019-09-08 12:41:23,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 12:41:23,214 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:23,215 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:41:23,221 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:23,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:23,221 INFO L82 PathProgramCache]: Analyzing trace with hash 2079777372, now seen corresponding path program 1 times [2019-09-08 12:41:23,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:23,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:23,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:23,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:23,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:23,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:23,318 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:41:23,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:23,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:41:23,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:41:23,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:41:23,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:41:23,320 INFO L87 Difference]: Start difference. First operand 3515 states and 5434 transitions. Second operand 3 states. [2019-09-08 12:41:23,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:23,709 INFO L93 Difference]: Finished difference Result 9919 states and 15356 transitions. [2019-09-08 12:41:23,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:41:23,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-09-08 12:41:23,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:23,758 INFO L225 Difference]: With dead ends: 9919 [2019-09-08 12:41:23,758 INFO L226 Difference]: Without dead ends: 6461 [2019-09-08 12:41:23,769 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:41:23,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6461 states. [2019-09-08 12:41:24,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6461 to 6459. [2019-09-08 12:41:24,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6459 states. [2019-09-08 12:41:24,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6459 states to 6459 states and 9914 transitions. [2019-09-08 12:41:24,243 INFO L78 Accepts]: Start accepts. Automaton has 6459 states and 9914 transitions. Word has length 96 [2019-09-08 12:41:24,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:24,243 INFO L475 AbstractCegarLoop]: Abstraction has 6459 states and 9914 transitions. [2019-09-08 12:41:24,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:41:24,244 INFO L276 IsEmpty]: Start isEmpty. Operand 6459 states and 9914 transitions. [2019-09-08 12:41:24,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:41:24,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:24,245 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:41:24,246 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:24,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:24,246 INFO L82 PathProgramCache]: Analyzing trace with hash -447256609, now seen corresponding path program 1 times [2019-09-08 12:41:24,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:24,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:24,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:24,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:24,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:24,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:24,418 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:41:24,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:24,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:41:24,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:41:24,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:41:24,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:41:24,420 INFO L87 Difference]: Start difference. First operand 6459 states and 9914 transitions. Second operand 5 states. [2019-09-08 12:41:24,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:24,915 INFO L93 Difference]: Finished difference Result 12861 states and 19771 transitions. [2019-09-08 12:41:24,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:41:24,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 12:41:24,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:24,952 INFO L225 Difference]: With dead ends: 12861 [2019-09-08 12:41:24,953 INFO L226 Difference]: Without dead ends: 6459 [2019-09-08 12:41:24,974 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:41:24,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6459 states. [2019-09-08 12:41:25,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6459 to 6459. [2019-09-08 12:41:25,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6459 states. [2019-09-08 12:41:25,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6459 states to 6459 states and 9850 transitions. [2019-09-08 12:41:25,563 INFO L78 Accepts]: Start accepts. Automaton has 6459 states and 9850 transitions. Word has length 97 [2019-09-08 12:41:25,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:25,563 INFO L475 AbstractCegarLoop]: Abstraction has 6459 states and 9850 transitions. [2019-09-08 12:41:25,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:41:25,564 INFO L276 IsEmpty]: Start isEmpty. Operand 6459 states and 9850 transitions. [2019-09-08 12:41:25,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:41:25,565 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:25,565 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:41:25,565 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:25,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:25,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1088141316, now seen corresponding path program 1 times [2019-09-08 12:41:25,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:25,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:25,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:25,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:25,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:25,673 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:41:25,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:25,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:41:25,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:41:25,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:41:25,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:41:25,675 INFO L87 Difference]: Start difference. First operand 6459 states and 9850 transitions. Second operand 5 states. [2019-09-08 12:41:26,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:26,245 INFO L93 Difference]: Finished difference Result 12861 states and 19643 transitions. [2019-09-08 12:41:26,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:41:26,246 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 12:41:26,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:26,303 INFO L225 Difference]: With dead ends: 12861 [2019-09-08 12:41:26,304 INFO L226 Difference]: Without dead ends: 6459 [2019-09-08 12:41:26,324 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:41:26,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6459 states. [2019-09-08 12:41:26,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6459 to 6459. [2019-09-08 12:41:26,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6459 states. [2019-09-08 12:41:26,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6459 states to 6459 states and 9786 transitions. [2019-09-08 12:41:26,910 INFO L78 Accepts]: Start accepts. Automaton has 6459 states and 9786 transitions. Word has length 97 [2019-09-08 12:41:26,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:26,910 INFO L475 AbstractCegarLoop]: Abstraction has 6459 states and 9786 transitions. [2019-09-08 12:41:26,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:41:26,911 INFO L276 IsEmpty]: Start isEmpty. Operand 6459 states and 9786 transitions. [2019-09-08 12:41:26,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:41:26,913 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:26,913 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:41:26,913 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:26,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:26,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1485495105, now seen corresponding path program 1 times [2019-09-08 12:41:26,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:26,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:26,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:26,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:26,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:27,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:41:27,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:27,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:41:27,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:41:27,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:41:27,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:41:27,080 INFO L87 Difference]: Start difference. First operand 6459 states and 9786 transitions. Second operand 5 states. [2019-09-08 12:41:27,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:27,637 INFO L93 Difference]: Finished difference Result 12861 states and 19515 transitions. [2019-09-08 12:41:27,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:41:27,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 12:41:27,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:27,656 INFO L225 Difference]: With dead ends: 12861 [2019-09-08 12:41:27,657 INFO L226 Difference]: Without dead ends: 6459 [2019-09-08 12:41:27,671 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:41:27,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6459 states. [2019-09-08 12:41:28,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6459 to 6459. [2019-09-08 12:41:28,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6459 states. [2019-09-08 12:41:28,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6459 states to 6459 states and 9722 transitions. [2019-09-08 12:41:28,079 INFO L78 Accepts]: Start accepts. Automaton has 6459 states and 9722 transitions. Word has length 97 [2019-09-08 12:41:28,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:28,080 INFO L475 AbstractCegarLoop]: Abstraction has 6459 states and 9722 transitions. [2019-09-08 12:41:28,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:41:28,080 INFO L276 IsEmpty]: Start isEmpty. Operand 6459 states and 9722 transitions. [2019-09-08 12:41:28,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:41:28,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:28,082 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:41:28,082 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:28,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:28,082 INFO L82 PathProgramCache]: Analyzing trace with hash -211627100, now seen corresponding path program 1 times [2019-09-08 12:41:28,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:28,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:28,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:28,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:28,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:28,264 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:41:28,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:28,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:41:28,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:41:28,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:41:28,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:41:28,266 INFO L87 Difference]: Start difference. First operand 6459 states and 9722 transitions. Second operand 5 states. [2019-09-08 12:41:28,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:28,715 INFO L93 Difference]: Finished difference Result 12861 states and 19387 transitions. [2019-09-08 12:41:28,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:41:28,716 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 12:41:28,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:28,732 INFO L225 Difference]: With dead ends: 12861 [2019-09-08 12:41:28,733 INFO L226 Difference]: Without dead ends: 6459 [2019-09-08 12:41:28,747 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:41:28,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6459 states. [2019-09-08 12:41:29,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6459 to 6459. [2019-09-08 12:41:29,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6459 states. [2019-09-08 12:41:29,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6459 states to 6459 states and 9658 transitions. [2019-09-08 12:41:29,182 INFO L78 Accepts]: Start accepts. Automaton has 6459 states and 9658 transitions. Word has length 97 [2019-09-08 12:41:29,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:29,183 INFO L475 AbstractCegarLoop]: Abstraction has 6459 states and 9658 transitions. [2019-09-08 12:41:29,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:41:29,183 INFO L276 IsEmpty]: Start isEmpty. Operand 6459 states and 9658 transitions. [2019-09-08 12:41:29,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:41:29,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:29,184 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:29,185 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:29,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:29,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1658656695, now seen corresponding path program 1 times [2019-09-08 12:41:29,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:29,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:29,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:29,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:29,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:29,281 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:41:29,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:29,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:41:29,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:41:29,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:41:29,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:41:29,283 INFO L87 Difference]: Start difference. First operand 6459 states and 9658 transitions. Second operand 5 states. [2019-09-08 12:41:29,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:29,722 INFO L93 Difference]: Finished difference Result 12861 states and 19259 transitions. [2019-09-08 12:41:29,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:41:29,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 12:41:29,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:29,739 INFO L225 Difference]: With dead ends: 12861 [2019-09-08 12:41:29,739 INFO L226 Difference]: Without dead ends: 6459 [2019-09-08 12:41:29,754 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:41:29,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6459 states. [2019-09-08 12:41:30,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6459 to 6459. [2019-09-08 12:41:30,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6459 states. [2019-09-08 12:41:30,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6459 states to 6459 states and 9594 transitions. [2019-09-08 12:41:30,274 INFO L78 Accepts]: Start accepts. Automaton has 6459 states and 9594 transitions. Word has length 97 [2019-09-08 12:41:30,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:30,274 INFO L475 AbstractCegarLoop]: Abstraction has 6459 states and 9594 transitions. [2019-09-08 12:41:30,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:41:30,274 INFO L276 IsEmpty]: Start isEmpty. Operand 6459 states and 9594 transitions. [2019-09-08 12:41:30,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:41:30,275 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:30,276 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:41:30,276 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:30,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:30,276 INFO L82 PathProgramCache]: Analyzing trace with hash -331271506, now seen corresponding path program 1 times [2019-09-08 12:41:30,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:30,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:30,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:30,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:30,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:30,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:30,508 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:41:30,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:30,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:30,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:30,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:30,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:30,511 INFO L87 Difference]: Start difference. First operand 6459 states and 9594 transitions. Second operand 9 states. [2019-09-08 12:41:36,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:36,124 INFO L93 Difference]: Finished difference Result 96087 states and 143112 transitions. [2019-09-08 12:41:36,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:41:36,125 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-08 12:41:36,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:36,367 INFO L225 Difference]: With dead ends: 96087 [2019-09-08 12:41:36,367 INFO L226 Difference]: Without dead ends: 89685 [2019-09-08 12:41:36,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:41:36,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89685 states. [2019-09-08 12:41:38,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89685 to 12859. [2019-09-08 12:41:38,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12859 states. [2019-09-08 12:41:38,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12859 states to 12859 states and 18874 transitions. [2019-09-08 12:41:38,261 INFO L78 Accepts]: Start accepts. Automaton has 12859 states and 18874 transitions. Word has length 97 [2019-09-08 12:41:38,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:38,264 INFO L475 AbstractCegarLoop]: Abstraction has 12859 states and 18874 transitions. [2019-09-08 12:41:38,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:38,264 INFO L276 IsEmpty]: Start isEmpty. Operand 12859 states and 18874 transitions. [2019-09-08 12:41:38,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:41:38,265 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:38,266 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:41:38,266 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:38,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:38,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1397477208, now seen corresponding path program 1 times [2019-09-08 12:41:38,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:38,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:38,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:38,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:38,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:38,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:38,666 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:41:38,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:38,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:38,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:38,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:38,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:38,668 INFO L87 Difference]: Start difference. First operand 12859 states and 18874 transitions. Second operand 9 states. [2019-09-08 12:41:42,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:42,376 INFO L93 Difference]: Finished difference Result 51267 states and 75326 transitions. [2019-09-08 12:41:42,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:41:42,377 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:41:42,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:42,446 INFO L225 Difference]: With dead ends: 51267 [2019-09-08 12:41:42,446 INFO L226 Difference]: Without dead ends: 38465 [2019-09-08 12:41:42,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:41:42,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38465 states. [2019-09-08 12:41:44,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38465 to 25659. [2019-09-08 12:41:44,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25659 states. [2019-09-08 12:41:44,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25659 states to 25659 states and 37562 transitions. [2019-09-08 12:41:44,879 INFO L78 Accepts]: Start accepts. Automaton has 25659 states and 37562 transitions. Word has length 99 [2019-09-08 12:41:44,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:44,880 INFO L475 AbstractCegarLoop]: Abstraction has 25659 states and 37562 transitions. [2019-09-08 12:41:44,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:44,880 INFO L276 IsEmpty]: Start isEmpty. Operand 25659 states and 37562 transitions. [2019-09-08 12:41:44,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:41:44,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:44,881 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:44,881 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:44,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:44,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1417526551, now seen corresponding path program 1 times [2019-09-08 12:41:44,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:44,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:44,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:44,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:44,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:44,960 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:41:44,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:44,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:41:44,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:41:44,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:41:44,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:41:44,962 INFO L87 Difference]: Start difference. First operand 25659 states and 37562 transitions. Second operand 3 states. [2019-09-08 12:41:47,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:47,764 INFO L93 Difference]: Finished difference Result 63681 states and 93054 transitions. [2019-09-08 12:41:47,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:41:47,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-08 12:41:47,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:47,823 INFO L225 Difference]: With dead ends: 63681 [2019-09-08 12:41:47,824 INFO L226 Difference]: Without dead ends: 38079 [2019-09-08 12:41:47,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:41:47,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38079 states. [2019-09-08 12:41:52,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38079 to 38077. [2019-09-08 12:41:52,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38077 states. [2019-09-08 12:41:52,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38077 states to 38077 states and 55164 transitions. [2019-09-08 12:41:52,073 INFO L78 Accepts]: Start accepts. Automaton has 38077 states and 55164 transitions. Word has length 99 [2019-09-08 12:41:52,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:52,073 INFO L475 AbstractCegarLoop]: Abstraction has 38077 states and 55164 transitions. [2019-09-08 12:41:52,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:41:52,073 INFO L276 IsEmpty]: Start isEmpty. Operand 38077 states and 55164 transitions. [2019-09-08 12:41:52,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:41:52,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:52,074 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:41:52,074 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:52,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:52,075 INFO L82 PathProgramCache]: Analyzing trace with hash -374029762, now seen corresponding path program 1 times [2019-09-08 12:41:52,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:52,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:52,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:52,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:52,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:52,169 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:41:52,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:52,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:41:52,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:41:52,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:41:52,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:41:52,170 INFO L87 Difference]: Start difference. First operand 38077 states and 55164 transitions. Second operand 5 states. [2019-09-08 12:41:57,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:57,576 INFO L93 Difference]: Finished difference Result 71613 states and 103375 transitions. [2019-09-08 12:41:57,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 12:41:57,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-09-08 12:41:57,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:57,658 INFO L225 Difference]: With dead ends: 71613 [2019-09-08 12:41:57,658 INFO L226 Difference]: Without dead ends: 71611 [2019-09-08 12:41:57,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:41:57,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71611 states. [2019-09-08 12:42:01,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71611 to 39229. [2019-09-08 12:42:01,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39229 states. [2019-09-08 12:42:01,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39229 states to 39229 states and 56252 transitions. [2019-09-08 12:42:01,169 INFO L78 Accepts]: Start accepts. Automaton has 39229 states and 56252 transitions. Word has length 100 [2019-09-08 12:42:01,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:01,170 INFO L475 AbstractCegarLoop]: Abstraction has 39229 states and 56252 transitions. [2019-09-08 12:42:01,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:42:01,170 INFO L276 IsEmpty]: Start isEmpty. Operand 39229 states and 56252 transitions. [2019-09-08 12:42:01,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:42:01,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:01,184 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:01,184 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:01,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:01,185 INFO L82 PathProgramCache]: Analyzing trace with hash 928377095, now seen corresponding path program 1 times [2019-09-08 12:42:01,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:01,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:01,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:01,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:01,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:01,411 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 12:42:01,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:01,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:01,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:01,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:01,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:01,413 INFO L87 Difference]: Start difference. First operand 39229 states and 56252 transitions. Second operand 9 states. [2019-09-08 12:42:18,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:18,796 INFO L93 Difference]: Finished difference Result 220301 states and 316868 transitions. [2019-09-08 12:42:18,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:42:18,797 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-08 12:42:18,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:19,100 INFO L225 Difference]: With dead ends: 220301 [2019-09-08 12:42:19,101 INFO L226 Difference]: Without dead ends: 206987 [2019-09-08 12:42:19,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:42:19,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206987 states. [2019-09-08 12:42:27,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206987 to 62333. [2019-09-08 12:42:27,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62333 states. [2019-09-08 12:42:28,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62333 states to 62333 states and 89148 transitions. [2019-09-08 12:42:28,072 INFO L78 Accepts]: Start accepts. Automaton has 62333 states and 89148 transitions. Word has length 134 [2019-09-08 12:42:28,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:28,072 INFO L475 AbstractCegarLoop]: Abstraction has 62333 states and 89148 transitions. [2019-09-08 12:42:28,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:28,073 INFO L276 IsEmpty]: Start isEmpty. Operand 62333 states and 89148 transitions. [2019-09-08 12:42:28,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:42:28,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:28,087 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:28,087 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:28,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:28,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1520560563, now seen corresponding path program 1 times [2019-09-08 12:42:28,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:28,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:28,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:28,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:28,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:28,218 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:42:28,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:42:28,218 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:42:28,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:28,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 1005 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 12:42:28,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:42:29,017 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 12:42:29,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:42:29,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-09-08 12:42:29,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:42:29,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:42:29,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:42:29,026 INFO L87 Difference]: Start difference. First operand 62333 states and 89148 transitions. Second operand 12 states. [2019-09-08 12:43:06,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:06,820 INFO L93 Difference]: Finished difference Result 396529 states and 569942 transitions. [2019-09-08 12:43:06,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 12:43:06,821 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 134 [2019-09-08 12:43:06,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:08,651 INFO L225 Difference]: With dead ends: 396529 [2019-09-08 12:43:08,651 INFO L226 Difference]: Without dead ends: 376879 [2019-09-08 12:43:08,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=237, Invalid=633, Unknown=0, NotChecked=0, Total=870 [2019-09-08 12:43:09,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376879 states. [2019-09-08 12:43:27,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376879 to 95293. [2019-09-08 12:43:27,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95293 states. [2019-09-08 12:43:27,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95293 states to 95293 states and 136572 transitions. [2019-09-08 12:43:27,828 INFO L78 Accepts]: Start accepts. Automaton has 95293 states and 136572 transitions. Word has length 134 [2019-09-08 12:43:27,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:27,829 INFO L475 AbstractCegarLoop]: Abstraction has 95293 states and 136572 transitions. [2019-09-08 12:43:27,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:43:27,829 INFO L276 IsEmpty]: Start isEmpty. Operand 95293 states and 136572 transitions. [2019-09-08 12:43:27,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:43:27,847 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:27,847 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:27,847 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:27,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:27,848 INFO L82 PathProgramCache]: Analyzing trace with hash -402225319, now seen corresponding path program 1 times [2019-09-08 12:43:27,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:27,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:27,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:27,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:27,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:27,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:28,095 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 12:43:28,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:28,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:28,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:28,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:28,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:28,098 INFO L87 Difference]: Start difference. First operand 95293 states and 136572 transitions. Second operand 9 states. [2019-09-08 12:43:51,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:51,236 INFO L93 Difference]: Finished difference Result 272141 states and 390340 transitions. [2019-09-08 12:43:51,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:43:51,237 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-08 12:43:51,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:51,599 INFO L225 Difference]: With dead ends: 272141 [2019-09-08 12:43:51,599 INFO L226 Difference]: Without dead ends: 200011 [2019-09-08 12:43:51,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:43:51,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200011 states. [2019-09-08 12:44:09,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200011 to 114813. [2019-09-08 12:44:09,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114813 states. [2019-09-08 12:44:09,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114813 states to 114813 states and 164284 transitions. [2019-09-08 12:44:09,846 INFO L78 Accepts]: Start accepts. Automaton has 114813 states and 164284 transitions. Word has length 134 [2019-09-08 12:44:09,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:09,847 INFO L475 AbstractCegarLoop]: Abstraction has 114813 states and 164284 transitions. [2019-09-08 12:44:09,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:09,847 INFO L276 IsEmpty]: Start isEmpty. Operand 114813 states and 164284 transitions. [2019-09-08 12:44:09,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:44:09,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:09,863 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:09,863 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:09,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:09,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1882658405, now seen corresponding path program 1 times [2019-09-08 12:44:09,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:09,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:09,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:09,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:09,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:10,120 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 12:44:10,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:10,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:10,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:10,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:10,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:10,122 INFO L87 Difference]: Start difference. First operand 114813 states and 164284 transitions. Second operand 9 states. [2019-09-08 12:44:36,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:36,067 INFO L93 Difference]: Finished difference Result 291661 states and 418052 transitions. [2019-09-08 12:44:36,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:44:36,068 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-08 12:44:36,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:36,358 INFO L225 Difference]: With dead ends: 291661 [2019-09-08 12:44:36,359 INFO L226 Difference]: Without dead ends: 219531 [2019-09-08 12:44:36,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:44:36,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219531 states. [2019-09-08 12:44:57,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219531 to 134333. [2019-09-08 12:44:57,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134333 states. [2019-09-08 12:44:57,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134333 states to 134333 states and 191996 transitions. [2019-09-08 12:44:57,953 INFO L78 Accepts]: Start accepts. Automaton has 134333 states and 191996 transitions. Word has length 134 [2019-09-08 12:44:57,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:57,953 INFO L475 AbstractCegarLoop]: Abstraction has 134333 states and 191996 transitions. [2019-09-08 12:44:57,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:57,953 INFO L276 IsEmpty]: Start isEmpty. Operand 134333 states and 191996 transitions. [2019-09-08 12:44:57,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:44:57,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:57,965 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:57,965 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:57,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:57,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1906403627, now seen corresponding path program 1 times [2019-09-08 12:44:57,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:57,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:57,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:57,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:57,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:58,201 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 12:44:58,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:58,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:58,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:58,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:58,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:58,203 INFO L87 Difference]: Start difference. First operand 134333 states and 191996 transitions. Second operand 9 states. [2019-09-08 12:45:26,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:26,956 INFO L93 Difference]: Finished difference Result 311181 states and 445764 transitions. [2019-09-08 12:45:26,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:45:26,957 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-08 12:45:26,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:27,272 INFO L225 Difference]: With dead ends: 311181 [2019-09-08 12:45:27,273 INFO L226 Difference]: Without dead ends: 239051 [2019-09-08 12:45:27,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:45:27,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239051 states. [2019-09-08 12:45:51,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239051 to 153853. [2019-09-08 12:45:51,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153853 states. [2019-09-08 12:45:51,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153853 states to 153853 states and 219708 transitions. [2019-09-08 12:45:51,475 INFO L78 Accepts]: Start accepts. Automaton has 153853 states and 219708 transitions. Word has length 134 [2019-09-08 12:45:51,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:51,475 INFO L475 AbstractCegarLoop]: Abstraction has 153853 states and 219708 transitions. [2019-09-08 12:45:51,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:51,475 INFO L276 IsEmpty]: Start isEmpty. Operand 153853 states and 219708 transitions. [2019-09-08 12:45:51,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:45:51,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:51,491 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:51,491 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:51,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:51,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1510132511, now seen corresponding path program 1 times [2019-09-08 12:45:51,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:51,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:51,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:51,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:51,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:51,618 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:45:51,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:45:51,619 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:45:51,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:51,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 1005 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 12:45:51,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:45:51,970 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 12:45:51,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:45:51,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-09-08 12:45:51,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:45:51,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:45:51,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:45:51,977 INFO L87 Difference]: Start difference. First operand 153853 states and 219708 transitions. Second operand 12 states. [2019-09-08 12:46:44,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:44,297 INFO L93 Difference]: Finished difference Result 455077 states and 652048 transitions. [2019-09-08 12:46:44,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 12:46:44,298 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 134 [2019-09-08 12:46:44,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:44,826 INFO L225 Difference]: With dead ends: 455077 [2019-09-08 12:46:44,827 INFO L226 Difference]: Without dead ends: 382947 [2019-09-08 12:46:44,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=315, Invalid=615, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:46:45,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382947 states. [2019-09-08 12:47:15,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382947 to 179965. [2019-09-08 12:47:15,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179965 states. [2019-09-08 12:47:15,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179965 states to 179965 states and 257404 transitions. [2019-09-08 12:47:15,727 INFO L78 Accepts]: Start accepts. Automaton has 179965 states and 257404 transitions. Word has length 134 [2019-09-08 12:47:15,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:15,728 INFO L475 AbstractCegarLoop]: Abstraction has 179965 states and 257404 transitions. [2019-09-08 12:47:15,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:47:15,728 INFO L276 IsEmpty]: Start isEmpty. Operand 179965 states and 257404 transitions. [2019-09-08 12:47:15,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:47:15,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:15,742 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:15,742 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:15,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:15,742 INFO L82 PathProgramCache]: Analyzing trace with hash -2090579181, now seen corresponding path program 1 times [2019-09-08 12:47:15,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:15,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:15,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:15,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:15,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:15,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:15,988 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 12:47:15,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:15,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:15,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:15,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:15,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:15,991 INFO L87 Difference]: Start difference. First operand 179965 states and 257404 transitions. Second operand 9 states. [2019-09-08 12:48:00,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:00,538 INFO L93 Difference]: Finished difference Result 399309 states and 572548 transitions. [2019-09-08 12:48:00,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:48:00,538 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-08 12:48:00,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:00,902 INFO L225 Difference]: With dead ends: 399309 [2019-09-08 12:48:00,902 INFO L226 Difference]: Without dead ends: 301067 [2019-09-08 12:48:01,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:48:01,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301067 states. [2019-09-08 12:48:32,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301067 to 199485. [2019-09-08 12:48:32,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199485 states. [2019-09-08 12:48:32,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199485 states to 199485 states and 285116 transitions. [2019-09-08 12:48:32,665 INFO L78 Accepts]: Start accepts. Automaton has 199485 states and 285116 transitions. Word has length 134 [2019-09-08 12:48:32,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:32,666 INFO L475 AbstractCegarLoop]: Abstraction has 199485 states and 285116 transitions. [2019-09-08 12:48:32,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:48:32,666 INFO L276 IsEmpty]: Start isEmpty. Operand 199485 states and 285116 transitions. [2019-09-08 12:48:32,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:48:32,683 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:32,683 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:48:32,683 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:32,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:32,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1251322482, now seen corresponding path program 1 times [2019-09-08 12:48:32,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:32,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:32,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:32,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:32,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:32,808 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 12:48:32,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:48:32,808 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:48:32,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:32,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 1004 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 12:48:32,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:48:33,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:48:33,372 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 12:48:33,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 12:48:33,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 10] total 12 [2019-09-08 12:48:33,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:48:33,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:48:33,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:48:33,385 INFO L87 Difference]: Start difference. First operand 199485 states and 285116 transitions. Second operand 12 states. [2019-09-08 12:53:20,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:53:20,026 INFO L93 Difference]: Finished difference Result 1902585 states and 2708090 transitions. [2019-09-08 12:53:20,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-08 12:53:20,028 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 135 [2019-09-08 12:53:20,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:53:22,962 INFO L225 Difference]: With dead ends: 1902585 [2019-09-08 12:53:22,963 INFO L226 Difference]: Without dead ends: 1703159 [2019-09-08 12:53:23,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1901 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1109, Invalid=4003, Unknown=0, NotChecked=0, Total=5112 [2019-09-08 12:53:24,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703159 states.