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.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:41:16,046 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:41:16,048 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:41:16,059 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:41:16,060 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:41:16,061 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:41:16,062 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:41:16,064 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:41:16,066 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:41:16,066 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:41:16,067 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:41:16,069 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:41:16,069 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:41:16,070 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:41:16,071 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:41:16,072 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:41:16,073 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:41:16,074 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:41:16,076 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:41:16,078 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:41:16,079 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:41:16,080 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:41:16,082 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:41:16,082 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:41:16,085 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:41:16,085 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:41:16,086 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:41:16,087 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:41:16,087 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:41:16,088 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:41:16,088 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:41:16,089 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:41:16,090 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:41:16,091 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:41:16,092 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:41:16,093 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:41:16,093 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:41:16,094 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:41:16,094 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:41:16,095 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:41:16,095 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:41:16,096 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 10:41:16,112 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:41:16,112 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:41:16,113 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:41:16,113 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:41:16,113 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:41:16,114 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:41:16,114 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:41:16,114 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:41:16,114 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:41:16,114 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:41:16,115 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:41:16,115 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:41:16,115 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:41:16,115 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:41:16,115 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:41:16,116 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:41:16,116 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:41:16,116 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:41:16,116 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:41:16,116 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:41:16,117 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:41:16,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:41:16,117 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:41:16,117 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:41:16,117 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:41:16,118 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:41:16,118 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:41:16,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:41:16,118 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:41:16,145 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:41:16,158 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:41:16,161 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:41:16,162 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:41:16,163 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:41:16,163 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.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 10:41:16,221 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5adc433c2/d90bf64730ea4d819e9c7dea15c46693/FLAGfb3a488b9 [2019-09-08 10:41:16,664 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:41:16,665 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 10:41:16,684 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5adc433c2/d90bf64730ea4d819e9c7dea15c46693/FLAGfb3a488b9 [2019-09-08 10:41:17,025 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5adc433c2/d90bf64730ea4d819e9c7dea15c46693 [2019-09-08 10:41:17,036 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:41:17,037 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:41:17,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:41:17,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:41:17,043 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:41:17,044 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:41:17" (1/1) ... [2019-09-08 10:41:17,047 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45625c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:41:17, skipping insertion in model container [2019-09-08 10:41:17,047 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:41:17" (1/1) ... [2019-09-08 10:41:17,055 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:41:17,108 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:41:17,538 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:41:17,551 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:41:17,631 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:41:17,666 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:41:17,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:41:17 WrapperNode [2019-09-08 10:41:17,667 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:41:17,668 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:41:17,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:41:17,668 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:41:17,682 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:41:17" (1/1) ... [2019-09-08 10:41:17,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:41:17" (1/1) ... [2019-09-08 10:41:17,694 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:41:17" (1/1) ... [2019-09-08 10:41:17,695 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:41:17" (1/1) ... [2019-09-08 10:41:17,708 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:41:17" (1/1) ... [2019-09-08 10:41:17,717 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:41:17" (1/1) ... [2019-09-08 10:41:17,720 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:41:17" (1/1) ... [2019-09-08 10:41:17,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:41:17,724 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:41:17,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:41:17,725 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:41:17,726 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:41:17" (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 10:41:17,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:41:17,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:41:17,799 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:41:17,799 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:41:17,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:41:17,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:41:17,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 10:41:17,800 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:41:17,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:41:17,800 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:41:17,801 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:41:17,801 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:41:17,801 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:41:17,801 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:41:17,801 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:41:17,802 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:41:17,802 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:41:17,802 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:41:17,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:41:17,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:41:18,487 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:41:18,487 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:41:18,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:41:18 BoogieIcfgContainer [2019-09-08 10:41:18,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:41:18,490 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:41:18,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:41:18,494 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:41:18,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:41:17" (1/3) ... [2019-09-08 10:41:18,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba5f5f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:41:18, skipping insertion in model container [2019-09-08 10:41:18,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:41:17" (2/3) ... [2019-09-08 10:41:18,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba5f5f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:41:18, skipping insertion in model container [2019-09-08 10:41:18,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:41:18" (3/3) ... [2019-09-08 10:41:18,497 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 10:41:18,507 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:41:18,515 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 10:41:18,531 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 10:41:18,559 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:41:18,560 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:41:18,560 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:41:18,560 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:41:18,561 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:41:18,561 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:41:18,561 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:41:18,561 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:41:18,561 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:41:18,580 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states. [2019-09-08 10:41:18,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-08 10:41:18,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:41:18,589 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:41:18,591 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:41:18,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:41:18,597 INFO L82 PathProgramCache]: Analyzing trace with hash 66205719, now seen corresponding path program 1 times [2019-09-08 10:41:18,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:41:18,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:41:18,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:18,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:41:18,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:41:18,971 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 10:41:18,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:41:18,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:41:18,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:41:18,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:41:18,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:41:18,997 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 3 states. [2019-09-08 10:41:19,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:41:19,096 INFO L93 Difference]: Finished difference Result 273 states and 432 transitions. [2019-09-08 10:41:19,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:41:19,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-09-08 10:41:19,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:41:19,112 INFO L225 Difference]: With dead ends: 273 [2019-09-08 10:41:19,112 INFO L226 Difference]: Without dead ends: 179 [2019-09-08 10:41:19,116 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 10:41:19,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-08 10:41:19,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2019-09-08 10:41:19,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-08 10:41:19,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 263 transitions. [2019-09-08 10:41:19,179 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 263 transitions. Word has length 53 [2019-09-08 10:41:19,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:41:19,180 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 263 transitions. [2019-09-08 10:41:19,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:41:19,180 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 263 transitions. [2019-09-08 10:41:19,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-08 10:41:19,183 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:41:19,183 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:41:19,183 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:41:19,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:41:19,184 INFO L82 PathProgramCache]: Analyzing trace with hash -160431346, now seen corresponding path program 1 times [2019-09-08 10:41:19,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:41:19,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:41:19,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:19,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:41:19,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:41:19,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:41:19,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:41:19,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:41:19,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:41:19,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:41:19,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:41:19,385 INFO L87 Difference]: Start difference. First operand 177 states and 263 transitions. Second operand 3 states. [2019-09-08 10:41:19,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:41:19,449 INFO L93 Difference]: Finished difference Result 437 states and 675 transitions. [2019-09-08 10:41:19,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:41:19,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-09-08 10:41:19,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:41:19,459 INFO L225 Difference]: With dead ends: 437 [2019-09-08 10:41:19,459 INFO L226 Difference]: Without dead ends: 291 [2019-09-08 10:41:19,461 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 10:41:19,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-09-08 10:41:19,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2019-09-08 10:41:19,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-08 10:41:19,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 440 transitions. [2019-09-08 10:41:19,511 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 440 transitions. Word has length 54 [2019-09-08 10:41:19,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:41:19,511 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 440 transitions. [2019-09-08 10:41:19,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:41:19,512 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 440 transitions. [2019-09-08 10:41:19,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 10:41:19,517 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:41:19,519 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:41:19,519 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:41:19,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:41:19,519 INFO L82 PathProgramCache]: Analyzing trace with hash 783075062, now seen corresponding path program 1 times [2019-09-08 10:41:19,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:41:19,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:41:19,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:19,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:41:19,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:19,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:41:19,664 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 10:41:19,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:41:19,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:41:19,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:41:19,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:41:19,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:41:19,666 INFO L87 Difference]: Start difference. First operand 289 states and 440 transitions. Second operand 3 states. [2019-09-08 10:41:19,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:41:19,725 INFO L93 Difference]: Finished difference Result 741 states and 1154 transitions. [2019-09-08 10:41:19,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:41:19,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-09-08 10:41:19,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:41:19,731 INFO L225 Difference]: With dead ends: 741 [2019-09-08 10:41:19,731 INFO L226 Difference]: Without dead ends: 483 [2019-09-08 10:41:19,735 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 10:41:19,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-09-08 10:41:19,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 481. [2019-09-08 10:41:19,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-09-08 10:41:19,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 740 transitions. [2019-09-08 10:41:19,773 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 740 transitions. Word has length 55 [2019-09-08 10:41:19,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:41:19,774 INFO L475 AbstractCegarLoop]: Abstraction has 481 states and 740 transitions. [2019-09-08 10:41:19,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:41:19,774 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 740 transitions. [2019-09-08 10:41:19,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 10:41:19,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:41:19,776 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:41:19,776 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:41:19,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:41:19,777 INFO L82 PathProgramCache]: Analyzing trace with hash -842625673, now seen corresponding path program 1 times [2019-09-08 10:41:19,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:41:19,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:41:19,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:19,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:41:19,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:41:19,896 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 10:41:19,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:41:19,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:41:19,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:41:19,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:41:19,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:41:19,898 INFO L87 Difference]: Start difference. First operand 481 states and 740 transitions. Second operand 6 states. [2019-09-08 10:41:20,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:41:20,163 INFO L93 Difference]: Finished difference Result 2731 states and 4285 transitions. [2019-09-08 10:41:20,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:41:20,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-09-08 10:41:20,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:41:20,178 INFO L225 Difference]: With dead ends: 2731 [2019-09-08 10:41:20,178 INFO L226 Difference]: Without dead ends: 2281 [2019-09-08 10:41:20,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:41:20,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2281 states. [2019-09-08 10:41:20,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2281 to 929. [2019-09-08 10:41:20,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 929 states. [2019-09-08 10:41:20,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1432 transitions. [2019-09-08 10:41:20,301 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1432 transitions. Word has length 56 [2019-09-08 10:41:20,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:41:20,303 INFO L475 AbstractCegarLoop]: Abstraction has 929 states and 1432 transitions. [2019-09-08 10:41:20,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:41:20,304 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1432 transitions. [2019-09-08 10:41:20,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 10:41:20,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:41:20,313 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:41:20,313 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:41:20,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:41:20,314 INFO L82 PathProgramCache]: Analyzing trace with hash -370124845, now seen corresponding path program 1 times [2019-09-08 10:41:20,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:41:20,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:41:20,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:20,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:41:20,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:41:20,504 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 10:41:20,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:41:20,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:41:20,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:41:20,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:41:20,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:41:20,505 INFO L87 Difference]: Start difference. First operand 929 states and 1432 transitions. Second operand 6 states. [2019-09-08 10:41:20,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:41:20,821 INFO L93 Difference]: Finished difference Result 4033 states and 6236 transitions. [2019-09-08 10:41:20,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:41:20,822 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-09-08 10:41:20,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:41:20,840 INFO L225 Difference]: With dead ends: 4033 [2019-09-08 10:41:20,840 INFO L226 Difference]: Without dead ends: 3135 [2019-09-08 10:41:20,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:41:20,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2019-09-08 10:41:21,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 3129. [2019-09-08 10:41:21,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2019-09-08 10:41:21,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 4816 transitions. [2019-09-08 10:41:21,097 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 4816 transitions. Word has length 57 [2019-09-08 10:41:21,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:41:21,097 INFO L475 AbstractCegarLoop]: Abstraction has 3129 states and 4816 transitions. [2019-09-08 10:41:21,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:41:21,098 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 4816 transitions. [2019-09-08 10:41:21,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 10:41:21,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:41:21,099 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:41:21,100 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:41:21,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:41:21,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1007315784, now seen corresponding path program 1 times [2019-09-08 10:41:21,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:41:21,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:41:21,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:21,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:41:21,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:21,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:41:21,149 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 10:41:21,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:41:21,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:41:21,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:41:21,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:41:21,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:41:21,151 INFO L87 Difference]: Start difference. First operand 3129 states and 4816 transitions. Second operand 3 states. [2019-09-08 10:41:21,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:41:21,574 INFO L93 Difference]: Finished difference Result 8253 states and 12658 transitions. [2019-09-08 10:41:21,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:41:21,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-09-08 10:41:21,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:41:21,604 INFO L225 Difference]: With dead ends: 8253 [2019-09-08 10:41:21,604 INFO L226 Difference]: Without dead ends: 5155 [2019-09-08 10:41:21,611 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 10:41:21,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5155 states. [2019-09-08 10:41:21,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5155 to 5153. [2019-09-08 10:41:21,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5153 states. [2019-09-08 10:41:21,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5153 states to 5153 states and 7808 transitions. [2019-09-08 10:41:21,957 INFO L78 Accepts]: Start accepts. Automaton has 5153 states and 7808 transitions. Word has length 58 [2019-09-08 10:41:21,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:41:21,958 INFO L475 AbstractCegarLoop]: Abstraction has 5153 states and 7808 transitions. [2019-09-08 10:41:21,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:41:21,958 INFO L276 IsEmpty]: Start isEmpty. Operand 5153 states and 7808 transitions. [2019-09-08 10:41:21,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:41:21,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:41:21,960 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:41:21,960 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:41:21,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:41:21,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1404763850, now seen corresponding path program 1 times [2019-09-08 10:41:21,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:41:21,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:41:21,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:21,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:41:21,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:41:22,056 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 10:41:22,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:41:22,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:41:22,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:41:22,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:41:22,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:41:22,058 INFO L87 Difference]: Start difference. First operand 5153 states and 7808 transitions. Second operand 5 states. [2019-09-08 10:41:22,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:41:22,988 INFO L93 Difference]: Finished difference Result 15397 states and 23362 transitions. [2019-09-08 10:41:22,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:41:22,989 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-09-08 10:41:22,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:41:23,122 INFO L225 Difference]: With dead ends: 15397 [2019-09-08 10:41:23,123 INFO L226 Difference]: Without dead ends: 10275 [2019-09-08 10:41:23,140 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 10:41:23,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10275 states. [2019-09-08 10:41:23,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10275 to 10273. [2019-09-08 10:41:23,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10273 states. [2019-09-08 10:41:23,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10273 states to 10273 states and 15472 transitions. [2019-09-08 10:41:23,972 INFO L78 Accepts]: Start accepts. Automaton has 10273 states and 15472 transitions. Word has length 59 [2019-09-08 10:41:23,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:41:23,973 INFO L475 AbstractCegarLoop]: Abstraction has 10273 states and 15472 transitions. [2019-09-08 10:41:23,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:41:23,974 INFO L276 IsEmpty]: Start isEmpty. Operand 10273 states and 15472 transitions. [2019-09-08 10:41:23,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:41:23,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:41:23,974 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:41:23,975 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:41:23,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:41:23,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1120231739, now seen corresponding path program 1 times [2019-09-08 10:41:23,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:41:23,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:41:23,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:23,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:41:23,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:41:24,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:41:24,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:41:24,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:41:24,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:41:24,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:41:24,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:41:24,078 INFO L87 Difference]: Start difference. First operand 10273 states and 15472 transitions. Second operand 5 states. [2019-09-08 10:41:25,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:41:25,252 INFO L93 Difference]: Finished difference Result 21027 states and 31425 transitions. [2019-09-08 10:41:25,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:41:25,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-09-08 10:41:25,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:41:25,328 INFO L225 Difference]: With dead ends: 21027 [2019-09-08 10:41:25,329 INFO L226 Difference]: Without dead ends: 21025 [2019-09-08 10:41:25,337 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 10:41:25,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21025 states. [2019-09-08 10:41:26,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21025 to 10785. [2019-09-08 10:41:26,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10785 states. [2019-09-08 10:41:26,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10785 states to 10785 states and 15984 transitions. [2019-09-08 10:41:26,276 INFO L78 Accepts]: Start accepts. Automaton has 10785 states and 15984 transitions. Word has length 59 [2019-09-08 10:41:26,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:41:26,277 INFO L475 AbstractCegarLoop]: Abstraction has 10785 states and 15984 transitions. [2019-09-08 10:41:26,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:41:26,277 INFO L276 IsEmpty]: Start isEmpty. Operand 10785 states and 15984 transitions. [2019-09-08 10:41:26,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 10:41:26,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:41:26,278 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:41:26,278 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:41:26,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:41:26,279 INFO L82 PathProgramCache]: Analyzing trace with hash -357825804, now seen corresponding path program 1 times [2019-09-08 10:41:26,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:41:26,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:41:26,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:26,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:41:26,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:41:26,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:41:26,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:41:26,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:41:26,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:41:26,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:41:26,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:41:26,355 INFO L87 Difference]: Start difference. First operand 10785 states and 15984 transitions. Second operand 3 states. [2019-09-08 10:41:27,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:41:27,307 INFO L93 Difference]: Finished difference Result 24015 states and 35528 transitions. [2019-09-08 10:41:27,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:41:27,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-08 10:41:27,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:41:27,341 INFO L225 Difference]: With dead ends: 24015 [2019-09-08 10:41:27,341 INFO L226 Difference]: Without dead ends: 13261 [2019-09-08 10:41:27,364 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 10:41:27,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13261 states. [2019-09-08 10:41:28,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13261 to 13203. [2019-09-08 10:41:28,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13203 states. [2019-09-08 10:41:28,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13203 states to 13203 states and 19406 transitions. [2019-09-08 10:41:28,128 INFO L78 Accepts]: Start accepts. Automaton has 13203 states and 19406 transitions. Word has length 60 [2019-09-08 10:41:28,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:41:28,128 INFO L475 AbstractCegarLoop]: Abstraction has 13203 states and 19406 transitions. [2019-09-08 10:41:28,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:41:28,129 INFO L276 IsEmpty]: Start isEmpty. Operand 13203 states and 19406 transitions. [2019-09-08 10:41:28,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 10:41:28,136 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:41:28,136 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:41:28,137 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:41:28,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:41:28,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1589729241, now seen corresponding path program 1 times [2019-09-08 10:41:28,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:41:28,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:41:28,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:28,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:41:28,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:41:28,364 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:41:28,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:41:28,365 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 10:41:28,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:41:28,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:41:28,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 10:41:28,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:41:28,644 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 10:41:28,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:41:28,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4] total 12 [2019-09-08 10:41:28,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 10:41:28,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 10:41:28,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 10:41:28,660 INFO L87 Difference]: Start difference. First operand 13203 states and 19406 transitions. Second operand 12 states. [2019-09-08 10:41:44,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:41:44,075 INFO L93 Difference]: Finished difference Result 163523 states and 236824 transitions. [2019-09-08 10:41:44,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-08 10:41:44,076 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 83 [2019-09-08 10:41:44,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:41:44,452 INFO L225 Difference]: With dead ends: 163523 [2019-09-08 10:41:44,452 INFO L226 Difference]: Without dead ends: 150353 [2019-09-08 10:41:44,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3728 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1651, Invalid=7855, Unknown=0, NotChecked=0, Total=9506 [2019-09-08 10:41:44,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150353 states. [2019-09-08 10:41:50,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150353 to 38583. [2019-09-08 10:41:50,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38583 states. [2019-09-08 10:41:50,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38583 states to 38583 states and 55550 transitions. [2019-09-08 10:41:50,183 INFO L78 Accepts]: Start accepts. Automaton has 38583 states and 55550 transitions. Word has length 83 [2019-09-08 10:41:50,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:41:50,183 INFO L475 AbstractCegarLoop]: Abstraction has 38583 states and 55550 transitions. [2019-09-08 10:41:50,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 10:41:50,184 INFO L276 IsEmpty]: Start isEmpty. Operand 38583 states and 55550 transitions. [2019-09-08 10:41:50,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 10:41:50,194 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:41:50,194 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] [2019-09-08 10:41:50,194 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:41:50,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:41:50,195 INFO L82 PathProgramCache]: Analyzing trace with hash 972468303, now seen corresponding path program 1 times [2019-09-08 10:41:50,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:41:50,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:41:50,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:50,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:41:50,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:41:50,255 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:41:50,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:41:50,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:41:50,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:41:50,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:41:50,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:41:50,257 INFO L87 Difference]: Start difference. First operand 38583 states and 55550 transitions. Second operand 3 states. [2019-09-08 10:41:54,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:41:54,210 INFO L93 Difference]: Finished difference Result 90644 states and 130970 transitions. [2019-09-08 10:41:54,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:41:54,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-08 10:41:54,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:41:54,352 INFO L225 Difference]: With dead ends: 90644 [2019-09-08 10:41:54,353 INFO L226 Difference]: Without dead ends: 59346 [2019-09-08 10:41:54,423 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 10:41:54,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59346 states. [2019-09-08 10:41:59,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59346 to 59344. [2019-09-08 10:41:59,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59344 states. [2019-09-08 10:41:59,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59344 states to 59344 states and 84992 transitions. [2019-09-08 10:41:59,674 INFO L78 Accepts]: Start accepts. Automaton has 59344 states and 84992 transitions. Word has length 83 [2019-09-08 10:41:59,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:41:59,674 INFO L475 AbstractCegarLoop]: Abstraction has 59344 states and 84992 transitions. [2019-09-08 10:41:59,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:41:59,674 INFO L276 IsEmpty]: Start isEmpty. Operand 59344 states and 84992 transitions. [2019-09-08 10:41:59,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 10:41:59,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:41:59,690 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:41:59,690 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:41:59,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:41:59,690 INFO L82 PathProgramCache]: Analyzing trace with hash -256954202, now seen corresponding path program 1 times [2019-09-08 10:41:59,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:41:59,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:41:59,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:59,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:41:59,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:41:59,778 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 10:41:59,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:41:59,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:41:59,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:41:59,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:41:59,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:41:59,779 INFO L87 Difference]: Start difference. First operand 59344 states and 84992 transitions. Second operand 6 states. [2019-09-08 10:42:11,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:42:11,490 INFO L93 Difference]: Finished difference Result 226242 states and 322775 transitions. [2019-09-08 10:42:11,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:42:11,491 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-09-08 10:42:11,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:42:11,788 INFO L225 Difference]: With dead ends: 226242 [2019-09-08 10:42:11,789 INFO L226 Difference]: Without dead ends: 166932 [2019-09-08 10:42:11,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:42:12,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166932 states. [2019-09-08 10:42:25,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166932 to 166928. [2019-09-08 10:42:25,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166928 states. [2019-09-08 10:42:25,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166928 states to 166928 states and 236592 transitions. [2019-09-08 10:42:25,945 INFO L78 Accepts]: Start accepts. Automaton has 166928 states and 236592 transitions. Word has length 83 [2019-09-08 10:42:25,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:42:25,945 INFO L475 AbstractCegarLoop]: Abstraction has 166928 states and 236592 transitions. [2019-09-08 10:42:25,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:42:25,946 INFO L276 IsEmpty]: Start isEmpty. Operand 166928 states and 236592 transitions. [2019-09-08 10:42:25,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 10:42:25,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:42:25,964 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:42:25,964 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:42:25,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:42:25,964 INFO L82 PathProgramCache]: Analyzing trace with hash -526229301, now seen corresponding path program 1 times [2019-09-08 10:42:25,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:42:25,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:42:25,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:25,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:42:25,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:25,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:42:26,044 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:42:26,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:42:26,045 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) [2019-09-08 10:42:26,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 10:42:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:42:26,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 10:42:26,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:42:26,241 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:42:26,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:42:26,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 10:42:26,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 10:42:26,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 10:42:26,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:42:26,249 INFO L87 Difference]: Start difference. First operand 166928 states and 236592 transitions. Second operand 11 states. [2019-09-08 10:42:55,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:42:55,484 INFO L93 Difference]: Finished difference Result 497319 states and 705378 transitions. [2019-09-08 10:42:55,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:42:55,484 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2019-09-08 10:42:55,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:42:55,983 INFO L225 Difference]: With dead ends: 497319 [2019-09-08 10:42:55,983 INFO L226 Difference]: Without dead ends: 357389 [2019-09-08 10:42:56,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 10:42:56,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357389 states. [2019-09-08 10:43:17,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357389 to 199800. [2019-09-08 10:43:17,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199800 states. [2019-09-08 10:43:17,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199800 states to 199800 states and 283052 transitions. [2019-09-08 10:43:17,801 INFO L78 Accepts]: Start accepts. Automaton has 199800 states and 283052 transitions. Word has length 83 [2019-09-08 10:43:17,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:43:17,802 INFO L475 AbstractCegarLoop]: Abstraction has 199800 states and 283052 transitions. [2019-09-08 10:43:17,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 10:43:17,802 INFO L276 IsEmpty]: Start isEmpty. Operand 199800 states and 283052 transitions. [2019-09-08 10:43:17,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 10:43:17,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:43:17,819 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:43:17,819 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:43:17,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:43:17,819 INFO L82 PathProgramCache]: Analyzing trace with hash -2004680150, now seen corresponding path program 1 times [2019-09-08 10:43:17,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:43:17,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:43:17,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:43:17,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:43:17,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:43:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:43:17,876 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:43:17,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:43:17,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:43:17,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:43:17,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:43:17,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:43:17,879 INFO L87 Difference]: Start difference. First operand 199800 states and 283052 transitions. Second operand 3 states. [2019-09-08 10:43:42,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:43:42,106 INFO L93 Difference]: Finished difference Result 411012 states and 581593 transitions. [2019-09-08 10:43:42,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:43:42,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-08 10:43:42,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:43:42,481 INFO L225 Difference]: With dead ends: 411012 [2019-09-08 10:43:42,482 INFO L226 Difference]: Without dead ends: 282658 [2019-09-08 10:43:42,587 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 10:43:42,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282658 states. [2019-09-08 10:44:08,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282658 to 264444. [2019-09-08 10:44:08,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264444 states. [2019-09-08 10:44:09,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264444 states to 264444 states and 370491 transitions. [2019-09-08 10:44:09,090 INFO L78 Accepts]: Start accepts. Automaton has 264444 states and 370491 transitions. Word has length 83 [2019-09-08 10:44:09,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:44:09,091 INFO L475 AbstractCegarLoop]: Abstraction has 264444 states and 370491 transitions. [2019-09-08 10:44:09,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:44:09,091 INFO L276 IsEmpty]: Start isEmpty. Operand 264444 states and 370491 transitions. [2019-09-08 10:44:09,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 10:44:09,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:44:09,107 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:44:09,107 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:44:09,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:44:09,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1803451315, now seen corresponding path program 1 times [2019-09-08 10:44:09,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:44:09,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:44:09,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:09,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:44:09,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:44:09,160 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:44:09,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:44:09,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:44:09,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:44:09,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:44:09,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:44:09,162 INFO L87 Difference]: Start difference. First operand 264444 states and 370491 transitions. Second operand 3 states. [2019-09-08 10:44:37,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:44:37,318 INFO L93 Difference]: Finished difference Result 432358 states and 603009 transitions. [2019-09-08 10:44:37,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:44:37,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-08 10:44:37,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:44:37,674 INFO L225 Difference]: With dead ends: 432358 [2019-09-08 10:44:37,674 INFO L226 Difference]: Without dead ends: 278181 [2019-09-08 10:44:37,787 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 10:44:37,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278181 states. [2019-09-08 10:45:04,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278181 to 263434. [2019-09-08 10:45:04,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263434 states. [2019-09-08 10:45:05,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263434 states to 263434 states and 363640 transitions. [2019-09-08 10:45:05,162 INFO L78 Accepts]: Start accepts. Automaton has 263434 states and 363640 transitions. Word has length 83 [2019-09-08 10:45:05,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:45:05,162 INFO L475 AbstractCegarLoop]: Abstraction has 263434 states and 363640 transitions. [2019-09-08 10:45:05,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:45:05,162 INFO L276 IsEmpty]: Start isEmpty. Operand 263434 states and 363640 transitions. [2019-09-08 10:45:05,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 10:45:05,177 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:45:05,177 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:45:05,177 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:45:05,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:45:05,177 INFO L82 PathProgramCache]: Analyzing trace with hash -55443058, now seen corresponding path program 1 times [2019-09-08 10:45:05,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:45:05,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:45:05,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:05,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:45:05,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:45:05,248 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 10:45:05,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:45:05,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:45:05,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:45:05,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:45:05,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:45:05,250 INFO L87 Difference]: Start difference. First operand 263434 states and 363640 transitions. Second operand 6 states. [2019-09-08 10:46:09,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:46:09,233 INFO L93 Difference]: Finished difference Result 918455 states and 1263302 transitions. [2019-09-08 10:46:09,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:46:09,234 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-09-08 10:46:09,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:46:10,229 INFO L225 Difference]: With dead ends: 918455 [2019-09-08 10:46:10,230 INFO L226 Difference]: Without dead ends: 655235 [2019-09-08 10:46:10,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:46:10,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655235 states. [2019-09-08 10:47:22,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655235 to 645577. [2019-09-08 10:47:22,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645577 states. [2019-09-08 10:47:23,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645577 states to 645577 states and 885171 transitions. [2019-09-08 10:47:23,217 INFO L78 Accepts]: Start accepts. Automaton has 645577 states and 885171 transitions. Word has length 83 [2019-09-08 10:47:23,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:47:23,218 INFO L475 AbstractCegarLoop]: Abstraction has 645577 states and 885171 transitions. [2019-09-08 10:47:23,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:47:23,218 INFO L276 IsEmpty]: Start isEmpty. Operand 645577 states and 885171 transitions. [2019-09-08 10:47:23,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 10:47:23,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:47:23,238 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:47:23,238 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:47:23,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:47:23,238 INFO L82 PathProgramCache]: Analyzing trace with hash -212390925, now seen corresponding path program 1 times [2019-09-08 10:47:23,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:47:23,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:47:23,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:23,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:47:23,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:23,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:47:23,331 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:47:23,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:47:23,331 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 10:47:23,355 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 10:47:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:47:23,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 10:47:23,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:47:23,526 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:47:23,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:47:23,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 10:47:23,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 10:47:23,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 10:47:23,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:47:23,542 INFO L87 Difference]: Start difference. First operand 645577 states and 885171 transitions. Second operand 11 states. [2019-09-08 10:49:34,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:49:34,283 INFO L93 Difference]: Finished difference Result 1444398 states and 1974389 transitions. [2019-09-08 10:49:34,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:49:34,283 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2019-09-08 10:49:34,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:49:36,148 INFO L225 Difference]: With dead ends: 1444398 [2019-09-08 10:49:36,148 INFO L226 Difference]: Without dead ends: 1196044 [2019-09-08 10:49:36,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 10:49:37,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196044 states. [2019-09-08 10:51:15,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196044 to 701701. [2019-09-08 10:51:15,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701701 states. [2019-09-08 10:51:16,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701701 states to 701701 states and 961125 transitions. [2019-09-08 10:51:16,910 INFO L78 Accepts]: Start accepts. Automaton has 701701 states and 961125 transitions. Word has length 83 [2019-09-08 10:51:16,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:51:16,910 INFO L475 AbstractCegarLoop]: Abstraction has 701701 states and 961125 transitions. [2019-09-08 10:51:16,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 10:51:16,910 INFO L276 IsEmpty]: Start isEmpty. Operand 701701 states and 961125 transitions. [2019-09-08 10:51:16,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 10:51:16,927 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:51:16,927 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:51:16,927 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:51:16,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:51:16,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1701976494, now seen corresponding path program 1 times [2019-09-08 10:51:16,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:51:16,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:51:16,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:16,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:51:16,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:51:17,004 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:51:17,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:51:17,005 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 10:51:17,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:51:17,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:51:17,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 10:51:17,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:51:17,200 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:51:17,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:51:17,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 10:51:17,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 10:51:17,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 10:51:17,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:51:17,206 INFO L87 Difference]: Start difference. First operand 701701 states and 961125 transitions. Second operand 11 states.