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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:24:24,622 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:24:24,625 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:24:24,637 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:24:24,638 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:24:24,639 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:24:24,640 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:24:24,642 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:24:24,644 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:24:24,645 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:24:24,646 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:24:24,647 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:24:24,647 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:24:24,648 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:24:24,649 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:24:24,650 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:24:24,651 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:24:24,652 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:24:24,654 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:24:24,656 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:24:24,658 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:24:24,659 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:24:24,660 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:24:24,661 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:24:24,663 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:24:24,663 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:24:24,664 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:24:24,665 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:24:24,665 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:24:24,666 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:24:24,666 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:24:24,667 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:24:24,668 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:24:24,669 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:24:24,670 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:24:24,670 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:24:24,671 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:24:24,671 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:24:24,671 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:24:24,672 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:24:24,673 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:24:24,674 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-10-13 21:24:24,688 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:24:24,688 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:24:24,692 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:24:24,692 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:24:24,692 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:24:24,693 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:24:24,693 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:24:24,693 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:24:24,693 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:24:24,694 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:24:24,694 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:24:24,694 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:24:24,694 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:24:24,694 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:24:24,695 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:24:24,695 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:24:24,695 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:24:24,696 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:24:24,697 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:24:24,697 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:24:24,697 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:24:24,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:24:24,697 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:24:24,698 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:24:24,698 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:24:24,699 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:24:24,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:24:24,699 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:24:24,699 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 21:24:24,991 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:24:25,005 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:24:25,009 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:24:25,010 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:24:25,011 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:24:25,012 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-10-13 21:24:25,081 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d5255697/357a2d4729c94477a2843415203a86c6/FLAGe5e8e190a [2019-10-13 21:24:25,573 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:24:25,574 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-10-13 21:24:25,586 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d5255697/357a2d4729c94477a2843415203a86c6/FLAGe5e8e190a [2019-10-13 21:24:25,936 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d5255697/357a2d4729c94477a2843415203a86c6 [2019-10-13 21:24:25,946 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:24:25,948 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:24:25,949 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:24:25,949 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:24:25,953 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:24:25,954 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:24:25" (1/1) ... [2019-10-13 21:24:25,958 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4795ead6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:25, skipping insertion in model container [2019-10-13 21:24:25,958 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:24:25" (1/1) ... [2019-10-13 21:24:25,967 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:24:26,028 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:24:26,359 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:24:26,384 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:24:26,604 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:24:26,628 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:24:26,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:26 WrapperNode [2019-10-13 21:24:26,628 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:24:26,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:24:26,629 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:24:26,630 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:24:26,642 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:26" (1/1) ... [2019-10-13 21:24:26,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:26" (1/1) ... [2019-10-13 21:24:26,653 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:26" (1/1) ... [2019-10-13 21:24:26,654 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:26" (1/1) ... [2019-10-13 21:24:26,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:26" (1/1) ... [2019-10-13 21:24:26,682 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:26" (1/1) ... [2019-10-13 21:24:26,686 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:26" (1/1) ... [2019-10-13 21:24:26,691 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:24:26,691 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:24:26,692 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:24:26,692 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:24:26,693 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:26" (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-10-13 21:24:26,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:24:26,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:24:26,760 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:24:26,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:24:26,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 21:24:26,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-13 21:24:26,761 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 21:24:26,761 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 21:24:26,761 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:24:26,761 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 21:24:26,761 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 21:24:26,762 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 21:24:26,762 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 21:24:26,762 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 21:24:26,762 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 21:24:26,762 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 21:24:26,762 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:24:26,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:24:26,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:24:27,583 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:24:27,584 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 21:24:27,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:24:27 BoogieIcfgContainer [2019-10-13 21:24:27,586 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:24:27,587 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:24:27,587 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:24:27,590 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:24:27,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:24:25" (1/3) ... [2019-10-13 21:24:27,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676f8323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:24:27, skipping insertion in model container [2019-10-13 21:24:27,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:26" (2/3) ... [2019-10-13 21:24:27,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676f8323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:24:27, skipping insertion in model container [2019-10-13 21:24:27,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:24:27" (3/3) ... [2019-10-13 21:24:27,599 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-10-13 21:24:27,607 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:24:27,615 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:24:27,627 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:24:27,651 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:24:27,651 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:24:27,651 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:24:27,651 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:24:27,652 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:24:27,652 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:24:27,652 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:24:27,652 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:24:27,673 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2019-10-13 21:24:27,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 21:24:27,684 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:27,685 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:27,687 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:27,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:27,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1085569870, now seen corresponding path program 1 times [2019-10-13 21:24:27,700 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:27,701 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062050547] [2019-10-13 21:24:27,701 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:27,701 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:27,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:27,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:28,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:28,132 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062050547] [2019-10-13 21:24:28,133 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:28,133 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:28,134 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144628976] [2019-10-13 21:24:28,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:28,140 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:28,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:28,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:28,159 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 3 states. [2019-10-13 21:24:28,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:28,324 INFO L93 Difference]: Finished difference Result 342 states and 566 transitions. [2019-10-13 21:24:28,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:28,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-13 21:24:28,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:28,343 INFO L225 Difference]: With dead ends: 342 [2019-10-13 21:24:28,343 INFO L226 Difference]: Without dead ends: 235 [2019-10-13 21:24:28,347 INFO L600 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-10-13 21:24:28,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-10-13 21:24:28,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2019-10-13 21:24:28,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-13 21:24:28,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 363 transitions. [2019-10-13 21:24:28,419 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 363 transitions. Word has length 60 [2019-10-13 21:24:28,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:28,419 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 363 transitions. [2019-10-13 21:24:28,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:28,420 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 363 transitions. [2019-10-13 21:24:28,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-13 21:24:28,426 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:28,427 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:28,427 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:28,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:28,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1093309265, now seen corresponding path program 1 times [2019-10-13 21:24:28,429 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:28,430 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242983842] [2019-10-13 21:24:28,430 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:28,431 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:28,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:28,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:28,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242983842] [2019-10-13 21:24:28,607 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:28,608 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:28,608 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326742054] [2019-10-13 21:24:28,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:28,611 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:28,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:28,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:28,612 INFO L87 Difference]: Start difference. First operand 232 states and 363 transitions. Second operand 3 states. [2019-10-13 21:24:28,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:28,692 INFO L93 Difference]: Finished difference Result 570 states and 915 transitions. [2019-10-13 21:24:28,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:28,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-10-13 21:24:28,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:28,697 INFO L225 Difference]: With dead ends: 570 [2019-10-13 21:24:28,697 INFO L226 Difference]: Without dead ends: 393 [2019-10-13 21:24:28,700 INFO L600 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-10-13 21:24:28,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-10-13 21:24:28,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 389. [2019-10-13 21:24:28,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-10-13 21:24:28,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 618 transitions. [2019-10-13 21:24:28,747 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 618 transitions. Word has length 62 [2019-10-13 21:24:28,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:28,748 INFO L462 AbstractCegarLoop]: Abstraction has 389 states and 618 transitions. [2019-10-13 21:24:28,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:28,748 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 618 transitions. [2019-10-13 21:24:28,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-13 21:24:28,755 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:28,755 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:28,755 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:28,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:28,756 INFO L82 PathProgramCache]: Analyzing trace with hash 647852560, now seen corresponding path program 1 times [2019-10-13 21:24:28,756 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:28,758 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497793473] [2019-10-13 21:24:28,758 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:28,759 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:28,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:28,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:28,941 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497793473] [2019-10-13 21:24:28,942 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:28,944 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:28,945 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055716109] [2019-10-13 21:24:28,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:28,945 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:28,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:28,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:28,947 INFO L87 Difference]: Start difference. First operand 389 states and 618 transitions. Second operand 3 states. [2019-10-13 21:24:29,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:29,046 INFO L93 Difference]: Finished difference Result 1025 states and 1652 transitions. [2019-10-13 21:24:29,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:29,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-10-13 21:24:29,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:29,051 INFO L225 Difference]: With dead ends: 1025 [2019-10-13 21:24:29,052 INFO L226 Difference]: Without dead ends: 691 [2019-10-13 21:24:29,054 INFO L600 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-10-13 21:24:29,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2019-10-13 21:24:29,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 685. [2019-10-13 21:24:29,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2019-10-13 21:24:29,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1094 transitions. [2019-10-13 21:24:29,109 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1094 transitions. Word has length 64 [2019-10-13 21:24:29,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:29,109 INFO L462 AbstractCegarLoop]: Abstraction has 685 states and 1094 transitions. [2019-10-13 21:24:29,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:29,110 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1094 transitions. [2019-10-13 21:24:29,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-13 21:24:29,114 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:29,114 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:29,114 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:29,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:29,115 INFO L82 PathProgramCache]: Analyzing trace with hash -971934415, now seen corresponding path program 1 times [2019-10-13 21:24:29,115 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:29,115 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437198513] [2019-10-13 21:24:29,116 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:29,116 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:29,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:29,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:29,299 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437198513] [2019-10-13 21:24:29,299 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:29,299 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:24:29,299 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680437875] [2019-10-13 21:24:29,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:24:29,300 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:29,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:24:29,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:29,301 INFO L87 Difference]: Start difference. First operand 685 states and 1094 transitions. Second operand 5 states. [2019-10-13 21:24:29,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:29,517 INFO L93 Difference]: Finished difference Result 2313 states and 3756 transitions. [2019-10-13 21:24:29,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:29,518 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-10-13 21:24:29,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:29,528 INFO L225 Difference]: With dead ends: 2313 [2019-10-13 21:24:29,528 INFO L226 Difference]: Without dead ends: 1683 [2019-10-13 21:24:29,531 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:29,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2019-10-13 21:24:29,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1500. [2019-10-13 21:24:29,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1500 states. [2019-10-13 21:24:29,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 2423 transitions. [2019-10-13 21:24:29,625 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 2423 transitions. Word has length 66 [2019-10-13 21:24:29,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:29,626 INFO L462 AbstractCegarLoop]: Abstraction has 1500 states and 2423 transitions. [2019-10-13 21:24:29,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:24:29,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 2423 transitions. [2019-10-13 21:24:29,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-13 21:24:29,629 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:29,629 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:29,630 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:29,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:29,630 INFO L82 PathProgramCache]: Analyzing trace with hash -126806256, now seen corresponding path program 1 times [2019-10-13 21:24:29,630 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:29,631 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703941258] [2019-10-13 21:24:29,631 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:29,631 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:29,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:29,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:29,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:29,751 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703941258] [2019-10-13 21:24:29,751 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:29,751 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:24:29,751 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20063643] [2019-10-13 21:24:29,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:24:29,753 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:29,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:24:29,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:24:29,754 INFO L87 Difference]: Start difference. First operand 1500 states and 2423 transitions. Second operand 6 states. [2019-10-13 21:24:30,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:30,183 INFO L93 Difference]: Finished difference Result 5957 states and 9657 transitions. [2019-10-13 21:24:30,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:24:30,183 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-10-13 21:24:30,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:30,212 INFO L225 Difference]: With dead ends: 5957 [2019-10-13 21:24:30,212 INFO L226 Difference]: Without dead ends: 4512 [2019-10-13 21:24:30,218 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:24:30,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4512 states. [2019-10-13 21:24:30,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4512 to 4409. [2019-10-13 21:24:30,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4409 states. [2019-10-13 21:24:30,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4409 states to 4409 states and 7126 transitions. [2019-10-13 21:24:30,469 INFO L78 Accepts]: Start accepts. Automaton has 4409 states and 7126 transitions. Word has length 67 [2019-10-13 21:24:30,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:30,471 INFO L462 AbstractCegarLoop]: Abstraction has 4409 states and 7126 transitions. [2019-10-13 21:24:30,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:24:30,471 INFO L276 IsEmpty]: Start isEmpty. Operand 4409 states and 7126 transitions. [2019-10-13 21:24:30,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-13 21:24:30,473 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:30,473 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:30,474 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:30,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:30,474 INFO L82 PathProgramCache]: Analyzing trace with hash 306920920, now seen corresponding path program 1 times [2019-10-13 21:24:30,474 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:30,475 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235934577] [2019-10-13 21:24:30,475 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:30,475 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:30,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:30,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:30,638 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235934577] [2019-10-13 21:24:30,640 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:30,640 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:30,641 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861105077] [2019-10-13 21:24:30,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:30,642 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:30,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:30,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:30,642 INFO L87 Difference]: Start difference. First operand 4409 states and 7126 transitions. Second operand 4 states. [2019-10-13 21:24:31,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:31,012 INFO L93 Difference]: Finished difference Result 10298 states and 16697 transitions. [2019-10-13 21:24:31,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:31,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-10-13 21:24:31,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:31,059 INFO L225 Difference]: With dead ends: 10298 [2019-10-13 21:24:31,060 INFO L226 Difference]: Without dead ends: 6343 [2019-10-13 21:24:31,073 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:31,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6343 states. [2019-10-13 21:24:31,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6343 to 6316. [2019-10-13 21:24:31,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6316 states. [2019-10-13 21:24:31,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6316 states to 6316 states and 10205 transitions. [2019-10-13 21:24:31,531 INFO L78 Accepts]: Start accepts. Automaton has 6316 states and 10205 transitions. Word has length 68 [2019-10-13 21:24:31,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:31,532 INFO L462 AbstractCegarLoop]: Abstraction has 6316 states and 10205 transitions. [2019-10-13 21:24:31,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:31,532 INFO L276 IsEmpty]: Start isEmpty. Operand 6316 states and 10205 transitions. [2019-10-13 21:24:31,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-13 21:24:31,534 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:31,535 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:31,535 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:31,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:31,536 INFO L82 PathProgramCache]: Analyzing trace with hash 872119511, now seen corresponding path program 1 times [2019-10-13 21:24:31,536 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:31,536 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992974028] [2019-10-13 21:24:31,537 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:31,537 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:31,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:31,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:31,627 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992974028] [2019-10-13 21:24:31,628 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:31,628 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:31,628 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846267411] [2019-10-13 21:24:31,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:31,629 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:31,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:31,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:31,629 INFO L87 Difference]: Start difference. First operand 6316 states and 10205 transitions. Second operand 4 states. [2019-10-13 21:24:32,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:32,176 INFO L93 Difference]: Finished difference Result 18451 states and 29920 transitions. [2019-10-13 21:24:32,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:32,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-10-13 21:24:32,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:32,244 INFO L225 Difference]: With dead ends: 18451 [2019-10-13 21:24:32,245 INFO L226 Difference]: Without dead ends: 12686 [2019-10-13 21:24:32,260 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:32,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12686 states. [2019-10-13 21:24:32,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12686 to 8636. [2019-10-13 21:24:32,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8636 states. [2019-10-13 21:24:32,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8636 states to 8636 states and 13951 transitions. [2019-10-13 21:24:32,873 INFO L78 Accepts]: Start accepts. Automaton has 8636 states and 13951 transitions. Word has length 69 [2019-10-13 21:24:32,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:32,873 INFO L462 AbstractCegarLoop]: Abstraction has 8636 states and 13951 transitions. [2019-10-13 21:24:32,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:32,873 INFO L276 IsEmpty]: Start isEmpty. Operand 8636 states and 13951 transitions. [2019-10-13 21:24:32,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-13 21:24:32,876 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:32,876 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:32,876 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:32,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:32,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1806428220, now seen corresponding path program 1 times [2019-10-13 21:24:32,877 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:32,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689815143] [2019-10-13 21:24:32,878 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:32,878 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:32,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:32,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:32,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689815143] [2019-10-13 21:24:32,937 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:32,937 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:32,937 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117649685] [2019-10-13 21:24:32,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:32,938 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:32,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:32,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:32,938 INFO L87 Difference]: Start difference. First operand 8636 states and 13951 transitions. Second operand 3 states. [2019-10-13 21:24:33,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:33,470 INFO L93 Difference]: Finished difference Result 19227 states and 31095 transitions. [2019-10-13 21:24:33,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:33,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-10-13 21:24:33,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:33,506 INFO L225 Difference]: With dead ends: 19227 [2019-10-13 21:24:33,507 INFO L226 Difference]: Without dead ends: 12825 [2019-10-13 21:24:33,523 INFO L600 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-10-13 21:24:33,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12825 states. [2019-10-13 21:24:34,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12825 to 12823. [2019-10-13 21:24:34,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12823 states. [2019-10-13 21:24:34,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12823 states to 12823 states and 20604 transitions. [2019-10-13 21:24:34,177 INFO L78 Accepts]: Start accepts. Automaton has 12823 states and 20604 transitions. Word has length 70 [2019-10-13 21:24:34,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:34,178 INFO L462 AbstractCegarLoop]: Abstraction has 12823 states and 20604 transitions. [2019-10-13 21:24:34,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:34,178 INFO L276 IsEmpty]: Start isEmpty. Operand 12823 states and 20604 transitions. [2019-10-13 21:24:34,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-13 21:24:34,179 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:34,180 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:34,180 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:34,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:34,180 INFO L82 PathProgramCache]: Analyzing trace with hash -552777714, now seen corresponding path program 1 times [2019-10-13 21:24:34,181 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:34,181 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891726847] [2019-10-13 21:24:34,181 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:34,181 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:34,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:34,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:34,259 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891726847] [2019-10-13 21:24:34,260 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:34,260 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:34,261 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680110923] [2019-10-13 21:24:34,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:34,261 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:34,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:34,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:34,262 INFO L87 Difference]: Start difference. First operand 12823 states and 20604 transitions. Second operand 3 states. [2019-10-13 21:24:35,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:35,280 INFO L93 Difference]: Finished difference Result 27737 states and 44670 transitions. [2019-10-13 21:24:35,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:35,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-10-13 21:24:35,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:35,329 INFO L225 Difference]: With dead ends: 27737 [2019-10-13 21:24:35,329 INFO L226 Difference]: Without dead ends: 18500 [2019-10-13 21:24:35,352 INFO L600 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-10-13 21:24:35,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18500 states. [2019-10-13 21:24:36,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18500 to 18498. [2019-10-13 21:24:36,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18498 states. [2019-10-13 21:24:36,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18498 states to 18498 states and 29596 transitions. [2019-10-13 21:24:36,117 INFO L78 Accepts]: Start accepts. Automaton has 18498 states and 29596 transitions. Word has length 70 [2019-10-13 21:24:36,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:36,117 INFO L462 AbstractCegarLoop]: Abstraction has 18498 states and 29596 transitions. [2019-10-13 21:24:36,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:36,117 INFO L276 IsEmpty]: Start isEmpty. Operand 18498 states and 29596 transitions. [2019-10-13 21:24:36,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-13 21:24:36,118 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:36,119 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:36,119 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:36,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:36,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1170468960, now seen corresponding path program 1 times [2019-10-13 21:24:36,120 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:36,120 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135974397] [2019-10-13 21:24:36,120 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:36,120 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:36,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:36,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:36,180 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135974397] [2019-10-13 21:24:36,180 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:36,181 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:36,181 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241025437] [2019-10-13 21:24:36,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:36,182 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:36,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:36,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:36,182 INFO L87 Difference]: Start difference. First operand 18498 states and 29596 transitions. Second operand 3 states. [2019-10-13 21:24:36,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:36,906 INFO L93 Difference]: Finished difference Result 42427 states and 68162 transitions. [2019-10-13 21:24:36,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:36,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-10-13 21:24:36,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:36,984 INFO L225 Difference]: With dead ends: 42427 [2019-10-13 21:24:36,984 INFO L226 Difference]: Without dead ends: 27744 [2019-10-13 21:24:37,021 INFO L600 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-10-13 21:24:37,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27744 states. [2019-10-13 21:24:38,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27744 to 27742. [2019-10-13 21:24:38,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27742 states. [2019-10-13 21:24:38,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27742 states to 27742 states and 44151 transitions. [2019-10-13 21:24:38,120 INFO L78 Accepts]: Start accepts. Automaton has 27742 states and 44151 transitions. Word has length 70 [2019-10-13 21:24:38,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:38,120 INFO L462 AbstractCegarLoop]: Abstraction has 27742 states and 44151 transitions. [2019-10-13 21:24:38,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:38,120 INFO L276 IsEmpty]: Start isEmpty. Operand 27742 states and 44151 transitions. [2019-10-13 21:24:38,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-13 21:24:38,121 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:38,121 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:38,121 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:38,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:38,122 INFO L82 PathProgramCache]: Analyzing trace with hash -901408249, now seen corresponding path program 1 times [2019-10-13 21:24:38,122 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:38,122 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160952313] [2019-10-13 21:24:38,123 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:38,123 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:38,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:38,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:38,263 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160952313] [2019-10-13 21:24:38,264 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:38,264 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:24:38,264 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977513065] [2019-10-13 21:24:38,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:24:38,264 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:38,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:24:38,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:38,265 INFO L87 Difference]: Start difference. First operand 27742 states and 44151 transitions. Second operand 5 states. [2019-10-13 21:24:39,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:39,830 INFO L93 Difference]: Finished difference Result 57487 states and 91562 transitions. [2019-10-13 21:24:39,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:39,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-10-13 21:24:39,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:39,890 INFO L225 Difference]: With dead ends: 57487 [2019-10-13 21:24:39,890 INFO L226 Difference]: Without dead ends: 29834 [2019-10-13 21:24:39,943 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:39,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29834 states. [2019-10-13 21:24:40,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29834 to 27742. [2019-10-13 21:24:40,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27742 states. [2019-10-13 21:24:40,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27742 states to 27742 states and 44016 transitions. [2019-10-13 21:24:40,960 INFO L78 Accepts]: Start accepts. Automaton has 27742 states and 44016 transitions. Word has length 71 [2019-10-13 21:24:40,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:40,961 INFO L462 AbstractCegarLoop]: Abstraction has 27742 states and 44016 transitions. [2019-10-13 21:24:40,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:24:40,961 INFO L276 IsEmpty]: Start isEmpty. Operand 27742 states and 44016 transitions. [2019-10-13 21:24:40,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-13 21:24:40,961 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:40,961 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:40,962 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:40,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:40,962 INFO L82 PathProgramCache]: Analyzing trace with hash 527849417, now seen corresponding path program 1 times [2019-10-13 21:24:40,962 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:40,962 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832661358] [2019-10-13 21:24:40,962 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:40,962 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:40,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:41,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:41,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832661358] [2019-10-13 21:24:41,141 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:41,141 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:24:41,141 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590212398] [2019-10-13 21:24:41,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:24:41,142 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:41,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:24:41,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:41,143 INFO L87 Difference]: Start difference. First operand 27742 states and 44016 transitions. Second operand 5 states. [2019-10-13 21:24:43,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:43,474 INFO L93 Difference]: Finished difference Result 89911 states and 143015 transitions. [2019-10-13 21:24:43,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:43,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-10-13 21:24:43,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:43,594 INFO L225 Difference]: With dead ends: 89911 [2019-10-13 21:24:43,594 INFO L226 Difference]: Without dead ends: 62258 [2019-10-13 21:24:43,639 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:43,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62258 states. [2019-10-13 21:24:46,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62258 to 38998. [2019-10-13 21:24:46,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38998 states. [2019-10-13 21:24:46,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38998 states to 38998 states and 61670 transitions. [2019-10-13 21:24:46,174 INFO L78 Accepts]: Start accepts. Automaton has 38998 states and 61670 transitions. Word has length 74 [2019-10-13 21:24:46,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:46,174 INFO L462 AbstractCegarLoop]: Abstraction has 38998 states and 61670 transitions. [2019-10-13 21:24:46,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:24:46,175 INFO L276 IsEmpty]: Start isEmpty. Operand 38998 states and 61670 transitions. [2019-10-13 21:24:46,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-13 21:24:46,175 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:46,175 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:46,176 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:46,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:46,176 INFO L82 PathProgramCache]: Analyzing trace with hash -818446556, now seen corresponding path program 1 times [2019-10-13 21:24:46,176 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:46,176 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973548518] [2019-10-13 21:24:46,177 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:46,177 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:46,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:46,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:46,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973548518] [2019-10-13 21:24:46,273 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:46,273 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:24:46,273 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413830047] [2019-10-13 21:24:46,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:24:46,274 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:46,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:24:46,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:46,274 INFO L87 Difference]: Start difference. First operand 38998 states and 61670 transitions. Second operand 5 states. [2019-10-13 21:24:48,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:48,769 INFO L93 Difference]: Finished difference Result 68965 states and 108517 transitions. [2019-10-13 21:24:48,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:24:48,769 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-10-13 21:24:48,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:48,880 INFO L225 Difference]: With dead ends: 68965 [2019-10-13 21:24:48,880 INFO L226 Difference]: Without dead ends: 68963 [2019-10-13 21:24:48,898 INFO L600 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-10-13 21:24:48,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68963 states. [2019-10-13 21:24:51,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68963 to 39854. [2019-10-13 21:24:51,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39854 states. [2019-10-13 21:24:51,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39854 states to 39854 states and 62517 transitions. [2019-10-13 21:24:51,788 INFO L78 Accepts]: Start accepts. Automaton has 39854 states and 62517 transitions. Word has length 75 [2019-10-13 21:24:51,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:51,788 INFO L462 AbstractCegarLoop]: Abstraction has 39854 states and 62517 transitions. [2019-10-13 21:24:51,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:24:51,789 INFO L276 IsEmpty]: Start isEmpty. Operand 39854 states and 62517 transitions. [2019-10-13 21:24:51,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-13 21:24:51,790 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:51,791 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:51,791 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:51,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:51,792 INFO L82 PathProgramCache]: Analyzing trace with hash -886490076, now seen corresponding path program 1 times [2019-10-13 21:24:51,792 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:51,792 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147815537] [2019-10-13 21:24:51,792 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:51,792 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:51,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:51,867 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:51,868 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147815537] [2019-10-13 21:24:51,868 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:51,868 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:51,868 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399017002] [2019-10-13 21:24:51,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:51,869 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:51,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:51,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:51,869 INFO L87 Difference]: Start difference. First operand 39854 states and 62517 transitions. Second operand 3 states. [2019-10-13 21:24:53,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:53,416 INFO L93 Difference]: Finished difference Result 73854 states and 116239 transitions. [2019-10-13 21:24:53,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:53,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-10-13 21:24:53,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:53,464 INFO L225 Difference]: With dead ends: 73854 [2019-10-13 21:24:53,465 INFO L226 Difference]: Without dead ends: 34089 [2019-10-13 21:24:53,508 INFO L600 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-10-13 21:24:53,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34089 states. [2019-10-13 21:24:54,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34089 to 34087. [2019-10-13 21:24:54,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34087 states. [2019-10-13 21:24:54,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34087 states to 34087 states and 53532 transitions. [2019-10-13 21:24:54,988 INFO L78 Accepts]: Start accepts. Automaton has 34087 states and 53532 transitions. Word has length 101 [2019-10-13 21:24:54,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:54,989 INFO L462 AbstractCegarLoop]: Abstraction has 34087 states and 53532 transitions. [2019-10-13 21:24:54,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:54,989 INFO L276 IsEmpty]: Start isEmpty. Operand 34087 states and 53532 transitions. [2019-10-13 21:24:54,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-13 21:24:54,991 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:54,991 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:54,991 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:54,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:54,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1522449336, now seen corresponding path program 1 times [2019-10-13 21:24:54,992 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:54,992 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957253288] [2019-10-13 21:24:54,992 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:54,992 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:54,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:55,067 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:55,068 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957253288] [2019-10-13 21:24:55,068 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:55,068 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:55,068 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134467959] [2019-10-13 21:24:55,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:55,069 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:55,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:55,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:55,070 INFO L87 Difference]: Start difference. First operand 34087 states and 53532 transitions. Second operand 3 states. [2019-10-13 21:24:55,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:55,668 INFO L93 Difference]: Finished difference Result 47480 states and 74651 transitions. [2019-10-13 21:24:55,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:55,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-10-13 21:24:55,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:55,686 INFO L225 Difference]: With dead ends: 47480 [2019-10-13 21:24:55,686 INFO L226 Difference]: Without dead ends: 13512 [2019-10-13 21:24:55,715 INFO L600 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-10-13 21:24:55,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13512 states. [2019-10-13 21:24:56,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13512 to 13510. [2019-10-13 21:24:56,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13510 states. [2019-10-13 21:24:56,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13510 states to 13510 states and 21152 transitions. [2019-10-13 21:24:56,493 INFO L78 Accepts]: Start accepts. Automaton has 13510 states and 21152 transitions. Word has length 101 [2019-10-13 21:24:56,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:56,494 INFO L462 AbstractCegarLoop]: Abstraction has 13510 states and 21152 transitions. [2019-10-13 21:24:56,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:56,494 INFO L276 IsEmpty]: Start isEmpty. Operand 13510 states and 21152 transitions. [2019-10-13 21:24:56,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-13 21:24:56,498 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:56,498 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:56,498 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:56,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:56,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1365075631, now seen corresponding path program 1 times [2019-10-13 21:24:56,499 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:56,499 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115041014] [2019-10-13 21:24:56,499 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:56,499 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:56,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:56,621 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:56,624 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115041014] [2019-10-13 21:24:56,629 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124472627] [2019-10-13 21:24:56,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:24:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:56,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 870 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:24:56,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:24:57,007 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:24:57,008 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:24:57,085 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:24:57,086 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:24:57,086 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-10-13 21:24:57,086 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354531964] [2019-10-13 21:24:57,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:24:57,089 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:57,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:24:57,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:24:57,089 INFO L87 Difference]: Start difference. First operand 13510 states and 21152 transitions. Second operand 5 states. [2019-10-13 21:24:58,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:58,412 INFO L93 Difference]: Finished difference Result 23506 states and 36922 transitions. [2019-10-13 21:24:58,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:58,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-10-13 21:24:58,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:58,477 INFO L225 Difference]: With dead ends: 23506 [2019-10-13 21:24:58,477 INFO L226 Difference]: Without dead ends: 15691 [2019-10-13 21:24:58,494 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 203 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:24:58,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15691 states.