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-var-start-time.6.2.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:21:38,983 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:21:38,985 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:21:38,998 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:21:38,998 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:21:38,999 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:21:39,001 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:21:39,003 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:21:39,004 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:21:39,005 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:21:39,006 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:21:39,007 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:21:39,007 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:21:39,008 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:21:39,009 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:21:39,010 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:21:39,011 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:21:39,012 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:21:39,014 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:21:39,016 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:21:39,017 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:21:39,018 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:21:39,019 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:21:39,020 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:21:39,022 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:21:39,022 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:21:39,023 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:21:39,024 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:21:39,024 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:21:39,025 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:21:39,025 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:21:39,026 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:21:39,027 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:21:39,027 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:21:39,028 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:21:39,029 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:21:39,029 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:21:39,030 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:21:39,030 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:21:39,031 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:21:39,031 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:21:39,032 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 11:21:39,046 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:21:39,046 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:21:39,048 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:21:39,048 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:21:39,048 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:21:39,048 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:21:39,049 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:21:39,049 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:21:39,049 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:21:39,049 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:21:39,049 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:21:39,050 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:21:39,050 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:21:39,050 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:21:39,050 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:21:39,050 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:21:39,051 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:21:39,051 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:21:39,051 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:21:39,051 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:21:39,052 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:21:39,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:21:39,052 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:21:39,052 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:21:39,052 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:21:39,053 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:21:39,053 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:21:39,053 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:21:39,053 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:21:39,082 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:21:39,095 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:21:39,098 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:21:39,100 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:21:39,100 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:21:39,101 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2019-09-08 11:21:39,182 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01b7b6811/a5f0c3fe906d4bbc8f8557b37fb29f18/FLAGbe6f1845c [2019-09-08 11:21:39,668 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:21:39,669 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2019-09-08 11:21:39,682 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01b7b6811/a5f0c3fe906d4bbc8f8557b37fb29f18/FLAGbe6f1845c [2019-09-08 11:21:39,979 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01b7b6811/a5f0c3fe906d4bbc8f8557b37fb29f18 [2019-09-08 11:21:39,989 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:21:39,990 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:21:39,992 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:21:39,993 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:21:39,996 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:21:39,997 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:21:39" (1/1) ... [2019-09-08 11:21:40,000 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a379ef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:21:39, skipping insertion in model container [2019-09-08 11:21:40,001 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:21:39" (1/1) ... [2019-09-08 11:21:40,009 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:21:40,071 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:21:40,509 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:21:40,524 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:21:40,619 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:21:40,642 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:21:40,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:21:40 WrapperNode [2019-09-08 11:21:40,643 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:21:40,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:21:40,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:21:40,643 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:21:40,654 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:21:40" (1/1) ... [2019-09-08 11:21:40,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:21:40" (1/1) ... [2019-09-08 11:21:40,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:21:40" (1/1) ... [2019-09-08 11:21:40,667 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:21:40" (1/1) ... [2019-09-08 11:21:40,683 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:21:40" (1/1) ... [2019-09-08 11:21:40,695 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:21:40" (1/1) ... [2019-09-08 11:21:40,699 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:21:40" (1/1) ... [2019-09-08 11:21:40,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:21:40,705 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:21:40,706 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:21:40,706 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:21:40,707 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:21:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:21:40,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:21:40,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:21:40,763 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:21:40,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:21:40,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:21:40,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:21:40,764 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:21:40,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:21:40,764 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:21:40,764 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:21:40,764 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:21:40,765 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:21:40,765 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:21:40,765 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:21:40,765 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 11:21:40,765 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 11:21:40,766 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:21:40,766 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:21:40,766 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:21:40,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:21:40,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:21:41,618 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:21:41,619 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:21:41,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:21:41 BoogieIcfgContainer [2019-09-08 11:21:41,621 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:21:41,622 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:21:41,623 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:21:41,626 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:21:41,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:21:39" (1/3) ... [2019-09-08 11:21:41,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b8ee573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:21:41, skipping insertion in model container [2019-09-08 11:21:41,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:21:40" (2/3) ... [2019-09-08 11:21:41,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b8ee573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:21:41, skipping insertion in model container [2019-09-08 11:21:41,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:21:41" (3/3) ... [2019-09-08 11:21:41,634 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2019-09-08 11:21:41,645 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:21:41,658 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 11:21:41,676 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 11:21:41,709 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:21:41,710 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:21:41,710 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:21:41,711 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:21:41,711 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:21:41,711 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:21:41,711 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:21:41,712 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:21:41,712 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:21:41,735 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states. [2019-09-08 11:21:41,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 11:21:41,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:21:41,749 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:21:41,751 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:21:41,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:21:41,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1517721822, now seen corresponding path program 1 times [2019-09-08 11:21:41,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:21:41,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:21:41,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:41,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:21:41,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:21:42,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:21:42,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:21:42,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:21:42,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:21:42,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:21:42,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:21:42,327 INFO L87 Difference]: Start difference. First operand 163 states. Second operand 3 states. [2019-09-08 11:21:42,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:21:42,444 INFO L93 Difference]: Finished difference Result 382 states and 618 transitions. [2019-09-08 11:21:42,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:21:42,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-08 11:21:42,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:21:42,460 INFO L225 Difference]: With dead ends: 382 [2019-09-08 11:21:42,460 INFO L226 Difference]: Without dead ends: 259 [2019-09-08 11:21:42,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:21:42,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-09-08 11:21:42,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2019-09-08 11:21:42,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-08 11:21:42,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 382 transitions. [2019-09-08 11:21:42,534 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 382 transitions. Word has length 77 [2019-09-08 11:21:42,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:21:42,535 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 382 transitions. [2019-09-08 11:21:42,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:21:42,535 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 382 transitions. [2019-09-08 11:21:42,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 11:21:42,538 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:21:42,538 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:21:42,539 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:21:42,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:21:42,539 INFO L82 PathProgramCache]: Analyzing trace with hash -23001505, now seen corresponding path program 1 times [2019-09-08 11:21:42,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:21:42,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:21:42,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:42,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:21:42,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:21:42,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:21:42,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:21:42,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:21:42,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:21:42,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:21:42,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:21:42,687 INFO L87 Difference]: Start difference. First operand 257 states and 382 transitions. Second operand 3 states. [2019-09-08 11:21:42,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:21:42,764 INFO L93 Difference]: Finished difference Result 643 states and 998 transitions. [2019-09-08 11:21:42,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:21:42,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-08 11:21:42,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:21:42,770 INFO L225 Difference]: With dead ends: 643 [2019-09-08 11:21:42,770 INFO L226 Difference]: Without dead ends: 434 [2019-09-08 11:21:42,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:21:42,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-09-08 11:21:42,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 432. [2019-09-08 11:21:42,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-09-08 11:21:42,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 661 transitions. [2019-09-08 11:21:42,810 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 661 transitions. Word has length 77 [2019-09-08 11:21:42,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:21:42,811 INFO L475 AbstractCegarLoop]: Abstraction has 432 states and 661 transitions. [2019-09-08 11:21:42,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:21:42,811 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 661 transitions. [2019-09-08 11:21:42,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 11:21:42,813 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:21:42,813 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:21:42,814 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:21:42,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:21:42,814 INFO L82 PathProgramCache]: Analyzing trace with hash 995200598, now seen corresponding path program 1 times [2019-09-08 11:21:42,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:21:42,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:21:42,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:42,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:21:42,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:21:42,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:21:42,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:21:42,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:21:42,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:21:42,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:21:42,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:21:42,934 INFO L87 Difference]: Start difference. First operand 432 states and 661 transitions. Second operand 3 states. [2019-09-08 11:21:43,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:21:43,005 INFO L93 Difference]: Finished difference Result 1136 states and 1783 transitions. [2019-09-08 11:21:43,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:21:43,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-08 11:21:43,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:21:43,015 INFO L225 Difference]: With dead ends: 1136 [2019-09-08 11:21:43,025 INFO L226 Difference]: Without dead ends: 752 [2019-09-08 11:21:43,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:21:43,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-09-08 11:21:43,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 750. [2019-09-08 11:21:43,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states. [2019-09-08 11:21:43,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1165 transitions. [2019-09-08 11:21:43,094 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1165 transitions. Word has length 78 [2019-09-08 11:21:43,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:21:43,095 INFO L475 AbstractCegarLoop]: Abstraction has 750 states and 1165 transitions. [2019-09-08 11:21:43,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:21:43,095 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1165 transitions. [2019-09-08 11:21:43,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 11:21:43,097 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:21:43,098 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:21:43,098 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:21:43,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:21:43,098 INFO L82 PathProgramCache]: Analyzing trace with hash -122169238, now seen corresponding path program 1 times [2019-09-08 11:21:43,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:21:43,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:21:43,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:43,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:21:43,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:21:43,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:21:43,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:21:43,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:21:43,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:21:43,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:21:43,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:21:43,286 INFO L87 Difference]: Start difference. First operand 750 states and 1165 transitions. Second operand 3 states. [2019-09-08 11:21:43,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:21:43,354 INFO L93 Difference]: Finished difference Result 2026 states and 3191 transitions. [2019-09-08 11:21:43,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:21:43,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-08 11:21:43,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:21:43,362 INFO L225 Difference]: With dead ends: 2026 [2019-09-08 11:21:43,363 INFO L226 Difference]: Without dead ends: 1324 [2019-09-08 11:21:43,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:21:43,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2019-09-08 11:21:43,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1322. [2019-09-08 11:21:43,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2019-09-08 11:21:43,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 2065 transitions. [2019-09-08 11:21:43,423 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 2065 transitions. Word has length 79 [2019-09-08 11:21:43,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:21:43,424 INFO L475 AbstractCegarLoop]: Abstraction has 1322 states and 2065 transitions. [2019-09-08 11:21:43,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:21:43,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 2065 transitions. [2019-09-08 11:21:43,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 11:21:43,426 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:21:43,426 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:21:43,426 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:21:43,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:21:43,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1705087637, now seen corresponding path program 1 times [2019-09-08 11:21:43,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:21:43,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:21:43,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:43,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:21:43,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:21:43,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:21:43,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:21:43,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:21:43,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:21:43,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:21:43,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:21:43,524 INFO L87 Difference]: Start difference. First operand 1322 states and 2065 transitions. Second operand 3 states. [2019-09-08 11:21:43,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:21:43,643 INFO L93 Difference]: Finished difference Result 3614 states and 5683 transitions. [2019-09-08 11:21:43,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:21:43,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-08 11:21:43,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:21:43,657 INFO L225 Difference]: With dead ends: 3614 [2019-09-08 11:21:43,658 INFO L226 Difference]: Without dead ends: 2340 [2019-09-08 11:21:43,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:21:43,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2340 states. [2019-09-08 11:21:43,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2340 to 2338. [2019-09-08 11:21:43,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2338 states. [2019-09-08 11:21:43,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2338 states to 2338 states and 3649 transitions. [2019-09-08 11:21:43,791 INFO L78 Accepts]: Start accepts. Automaton has 2338 states and 3649 transitions. Word has length 80 [2019-09-08 11:21:43,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:21:43,792 INFO L475 AbstractCegarLoop]: Abstraction has 2338 states and 3649 transitions. [2019-09-08 11:21:43,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:21:43,792 INFO L276 IsEmpty]: Start isEmpty. Operand 2338 states and 3649 transitions. [2019-09-08 11:21:43,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 11:21:43,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:21:43,794 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:21:43,794 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:21:43,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:21:43,794 INFO L82 PathProgramCache]: Analyzing trace with hash 143370377, now seen corresponding path program 1 times [2019-09-08 11:21:43,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:21:43,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:21:43,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:43,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:21:43,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:21:43,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:21:43,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:21:43,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:21:43,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:21:43,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:21:43,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:21:43,989 INFO L87 Difference]: Start difference. First operand 2338 states and 3649 transitions. Second operand 3 states. [2019-09-08 11:21:44,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:21:44,224 INFO L93 Difference]: Finished difference Result 6406 states and 10019 transitions. [2019-09-08 11:21:44,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:21:44,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-08 11:21:44,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:21:44,251 INFO L225 Difference]: With dead ends: 6406 [2019-09-08 11:21:44,253 INFO L226 Difference]: Without dead ends: 4116 [2019-09-08 11:21:44,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:21:44,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4116 states. [2019-09-08 11:21:44,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4116 to 4114. [2019-09-08 11:21:44,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4114 states. [2019-09-08 11:21:44,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4114 states to 4114 states and 6385 transitions. [2019-09-08 11:21:44,519 INFO L78 Accepts]: Start accepts. Automaton has 4114 states and 6385 transitions. Word has length 81 [2019-09-08 11:21:44,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:21:44,521 INFO L475 AbstractCegarLoop]: Abstraction has 4114 states and 6385 transitions. [2019-09-08 11:21:44,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:21:44,521 INFO L276 IsEmpty]: Start isEmpty. Operand 4114 states and 6385 transitions. [2019-09-08 11:21:44,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 11:21:44,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:21:44,524 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:21:44,525 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:21:44,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:21:44,529 INFO L82 PathProgramCache]: Analyzing trace with hash 801365652, now seen corresponding path program 1 times [2019-09-08 11:21:44,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:21:44,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:21:44,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:44,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:21:44,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:21:44,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:21:44,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:21:44,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 11:21:44,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 11:21:44,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 11:21:44,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:21:44,786 INFO L87 Difference]: Start difference. First operand 4114 states and 6385 transitions. Second operand 8 states. [2019-09-08 11:21:46,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:21:46,156 INFO L93 Difference]: Finished difference Result 24830 states and 38327 transitions. [2019-09-08 11:21:46,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 11:21:46,156 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-09-08 11:21:46,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:21:46,279 INFO L225 Difference]: With dead ends: 24830 [2019-09-08 11:21:46,280 INFO L226 Difference]: Without dead ends: 20764 [2019-09-08 11:21:46,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:21:46,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20764 states. [2019-09-08 11:21:47,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20764 to 20754. [2019-09-08 11:21:47,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20754 states. [2019-09-08 11:21:47,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20754 states to 20754 states and 31921 transitions. [2019-09-08 11:21:47,484 INFO L78 Accepts]: Start accepts. Automaton has 20754 states and 31921 transitions. Word has length 82 [2019-09-08 11:21:47,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:21:47,485 INFO L475 AbstractCegarLoop]: Abstraction has 20754 states and 31921 transitions. [2019-09-08 11:21:47,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 11:21:47,485 INFO L276 IsEmpty]: Start isEmpty. Operand 20754 states and 31921 transitions. [2019-09-08 11:21:47,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 11:21:47,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:21:47,487 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:21:47,487 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:21:47,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:21:47,488 INFO L82 PathProgramCache]: Analyzing trace with hash 679148646, now seen corresponding path program 1 times [2019-09-08 11:21:47,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:21:47,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:21:47,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:47,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:21:47,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:47,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:21:47,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:21:47,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:21:47,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 11:21:47,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 11:21:47,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 11:21:47,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:21:47,708 INFO L87 Difference]: Start difference. First operand 20754 states and 31921 transitions. Second operand 8 states. [2019-09-08 11:21:47,959 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 21 [2019-09-08 11:21:51,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:21:51,796 INFO L93 Difference]: Finished difference Result 116896 states and 180152 transitions. [2019-09-08 11:21:51,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 11:21:51,796 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2019-09-08 11:21:51,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:21:52,085 INFO L225 Difference]: With dead ends: 116896 [2019-09-08 11:21:52,085 INFO L226 Difference]: Without dead ends: 96190 [2019-09-08 11:21:52,167 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-09-08 11:21:52,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96190 states. [2019-09-08 11:21:55,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96190 to 41458. [2019-09-08 11:21:55,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41458 states. [2019-09-08 11:21:55,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41458 states to 41458 states and 63025 transitions. [2019-09-08 11:21:55,965 INFO L78 Accepts]: Start accepts. Automaton has 41458 states and 63025 transitions. Word has length 84 [2019-09-08 11:21:55,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:21:55,965 INFO L475 AbstractCegarLoop]: Abstraction has 41458 states and 63025 transitions. [2019-09-08 11:21:55,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 11:21:55,965 INFO L276 IsEmpty]: Start isEmpty. Operand 41458 states and 63025 transitions. [2019-09-08 11:21:55,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:21:55,967 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:21:55,967 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] [2019-09-08 11:21:55,967 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:21:55,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:21:55,968 INFO L82 PathProgramCache]: Analyzing trace with hash -439761132, now seen corresponding path program 1 times [2019-09-08 11:21:55,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:21:55,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:21:55,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:55,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:21:55,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:21:56,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:21:56,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:21:56,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:21:56,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:21:56,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:21:56,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:21:56,065 INFO L87 Difference]: Start difference. First operand 41458 states and 63025 transitions. Second operand 5 states. [2019-09-08 11:21:59,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:21:59,632 INFO L93 Difference]: Finished difference Result 84404 states and 127538 transitions. [2019-09-08 11:21:59,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:21:59,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-09-08 11:21:59,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:21:59,903 INFO L225 Difference]: With dead ends: 84404 [2019-09-08 11:21:59,903 INFO L226 Difference]: Without dead ends: 84402 [2019-09-08 11:21:59,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:22:00,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84402 states. [2019-09-08 11:22:03,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84402 to 42994. [2019-09-08 11:22:03,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42994 states. [2019-09-08 11:22:03,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42994 states to 42994 states and 64561 transitions. [2019-09-08 11:22:03,306 INFO L78 Accepts]: Start accepts. Automaton has 42994 states and 64561 transitions. Word has length 85 [2019-09-08 11:22:03,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:22:03,306 INFO L475 AbstractCegarLoop]: Abstraction has 42994 states and 64561 transitions. [2019-09-08 11:22:03,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:22:03,307 INFO L276 IsEmpty]: Start isEmpty. Operand 42994 states and 64561 transitions. [2019-09-08 11:22:03,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 11:22:03,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:22:03,308 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] [2019-09-08 11:22:03,308 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:22:03,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:22:03,309 INFO L82 PathProgramCache]: Analyzing trace with hash -738073387, now seen corresponding path program 1 times [2019-09-08 11:22:03,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:22:03,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:22:03,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:22:03,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:22:03,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:22:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:22:03,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:22:03,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:22:03,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:22:03,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:22:03,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:22:03,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:22:03,382 INFO L87 Difference]: Start difference. First operand 42994 states and 64561 transitions. Second operand 3 states. [2019-09-08 11:22:07,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:22:07,330 INFO L93 Difference]: Finished difference Result 105240 states and 157989 transitions. [2019-09-08 11:22:07,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:22:07,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-09-08 11:22:07,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:22:07,435 INFO L225 Difference]: With dead ends: 105240 [2019-09-08 11:22:07,435 INFO L226 Difference]: Without dead ends: 62294 [2019-09-08 11:22:07,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:22:07,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62294 states. [2019-09-08 11:22:10,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62294 to 62292. [2019-09-08 11:22:10,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62292 states. [2019-09-08 11:22:10,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62292 states to 62292 states and 93123 transitions. [2019-09-08 11:22:10,515 INFO L78 Accepts]: Start accepts. Automaton has 62292 states and 93123 transitions. Word has length 86 [2019-09-08 11:22:10,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:22:10,515 INFO L475 AbstractCegarLoop]: Abstraction has 62292 states and 93123 transitions. [2019-09-08 11:22:10,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:22:10,515 INFO L276 IsEmpty]: Start isEmpty. Operand 62292 states and 93123 transitions. [2019-09-08 11:22:10,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 11:22:10,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:22:10,546 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] [2019-09-08 11:22:10,546 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:22:10,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:22:10,546 INFO L82 PathProgramCache]: Analyzing trace with hash 817269783, now seen corresponding path program 1 times [2019-09-08 11:22:10,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:22:10,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:22:10,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:22:10,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:22:10,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:22:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:22:10,672 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 11:22:10,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:22:10,673 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 11:22:10,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:22:10,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:22:10,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-08 11:22:10,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:22:11,191 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 11:22:11,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:22:11,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 11] total 12 [2019-09-08 11:22:11,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 11:22:11,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 11:22:11,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=72, Unknown=0, NotChecked=0, Total=132 [2019-09-08 11:22:11,208 INFO L87 Difference]: Start difference. First operand 62292 states and 93123 transitions. Second operand 12 states. [2019-09-08 11:22:20,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:22:20,015 INFO L93 Difference]: Finished difference Result 165782 states and 248407 transitions. [2019-09-08 11:22:20,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 11:22:20,015 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 115 [2019-09-08 11:22:20,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:22:20,497 INFO L225 Difference]: With dead ends: 165782 [2019-09-08 11:22:20,497 INFO L226 Difference]: Without dead ends: 122836 [2019-09-08 11:22:20,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=72, Unknown=0, NotChecked=0, Total=132 [2019-09-08 11:22:20,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122836 states. [2019-09-08 11:22:27,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122836 to 103572. [2019-09-08 11:22:27,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103572 states. [2019-09-08 11:22:27,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103572 states to 103572 states and 154307 transitions. [2019-09-08 11:22:27,852 INFO L78 Accepts]: Start accepts. Automaton has 103572 states and 154307 transitions. Word has length 115 [2019-09-08 11:22:27,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:22:27,853 INFO L475 AbstractCegarLoop]: Abstraction has 103572 states and 154307 transitions. [2019-09-08 11:22:27,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 11:22:27,853 INFO L276 IsEmpty]: Start isEmpty. Operand 103572 states and 154307 transitions. [2019-09-08 11:22:27,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 11:22:27,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:22:27,887 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:22:27,887 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:22:27,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:22:27,888 INFO L82 PathProgramCache]: Analyzing trace with hash 23744993, now seen corresponding path program 1 times [2019-09-08 11:22:27,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:22:27,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:22:27,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:22:27,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:22:27,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:22:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:22:27,981 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:22:27,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:22:27,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:22:27,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:22:27,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:22:27,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:22:27,982 INFO L87 Difference]: Start difference. First operand 103572 states and 154307 transitions. Second operand 3 states. [2019-09-08 11:22:38,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:22:38,354 INFO L93 Difference]: Finished difference Result 277336 states and 413189 transitions. [2019-09-08 11:22:38,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:22:38,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-08 11:22:38,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:22:38,745 INFO L225 Difference]: With dead ends: 277336 [2019-09-08 11:22:38,745 INFO L226 Difference]: Without dead ends: 187894 [2019-09-08 11:22:38,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:22:39,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187894 states. [2019-09-08 11:22:52,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187894 to 187892. [2019-09-08 11:22:52,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187892 states. [2019-09-08 11:22:52,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187892 states to 187892 states and 277987 transitions. [2019-09-08 11:22:52,744 INFO L78 Accepts]: Start accepts. Automaton has 187892 states and 277987 transitions. Word has length 116 [2019-09-08 11:22:52,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:22:52,744 INFO L475 AbstractCegarLoop]: Abstraction has 187892 states and 277987 transitions. [2019-09-08 11:22:52,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:22:52,744 INFO L276 IsEmpty]: Start isEmpty. Operand 187892 states and 277987 transitions. [2019-09-08 11:22:52,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 11:22:52,788 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:22:52,789 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:22:52,789 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:22:52,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:22:52,789 INFO L82 PathProgramCache]: Analyzing trace with hash 38840002, now seen corresponding path program 1 times [2019-09-08 11:22:52,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:22:52,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:22:52,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:22:52,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:22:52,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:22:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:22:52,940 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:22:52,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:22:52,940 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:22:52,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:22:53,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:22:53,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 931 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 11:22:53,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:22:53,264 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:22:53,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:22:53,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 11:22:53,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 11:22:53,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 11:22:53,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:22:53,283 INFO L87 Difference]: Start difference. First operand 187892 states and 277987 transitions. Second operand 11 states. [2019-09-08 11:23:16,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:23:16,550 INFO L93 Difference]: Finished difference Result 478136 states and 705932 transitions. [2019-09-08 11:23:16,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:23:16,550 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 116 [2019-09-08 11:23:16,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:23:17,083 INFO L225 Difference]: With dead ends: 478136 [2019-09-08 11:23:17,083 INFO L226 Difference]: Without dead ends: 339574 [2019-09-08 11:23:17,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 11:23:18,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339574 states. [2019-09-08 11:23:37,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339574 to 197972. [2019-09-08 11:23:37,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197972 states. [2019-09-08 11:23:37,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197972 states to 197972 states and 292771 transitions. [2019-09-08 11:23:37,358 INFO L78 Accepts]: Start accepts. Automaton has 197972 states and 292771 transitions. Word has length 116 [2019-09-08 11:23:37,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:23:37,359 INFO L475 AbstractCegarLoop]: Abstraction has 197972 states and 292771 transitions. [2019-09-08 11:23:37,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 11:23:37,359 INFO L276 IsEmpty]: Start isEmpty. Operand 197972 states and 292771 transitions. [2019-09-08 11:23:37,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 11:23:37,389 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:23:37,389 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:23:37,389 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:23:37,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:23:37,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1461057278, now seen corresponding path program 1 times [2019-09-08 11:23:37,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:23:37,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:23:37,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:23:37,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:23:37,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:23:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:23:37,471 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:23:37,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:23:37,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:23:37,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:23:37,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:23:37,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:23:37,473 INFO L87 Difference]: Start difference. First operand 197972 states and 292771 transitions. Second operand 3 states. [2019-09-08 11:23:58,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:23:58,902 INFO L93 Difference]: Finished difference Result 405346 states and 599908 transitions. [2019-09-08 11:23:58,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:23:58,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-08 11:23:58,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:23:59,294 INFO L225 Difference]: With dead ends: 405346 [2019-09-08 11:23:59,294 INFO L226 Difference]: Without dead ends: 289664 [2019-09-08 11:23:59,400 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:23:59,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289664 states. [2019-09-08 11:24:23,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289664 to 274382. [2019-09-08 11:24:23,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274382 states. [2019-09-08 11:24:24,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274382 states to 274382 states and 402722 transitions. [2019-09-08 11:24:24,168 INFO L78 Accepts]: Start accepts. Automaton has 274382 states and 402722 transitions. Word has length 116 [2019-09-08 11:24:24,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:24:24,168 INFO L475 AbstractCegarLoop]: Abstraction has 274382 states and 402722 transitions. [2019-09-08 11:24:24,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:24:24,168 INFO L276 IsEmpty]: Start isEmpty. Operand 274382 states and 402722 transitions. [2019-09-08 11:24:24,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 11:24:24,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:24:24,199 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:24:24,199 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:24:24,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:24:24,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1355459169, now seen corresponding path program 1 times [2019-09-08 11:24:24,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:24:24,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:24:24,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:24,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:24:24,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:24:24,281 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:24:24,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:24:24,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:24:24,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:24:24,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:24:24,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:24:24,284 INFO L87 Difference]: Start difference. First operand 274382 states and 402722 transitions. Second operand 3 states. [2019-09-08 11:24:53,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:24:53,159 INFO L93 Difference]: Finished difference Result 523136 states and 767032 transitions. [2019-09-08 11:24:53,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:24:53,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-08 11:24:53,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:24:53,718 INFO L225 Difference]: With dead ends: 523136 [2019-09-08 11:24:53,719 INFO L226 Difference]: Without dead ends: 372094 [2019-09-08 11:24:53,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:24:54,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372094 states. [2019-09-08 11:25:26,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372094 to 356812. [2019-09-08 11:25:26,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356812 states. [2019-09-08 11:25:26,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356812 states to 356812 states and 518710 transitions. [2019-09-08 11:25:26,787 INFO L78 Accepts]: Start accepts. Automaton has 356812 states and 518710 transitions. Word has length 116 [2019-09-08 11:25:26,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:25:26,788 INFO L475 AbstractCegarLoop]: Abstraction has 356812 states and 518710 transitions. [2019-09-08 11:25:26,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:25:26,788 INFO L276 IsEmpty]: Start isEmpty. Operand 356812 states and 518710 transitions. [2019-09-08 11:25:26,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 11:25:26,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:25:26,837 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:25:26,837 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:25:26,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:25:26,838 INFO L82 PathProgramCache]: Analyzing trace with hash 868623338, now seen corresponding path program 1 times [2019-09-08 11:25:26,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:25:26,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:25:26,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:26,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:25:26,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:25:26,914 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:25:26,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:25:26,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:25:26,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:25:26,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:25:26,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:25:26,916 INFO L87 Difference]: Start difference. First operand 356812 states and 518710 transitions. Second operand 3 states. [2019-09-08 11:26:01,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:26:01,054 INFO L93 Difference]: Finished difference Result 551760 states and 800284 transitions. [2019-09-08 11:26:01,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:26:01,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-08 11:26:01,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:26:01,647 INFO L225 Difference]: With dead ends: 551760 [2019-09-08 11:26:01,647 INFO L226 Difference]: Without dead ends: 368500 [2019-09-08 11:26:01,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:26:02,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368500 states. [2019-09-08 11:26:35,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368500 to 357936. [2019-09-08 11:26:35,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357936 states. [2019-09-08 11:26:35,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357936 states to 357936 states and 514467 transitions. [2019-09-08 11:26:35,774 INFO L78 Accepts]: Start accepts. Automaton has 357936 states and 514467 transitions. Word has length 116 [2019-09-08 11:26:35,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:26:35,774 INFO L475 AbstractCegarLoop]: Abstraction has 357936 states and 514467 transitions. [2019-09-08 11:26:35,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:26:35,774 INFO L276 IsEmpty]: Start isEmpty. Operand 357936 states and 514467 transitions. [2019-09-08 11:26:35,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 11:26:35,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:26:35,821 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:26:35,821 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:26:35,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:26:35,821 INFO L82 PathProgramCache]: Analyzing trace with hash -566872627, now seen corresponding path program 1 times [2019-09-08 11:26:35,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:26:35,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:26:35,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:26:35,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:26:35,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:26:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:26:35,893 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:26:35,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:26:35,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:26:35,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:26:35,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:26:35,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:26:35,898 INFO L87 Difference]: Start difference. First operand 357936 states and 514467 transitions. Second operand 3 states. [2019-09-08 11:27:26,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:27:26,804 INFO L93 Difference]: Finished difference Result 925645 states and 1329127 transitions. [2019-09-08 11:27:26,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:27:26,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-08 11:27:26,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:27:27,771 INFO L225 Difference]: With dead ends: 925645 [2019-09-08 11:27:27,771 INFO L226 Difference]: Without dead ends: 612717 [2019-09-08 11:27:28,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:27:28,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612717 states. [2019-09-08 11:28:29,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612717 to 606655. [2019-09-08 11:28:29,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606655 states. [2019-09-08 11:28:31,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606655 states to 606655 states and 863407 transitions. [2019-09-08 11:28:31,078 INFO L78 Accepts]: Start accepts. Automaton has 606655 states and 863407 transitions. Word has length 116 [2019-09-08 11:28:31,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:28:31,078 INFO L475 AbstractCegarLoop]: Abstraction has 606655 states and 863407 transitions. [2019-09-08 11:28:31,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:28:31,079 INFO L276 IsEmpty]: Start isEmpty. Operand 606655 states and 863407 transitions. [2019-09-08 11:28:31,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 11:28:31,136 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:28:31,136 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:28:31,136 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:28:31,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:28:31,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1377701724, now seen corresponding path program 1 times [2019-09-08 11:28:31,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:28:31,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:28:31,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:31,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:28:31,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:31,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:28:31,244 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 11:28:31,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:28:31,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:28:31,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:28:31,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:28:31,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:28:31,245 INFO L87 Difference]: Start difference. First operand 606655 states and 863407 transitions. Second operand 5 states. [2019-09-08 11:29:53,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:29:53,901 INFO L93 Difference]: Finished difference Result 1531418 states and 2175524 transitions. [2019-09-08 11:29:53,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:29:53,901 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2019-09-08 11:29:53,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:29:55,465 INFO L225 Difference]: With dead ends: 1531418 [2019-09-08 11:29:55,465 INFO L226 Difference]: Without dead ends: 924876 [2019-09-08 11:29:55,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:29:56,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924876 states. [2019-09-08 11:31:35,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924876 to 921819. [2019-09-08 11:31:35,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921819 states. [2019-09-08 11:31:37,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921819 states to 921819 states and 1303681 transitions. [2019-09-08 11:31:37,915 INFO L78 Accepts]: Start accepts. Automaton has 921819 states and 1303681 transitions. Word has length 116 [2019-09-08 11:31:37,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:31:37,915 INFO L475 AbstractCegarLoop]: Abstraction has 921819 states and 1303681 transitions. [2019-09-08 11:31:37,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:31:37,915 INFO L276 IsEmpty]: Start isEmpty. Operand 921819 states and 1303681 transitions. [2019-09-08 11:31:37,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 11:31:37,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:31:37,990 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:31:37,990 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:31:37,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:31:37,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1400705353, now seen corresponding path program 1 times [2019-09-08 11:31:37,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:31:37,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:31:37,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:31:37,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:31:37,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:31:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:31:38,119 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:31:38,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:31:38,120 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) [2019-09-08 11:31:38,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:31:38,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:31:38,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 931 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 11:31:38,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:31:38,421 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:31:38,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:31:38,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 11:31:38,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 11:31:38,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 11:31:38,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:31:38,437 INFO L87 Difference]: Start difference. First operand 921819 states and 1303681 transitions. Second operand 11 states.