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.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:47:56,522 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:47:56,524 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:47:56,536 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:47:56,537 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:47:56,538 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:47:56,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:47:56,541 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:47:56,543 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:47:56,544 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:47:56,545 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:47:56,546 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:47:56,546 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:47:56,547 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:47:56,548 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:47:56,549 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:47:56,550 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:47:56,551 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:47:56,552 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:47:56,554 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:47:56,556 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:47:56,557 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:47:56,558 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:47:56,559 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:47:56,562 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:47:56,562 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:47:56,562 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:47:56,563 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:47:56,564 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:47:56,566 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:47:56,567 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:47:56,569 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:47:56,571 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:47:56,572 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:47:56,573 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:47:56,573 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:47:56,574 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:47:56,574 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:47:56,574 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:47:56,577 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:47:56,578 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:47:56,580 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:47:56,608 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:47:56,608 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:47:56,610 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:47:56,610 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:47:56,611 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:47:56,611 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:47:56,611 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:47:56,611 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:47:56,611 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:47:56,612 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:47:56,613 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:47:56,613 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:47:56,613 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:47:56,613 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:47:56,614 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:47:56,614 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:47:56,614 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:47:56,614 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:47:56,614 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:47:56,615 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:47:56,615 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:47:56,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:47:56,615 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:47:56,616 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:47:56,616 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:47:56,616 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:47:56,616 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:47:56,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:47:56,617 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:47:56,674 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:47:56,686 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:47:56,690 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:47:56,691 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:47:56,692 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:47:56,692 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.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 10:47:56,753 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3bc0749c/cd80f72c01ba4260b7353c6687f6f87e/FLAGf695351c3 [2019-09-08 10:47:57,277 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:47:57,282 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 10:47:57,300 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3bc0749c/cd80f72c01ba4260b7353c6687f6f87e/FLAGf695351c3 [2019-09-08 10:47:57,606 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3bc0749c/cd80f72c01ba4260b7353c6687f6f87e [2019-09-08 10:47:57,616 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:47:57,618 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:47:57,619 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:47:57,619 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:47:57,624 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:47:57,625 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:47:57" (1/1) ... [2019-09-08 10:47:57,628 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76b08670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:47:57, skipping insertion in model container [2019-09-08 10:47:57,629 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:47:57" (1/1) ... [2019-09-08 10:47:57,635 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:47:57,687 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:47:57,939 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:47:57,954 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:47:58,117 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:47:58,142 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:47:58,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:47:58 WrapperNode [2019-09-08 10:47:58,143 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:47:58,144 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:47:58,144 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:47:58,144 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:47:58,157 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:47:58" (1/1) ... [2019-09-08 10:47:58,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:47:58" (1/1) ... [2019-09-08 10:47:58,168 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:47:58" (1/1) ... [2019-09-08 10:47:58,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:47:58" (1/1) ... [2019-09-08 10:47:58,182 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:47:58" (1/1) ... [2019-09-08 10:47:58,192 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:47:58" (1/1) ... [2019-09-08 10:47:58,195 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:47:58" (1/1) ... [2019-09-08 10:47:58,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:47:58,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:47:58,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:47:58,201 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:47:58,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:47:58" (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:47:58,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:47:58,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:47:58,265 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:47:58,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:47:58,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:47:58,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:47:58,268 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 10:47:58,268 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:47:58,268 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:47:58,268 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:47:58,268 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:47:58,269 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:47:58,269 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:47:58,269 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:47:58,270 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:47:58,270 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:47:58,273 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:47:58,273 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:47:58,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:47:58,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:47:58,897 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:47:58,897 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:47:58,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:47:58 BoogieIcfgContainer [2019-09-08 10:47:58,899 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:47:58,900 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:47:58,900 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:47:58,903 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:47:58,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:47:57" (1/3) ... [2019-09-08 10:47:58,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ce7c5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:47:58, skipping insertion in model container [2019-09-08 10:47:58,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:47:58" (2/3) ... [2019-09-08 10:47:58,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ce7c5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:47:58, skipping insertion in model container [2019-09-08 10:47:58,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:47:58" (3/3) ... [2019-09-08 10:47:58,907 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 10:47:58,917 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:47:58,926 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 10:47:58,946 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 10:47:58,981 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:47:58,982 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:47:58,982 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:47:58,982 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:47:58,983 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:47:58,984 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:47:58,984 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:47:58,984 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:47:58,984 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:47:59,030 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states. [2019-09-08 10:47:59,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-08 10:47:59,045 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:47:59,046 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] [2019-09-08 10:47:59,050 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:47:59,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:47:59,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1880463615, now seen corresponding path program 1 times [2019-09-08 10:47:59,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:47:59,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:47:59,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:59,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:47:59,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:47:59,584 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:47:59,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:47:59,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:47:59,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:47:59,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:47:59,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:47:59,609 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 3 states. [2019-09-08 10:47:59,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:47:59,705 INFO L93 Difference]: Finished difference Result 258 states and 408 transitions. [2019-09-08 10:47:59,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:47:59,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-09-08 10:47:59,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:47:59,720 INFO L225 Difference]: With dead ends: 258 [2019-09-08 10:47:59,720 INFO L226 Difference]: Without dead ends: 169 [2019-09-08 10:47:59,724 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:47:59,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-08 10:47:59,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2019-09-08 10:47:59,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-08 10:47:59,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 247 transitions. [2019-09-08 10:47:59,786 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 247 transitions. Word has length 52 [2019-09-08 10:47:59,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:47:59,787 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 247 transitions. [2019-09-08 10:47:59,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:47:59,787 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 247 transitions. [2019-09-08 10:47:59,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-08 10:47:59,790 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:47:59,790 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:47:59,791 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:47:59,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:47:59,791 INFO L82 PathProgramCache]: Analyzing trace with hash 246988582, now seen corresponding path program 1 times [2019-09-08 10:47:59,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:47:59,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:47:59,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:59,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:47:59,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:47:59,912 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:47:59,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:47:59,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:47:59,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:47:59,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:47:59,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:47:59,918 INFO L87 Difference]: Start difference. First operand 167 states and 247 transitions. Second operand 3 states. [2019-09-08 10:48:00,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:00,013 INFO L93 Difference]: Finished difference Result 407 states and 627 transitions. [2019-09-08 10:48:00,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:48:00,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-09-08 10:48:00,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:00,018 INFO L225 Difference]: With dead ends: 407 [2019-09-08 10:48:00,018 INFO L226 Difference]: Without dead ends: 271 [2019-09-08 10:48:00,020 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:48:00,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-09-08 10:48:00,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 269. [2019-09-08 10:48:00,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-08 10:48:00,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 408 transitions. [2019-09-08 10:48:00,055 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 408 transitions. Word has length 53 [2019-09-08 10:48:00,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:00,056 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 408 transitions. [2019-09-08 10:48:00,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:48:00,056 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 408 transitions. [2019-09-08 10:48:00,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-08 10:48:00,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:00,059 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:48:00,059 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:00,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:00,059 INFO L82 PathProgramCache]: Analyzing trace with hash 528190942, now seen corresponding path program 1 times [2019-09-08 10:48:00,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:00,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:00,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:00,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:00,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:00,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:00,173 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:48:00,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:00,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:48:00,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:48:00,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:48:00,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:48:00,176 INFO L87 Difference]: Start difference. First operand 269 states and 408 transitions. Second operand 3 states. [2019-09-08 10:48:00,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:00,263 INFO L93 Difference]: Finished difference Result 681 states and 1058 transitions. [2019-09-08 10:48:00,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:48:00,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-09-08 10:48:00,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:00,270 INFO L225 Difference]: With dead ends: 681 [2019-09-08 10:48:00,270 INFO L226 Difference]: Without dead ends: 443 [2019-09-08 10:48:00,276 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:48:00,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-09-08 10:48:00,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 441. [2019-09-08 10:48:00,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-09-08 10:48:00,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 676 transitions. [2019-09-08 10:48:00,333 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 676 transitions. Word has length 54 [2019-09-08 10:48:00,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:00,333 INFO L475 AbstractCegarLoop]: Abstraction has 441 states and 676 transitions. [2019-09-08 10:48:00,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:48:00,333 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 676 transitions. [2019-09-08 10:48:00,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 10:48:00,335 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:00,336 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:48:00,336 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:00,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:00,336 INFO L82 PathProgramCache]: Analyzing trace with hash -154098801, now seen corresponding path program 1 times [2019-09-08 10:48:00,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:00,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:00,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:00,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:00,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:00,484 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:48:00,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:00,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:48:00,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:48:00,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:48:00,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:48:00,487 INFO L87 Difference]: Start difference. First operand 441 states and 676 transitions. Second operand 6 states. [2019-09-08 10:48:00,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:00,741 INFO L93 Difference]: Finished difference Result 2491 states and 3901 transitions. [2019-09-08 10:48:00,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:48:00,742 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-09-08 10:48:00,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:00,755 INFO L225 Difference]: With dead ends: 2491 [2019-09-08 10:48:00,756 INFO L226 Difference]: Without dead ends: 2081 [2019-09-08 10:48:00,758 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:48:00,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2081 states. [2019-09-08 10:48:00,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2081 to 849. [2019-09-08 10:48:00,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2019-09-08 10:48:00,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1304 transitions. [2019-09-08 10:48:00,847 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1304 transitions. Word has length 55 [2019-09-08 10:48:00,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:00,848 INFO L475 AbstractCegarLoop]: Abstraction has 849 states and 1304 transitions. [2019-09-08 10:48:00,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:48:00,848 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1304 transitions. [2019-09-08 10:48:00,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 10:48:00,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:00,851 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:48:00,851 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:00,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:00,852 INFO L82 PathProgramCache]: Analyzing trace with hash -500628293, now seen corresponding path program 1 times [2019-09-08 10:48:00,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:00,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:00,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:00,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:00,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:00,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:01,034 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:48:01,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:01,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:48:01,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:48:01,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:48:01,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:48:01,036 INFO L87 Difference]: Start difference. First operand 849 states and 1304 transitions. Second operand 6 states. [2019-09-08 10:48:01,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:01,319 INFO L93 Difference]: Finished difference Result 3713 states and 5724 transitions. [2019-09-08 10:48:01,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:48:01,320 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-09-08 10:48:01,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:01,336 INFO L225 Difference]: With dead ends: 3713 [2019-09-08 10:48:01,337 INFO L226 Difference]: Without dead ends: 2895 [2019-09-08 10:48:01,340 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:48:01,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2019-09-08 10:48:01,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 2889. [2019-09-08 10:48:01,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2889 states. [2019-09-08 10:48:01,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 4432 transitions. [2019-09-08 10:48:01,588 INFO L78 Accepts]: Start accepts. Automaton has 2889 states and 4432 transitions. Word has length 56 [2019-09-08 10:48:01,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:01,588 INFO L475 AbstractCegarLoop]: Abstraction has 2889 states and 4432 transitions. [2019-09-08 10:48:01,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:48:01,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 4432 transitions. [2019-09-08 10:48:01,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 10:48:01,591 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:01,591 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:48:01,592 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:01,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:01,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1812681259, now seen corresponding path program 1 times [2019-09-08 10:48:01,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:01,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:01,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:01,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:01,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:01,653 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:48:01,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:01,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:48:01,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:48:01,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:48:01,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:48:01,656 INFO L87 Difference]: Start difference. First operand 2889 states and 4432 transitions. Second operand 3 states. [2019-09-08 10:48:01,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:01,995 INFO L93 Difference]: Finished difference Result 7773 states and 11890 transitions. [2019-09-08 10:48:01,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:48:01,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-09-08 10:48:02,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:02,028 INFO L225 Difference]: With dead ends: 7773 [2019-09-08 10:48:02,028 INFO L226 Difference]: Without dead ends: 4915 [2019-09-08 10:48:02,038 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:48:02,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4915 states. [2019-09-08 10:48:02,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4915 to 4913. [2019-09-08 10:48:02,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4913 states. [2019-09-08 10:48:02,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4913 states to 4913 states and 7424 transitions. [2019-09-08 10:48:02,388 INFO L78 Accepts]: Start accepts. Automaton has 4913 states and 7424 transitions. Word has length 58 [2019-09-08 10:48:02,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:02,388 INFO L475 AbstractCegarLoop]: Abstraction has 4913 states and 7424 transitions. [2019-09-08 10:48:02,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:48:02,388 INFO L276 IsEmpty]: Start isEmpty. Operand 4913 states and 7424 transitions. [2019-09-08 10:48:02,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 10:48:02,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:02,391 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:48:02,391 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:02,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:02,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1907951364, now seen corresponding path program 1 times [2019-09-08 10:48:02,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:02,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:02,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:02,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:02,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:02,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:02,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:48:02,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:02,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:48:02,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:48:02,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:48:02,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:48:02,510 INFO L87 Difference]: Start difference. First operand 4913 states and 7424 transitions. Second operand 6 states. [2019-09-08 10:48:03,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:03,883 INFO L93 Difference]: Finished difference Result 19223 states and 29027 transitions. [2019-09-08 10:48:03,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:48:03,884 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-09-08 10:48:03,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:03,989 INFO L225 Difference]: With dead ends: 19223 [2019-09-08 10:48:03,989 INFO L226 Difference]: Without dead ends: 14341 [2019-09-08 10:48:04,003 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:48:04,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14341 states. [2019-09-08 10:48:05,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14341 to 14337. [2019-09-08 10:48:05,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14337 states. [2019-09-08 10:48:05,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14337 states to 14337 states and 21536 transitions. [2019-09-08 10:48:05,092 INFO L78 Accepts]: Start accepts. Automaton has 14337 states and 21536 transitions. Word has length 58 [2019-09-08 10:48:05,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:05,093 INFO L475 AbstractCegarLoop]: Abstraction has 14337 states and 21536 transitions. [2019-09-08 10:48:05,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:48:05,093 INFO L276 IsEmpty]: Start isEmpty. Operand 14337 states and 21536 transitions. [2019-09-08 10:48:05,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 10:48:05,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:05,096 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:48:05,096 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:05,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:05,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1093539369, now seen corresponding path program 1 times [2019-09-08 10:48:05,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:05,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:05,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:05,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:05,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:05,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:05,212 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:48:05,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:05,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:48:05,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:48:05,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:48:05,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:48:05,214 INFO L87 Difference]: Start difference. First operand 14337 states and 21536 transitions. Second operand 5 states. [2019-09-08 10:48:07,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:07,033 INFO L93 Difference]: Finished difference Result 29411 states and 43809 transitions. [2019-09-08 10:48:07,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:48:07,034 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-09-08 10:48:07,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:07,115 INFO L225 Difference]: With dead ends: 29411 [2019-09-08 10:48:07,115 INFO L226 Difference]: Without dead ends: 29409 [2019-09-08 10:48:07,127 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:48:07,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29409 states. [2019-09-08 10:48:08,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29409 to 15105. [2019-09-08 10:48:08,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15105 states. [2019-09-08 10:48:08,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15105 states to 15105 states and 22304 transitions. [2019-09-08 10:48:08,992 INFO L78 Accepts]: Start accepts. Automaton has 15105 states and 22304 transitions. Word has length 58 [2019-09-08 10:48:08,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:08,993 INFO L475 AbstractCegarLoop]: Abstraction has 15105 states and 22304 transitions. [2019-09-08 10:48:08,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:48:08,993 INFO L276 IsEmpty]: Start isEmpty. Operand 15105 states and 22304 transitions. [2019-09-08 10:48:08,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:48:08,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:08,994 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:48:08,995 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:08,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:08,995 INFO L82 PathProgramCache]: Analyzing trace with hash -450398192, now seen corresponding path program 1 times [2019-09-08 10:48:08,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:08,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:08,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:08,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:08,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:09,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:09,069 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:48:09,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:09,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:48:09,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:48:09,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:48:09,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:48:09,071 INFO L87 Difference]: Start difference. First operand 15105 states and 22304 transitions. Second operand 3 states. [2019-09-08 10:48:10,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:10,298 INFO L93 Difference]: Finished difference Result 36731 states and 54204 transitions. [2019-09-08 10:48:10,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:48:10,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-09-08 10:48:10,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:10,351 INFO L225 Difference]: With dead ends: 36731 [2019-09-08 10:48:10,351 INFO L226 Difference]: Without dead ends: 21657 [2019-09-08 10:48:10,388 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:48:10,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21657 states. [2019-09-08 10:48:11,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21657 to 21487. [2019-09-08 10:48:11,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21487 states. [2019-09-08 10:48:11,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21487 states to 21487 states and 31426 transitions. [2019-09-08 10:48:11,649 INFO L78 Accepts]: Start accepts. Automaton has 21487 states and 31426 transitions. Word has length 59 [2019-09-08 10:48:11,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:11,650 INFO L475 AbstractCegarLoop]: Abstraction has 21487 states and 31426 transitions. [2019-09-08 10:48:11,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:48:11,650 INFO L276 IsEmpty]: Start isEmpty. Operand 21487 states and 31426 transitions. [2019-09-08 10:48:11,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 10:48:11,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:11,659 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:48:11,660 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:11,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:11,660 INFO L82 PathProgramCache]: Analyzing trace with hash 828250558, now seen corresponding path program 1 times [2019-09-08 10:48:11,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:11,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:11,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:11,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:11,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:11,780 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:48:11,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:48:11,781 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:48:11,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:12,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 10:48:12,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:48:12,173 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:48:12,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:48:12,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 10:48:12,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 10:48:12,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 10:48:12,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:48:12,189 INFO L87 Difference]: Start difference. First operand 21487 states and 31426 transitions. Second operand 11 states. [2019-09-08 10:48:17,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:17,281 INFO L93 Difference]: Finished difference Result 76785 states and 111966 transitions. [2019-09-08 10:48:17,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:48:17,283 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 81 [2019-09-08 10:48:17,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:17,459 INFO L225 Difference]: With dead ends: 76785 [2019-09-08 10:48:17,459 INFO L226 Difference]: Without dead ends: 60551 [2019-09-08 10:48:17,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 78 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:48:17,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60551 states. [2019-09-08 10:48:19,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60551 to 30351. [2019-09-08 10:48:19,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30351 states. [2019-09-08 10:48:19,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30351 states to 30351 states and 44146 transitions. [2019-09-08 10:48:19,894 INFO L78 Accepts]: Start accepts. Automaton has 30351 states and 44146 transitions. Word has length 81 [2019-09-08 10:48:19,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:19,894 INFO L475 AbstractCegarLoop]: Abstraction has 30351 states and 44146 transitions. [2019-09-08 10:48:19,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 10:48:19,895 INFO L276 IsEmpty]: Start isEmpty. Operand 30351 states and 44146 transitions. [2019-09-08 10:48:19,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 10:48:19,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:19,905 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:48:19,906 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:19,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:19,906 INFO L82 PathProgramCache]: Analyzing trace with hash -650200291, now seen corresponding path program 1 times [2019-09-08 10:48:19,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:19,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:19,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:19,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:19,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:19,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:19,972 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:48:19,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:19,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:48:19,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:48:19,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:48:19,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:48:19,974 INFO L87 Difference]: Start difference. First operand 30351 states and 44146 transitions. Second operand 3 states. [2019-09-08 10:48:23,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:23,031 INFO L93 Difference]: Finished difference Result 59973 states and 86994 transitions. [2019-09-08 10:48:23,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:48:23,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-08 10:48:23,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:23,158 INFO L225 Difference]: With dead ends: 59973 [2019-09-08 10:48:23,159 INFO L226 Difference]: Without dead ends: 42291 [2019-09-08 10:48:23,216 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:48:23,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42291 states. [2019-09-08 10:48:25,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42291 to 39453. [2019-09-08 10:48:25,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39453 states. [2019-09-08 10:48:25,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39453 states to 39453 states and 56692 transitions. [2019-09-08 10:48:25,627 INFO L78 Accepts]: Start accepts. Automaton has 39453 states and 56692 transitions. Word has length 81 [2019-09-08 10:48:25,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:25,627 INFO L475 AbstractCegarLoop]: Abstraction has 39453 states and 56692 transitions. [2019-09-08 10:48:25,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:48:25,627 INFO L276 IsEmpty]: Start isEmpty. Operand 39453 states and 56692 transitions. [2019-09-08 10:48:25,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 10:48:25,638 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:25,639 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:48:25,639 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:25,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:25,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1137036122, now seen corresponding path program 1 times [2019-09-08 10:48:25,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:25,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:25,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:25,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:25,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:25,693 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:48:25,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:25,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:48:25,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:48:25,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:48:25,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:48:25,694 INFO L87 Difference]: Start difference. First operand 39453 states and 56692 transitions. Second operand 3 states. [2019-09-08 10:48:28,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:28,051 INFO L93 Difference]: Finished difference Result 62787 states and 89761 transitions. [2019-09-08 10:48:28,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:48:28,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-08 10:48:28,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:28,124 INFO L225 Difference]: With dead ends: 62787 [2019-09-08 10:48:28,124 INFO L226 Difference]: Without dead ends: 41783 [2019-09-08 10:48:28,161 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:48:28,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41783 states. [2019-09-08 10:48:31,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41783 to 39789. [2019-09-08 10:48:31,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39789 states. [2019-09-08 10:48:31,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39789 states to 39789 states and 56328 transitions. [2019-09-08 10:48:31,638 INFO L78 Accepts]: Start accepts. Automaton has 39789 states and 56328 transitions. Word has length 81 [2019-09-08 10:48:31,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:31,640 INFO L475 AbstractCegarLoop]: Abstraction has 39789 states and 56328 transitions. [2019-09-08 10:48:31,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:48:31,641 INFO L276 IsEmpty]: Start isEmpty. Operand 39789 states and 56328 transitions. [2019-09-08 10:48:31,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 10:48:31,649 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:31,650 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:48:31,650 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:31,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:31,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1612642453, now seen corresponding path program 1 times [2019-09-08 10:48:31,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:31,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:31,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:31,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:31,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:31,742 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 10:48:31,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:31,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:48:31,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:48:31,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:48:31,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:48:31,744 INFO L87 Difference]: Start difference. First operand 39789 states and 56328 transitions. Second operand 6 states. [2019-09-08 10:48:37,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:37,671 INFO L93 Difference]: Finished difference Result 140005 states and 197676 transitions. [2019-09-08 10:48:37,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:48:37,672 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-09-08 10:48:37,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:37,831 INFO L225 Difference]: With dead ends: 140005 [2019-09-08 10:48:37,832 INFO L226 Difference]: Without dead ends: 100339 [2019-09-08 10:48:37,898 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:48:37,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100339 states. [2019-09-08 10:48:44,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100339 to 97996. [2019-09-08 10:48:44,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97996 states. [2019-09-08 10:48:45,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97996 states to 97996 states and 138034 transitions. [2019-09-08 10:48:45,011 INFO L78 Accepts]: Start accepts. Automaton has 97996 states and 138034 transitions. Word has length 81 [2019-09-08 10:48:45,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:45,011 INFO L475 AbstractCegarLoop]: Abstraction has 97996 states and 138034 transitions. [2019-09-08 10:48:45,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:48:45,011 INFO L276 IsEmpty]: Start isEmpty. Operand 97996 states and 138034 transitions. [2019-09-08 10:48:45,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 10:48:45,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:45,020 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:48:45,020 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:45,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:45,021 INFO L82 PathProgramCache]: Analyzing trace with hash -93684634, now seen corresponding path program 1 times [2019-09-08 10:48:45,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:45,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:45,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:45,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:45,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:45,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:45,115 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:48:45,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:48:45,115 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 10:48:45,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:45,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 10:48:45,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:48:45,336 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:48:45,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:48:45,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 10:48:45,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 10:48:45,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 10:48:45,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:48:45,354 INFO L87 Difference]: Start difference. First operand 97996 states and 138034 transitions. Second operand 11 states. [2019-09-08 10:48:58,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:58,439 INFO L93 Difference]: Finished difference Result 217669 states and 304584 transitions. [2019-09-08 10:48:58,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:48:58,440 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 81 [2019-09-08 10:48:58,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:58,709 INFO L225 Difference]: With dead ends: 217669 [2019-09-08 10:48:58,709 INFO L226 Difference]: Without dead ends: 183459 [2019-09-08 10:48:58,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 78 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:48:58,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183459 states. [2019-09-08 10:49:09,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183459 to 105740. [2019-09-08 10:49:09,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105740 states. [2019-09-08 10:49:09,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105740 states to 105740 states and 148653 transitions. [2019-09-08 10:49:09,961 INFO L78 Accepts]: Start accepts. Automaton has 105740 states and 148653 transitions. Word has length 81 [2019-09-08 10:49:09,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:49:09,961 INFO L475 AbstractCegarLoop]: Abstraction has 105740 states and 148653 transitions. [2019-09-08 10:49:09,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 10:49:09,961 INFO L276 IsEmpty]: Start isEmpty. Operand 105740 states and 148653 transitions. [2019-09-08 10:49:09,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 10:49:09,971 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:49:09,971 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:49:09,971 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:49:09,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:49:09,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1777556711, now seen corresponding path program 1 times [2019-09-08 10:49:09,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:49:09,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:49:09,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:09,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:49:09,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:49:10,077 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:49:10,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:49:10,078 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 10:49:10,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:49:10,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:49:10,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 10:49:10,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:49:10,268 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:49:10,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:49:10,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 10:49:10,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 10:49:10,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 10:49:10,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:49:10,285 INFO L87 Difference]: Start difference. First operand 105740 states and 148653 transitions. Second operand 11 states. [2019-09-08 10:49:32,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:49:32,389 INFO L93 Difference]: Finished difference Result 312732 states and 437856 transitions. [2019-09-08 10:49:32,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:49:32,390 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 81 [2019-09-08 10:49:32,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:49:32,750 INFO L225 Difference]: With dead ends: 312732 [2019-09-08 10:49:32,750 INFO L226 Difference]: Without dead ends: 245763 [2019-09-08 10:49:32,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 78 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:49:33,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245763 states. [2019-09-08 10:49:42,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245763 to 121544. [2019-09-08 10:49:42,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121544 states. [2019-09-08 10:49:42,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121544 states to 121544 states and 170982 transitions. [2019-09-08 10:49:42,504 INFO L78 Accepts]: Start accepts. Automaton has 121544 states and 170982 transitions. Word has length 81 [2019-09-08 10:49:42,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:49:42,504 INFO L475 AbstractCegarLoop]: Abstraction has 121544 states and 170982 transitions. [2019-09-08 10:49:42,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 10:49:42,505 INFO L276 IsEmpty]: Start isEmpty. Operand 121544 states and 170982 transitions. [2019-09-08 10:49:42,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 10:49:42,514 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:49:42,514 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] [2019-09-08 10:49:42,514 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:49:42,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:49:42,515 INFO L82 PathProgramCache]: Analyzing trace with hash -345481104, now seen corresponding path program 1 times [2019-09-08 10:49:42,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:49:42,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:49:42,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:42,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:49:42,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:49:42,565 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:49:42,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:49:42,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:49:42,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:49:42,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:49:42,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:49:42,566 INFO L87 Difference]: Start difference. First operand 121544 states and 170982 transitions. Second operand 3 states. [2019-09-08 10:49:56,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:49:56,865 INFO L93 Difference]: Finished difference Result 252908 states and 355239 transitions. [2019-09-08 10:49:56,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:49:56,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-08 10:49:56,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:49:57,085 INFO L225 Difference]: With dead ends: 252908 [2019-09-08 10:49:57,085 INFO L226 Difference]: Without dead ends: 144843 [2019-09-08 10:49:57,164 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:49:57,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144843 states. [2019-09-08 10:50:08,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144843 to 144764. [2019-09-08 10:50:08,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144764 states. [2019-09-08 10:50:08,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144764 states to 144764 states and 200764 transitions. [2019-09-08 10:50:08,267 INFO L78 Accepts]: Start accepts. Automaton has 144764 states and 200764 transitions. Word has length 82 [2019-09-08 10:50:08,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:50:08,268 INFO L475 AbstractCegarLoop]: Abstraction has 144764 states and 200764 transitions. [2019-09-08 10:50:08,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:50:08,268 INFO L276 IsEmpty]: Start isEmpty. Operand 144764 states and 200764 transitions. [2019-09-08 10:50:08,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 10:50:08,279 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:50:08,279 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] [2019-09-08 10:50:08,280 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:50:08,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:50:08,280 INFO L82 PathProgramCache]: Analyzing trace with hash 274588477, now seen corresponding path program 1 times [2019-09-08 10:50:08,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:50:08,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:50:08,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:08,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:50:08,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:08,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:50:08,490 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:50:08,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:50:08,490 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:50:08,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:50:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:50:08,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 10:50:08,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:50:08,757 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:50:08,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:50:08,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4] total 12 [2019-09-08 10:50:08,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 10:50:08,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 10:50:08,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-09-08 10:50:08,775 INFO L87 Difference]: Start difference. First operand 144764 states and 200764 transitions. Second operand 12 states. [2019-09-08 10:52:57,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:52:57,455 INFO L93 Difference]: Finished difference Result 1644248 states and 2263592 transitions. [2019-09-08 10:52:57,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-09-08 10:52:57,455 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 82 [2019-09-08 10:52:57,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:53:00,131 INFO L225 Difference]: With dead ends: 1644248 [2019-09-08 10:53:00,132 INFO L226 Difference]: Without dead ends: 1501731 [2019-09-08 10:53:00,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7708 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=2636, Invalid=15186, Unknown=0, NotChecked=0, Total=17822 [2019-09-08 10:53:02,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501731 states. [2019-09-08 10:54:34,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501731 to 607774. [2019-09-08 10:54:34,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607774 states. [2019-09-08 10:54:35,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607774 states to 607774 states and 835047 transitions. [2019-09-08 10:54:35,344 INFO L78 Accepts]: Start accepts. Automaton has 607774 states and 835047 transitions. Word has length 82 [2019-09-08 10:54:35,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:54:35,345 INFO L475 AbstractCegarLoop]: Abstraction has 607774 states and 835047 transitions. [2019-09-08 10:54:35,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 10:54:35,345 INFO L276 IsEmpty]: Start isEmpty. Operand 607774 states and 835047 transitions. [2019-09-08 10:54:35,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 10:54:35,359 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:54:35,359 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:54:35,359 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:54:35,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:54:35,360 INFO L82 PathProgramCache]: Analyzing trace with hash -259102357, now seen corresponding path program 1 times [2019-09-08 10:54:35,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:54:35,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:54:35,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:35,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:54:35,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:54:36,660 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 10:54:36,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:54:36,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:54:36,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:54:36,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:54:36,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:54:36,662 INFO L87 Difference]: Start difference. First operand 607774 states and 835047 transitions. Second operand 6 states. [2019-09-08 10:56:36,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:56:36,629 INFO L93 Difference]: Finished difference Result 1272552 states and 1764063 transitions. [2019-09-08 10:56:36,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:56:36,629 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-09-08 10:56:36,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:56:38,422 INFO L225 Difference]: With dead ends: 1272552 [2019-09-08 10:56:38,422 INFO L226 Difference]: Without dead ends: 1016980 [2019-09-08 10:56:38,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:56:39,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016980 states. [2019-09-08 10:58:45,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016980 to 810266. [2019-09-08 10:58:45,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810266 states. [2019-09-08 10:58:47,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810266 states to 810266 states and 1111165 transitions. [2019-09-08 10:58:47,210 INFO L78 Accepts]: Start accepts. Automaton has 810266 states and 1111165 transitions. Word has length 83 [2019-09-08 10:58:47,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:58:47,210 INFO L475 AbstractCegarLoop]: Abstraction has 810266 states and 1111165 transitions. [2019-09-08 10:58:47,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:58:47,211 INFO L276 IsEmpty]: Start isEmpty. Operand 810266 states and 1111165 transitions. [2019-09-08 10:58:47,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 10:58:47,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:58:47,224 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:58:47,225 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:58:47,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:58:47,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1723275991, now seen corresponding path program 1 times [2019-09-08 10:58:47,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:58:47,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:58:47,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:58:47,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:58:47,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:58:47,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:58:47,273 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:58:47,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:58:47,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:58:47,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:58:47,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:58:47,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:58:47,275 INFO L87 Difference]: Start difference. First operand 810266 states and 1111165 transitions. Second operand 3 states.