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_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:24:07,526 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:24:07,528 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:24:07,541 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:24:07,542 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:24:07,543 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:24:07,544 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:24:07,546 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:24:07,548 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:24:07,549 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:24:07,549 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:24:07,551 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:24:07,551 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:24:07,552 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:24:07,553 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:24:07,554 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:24:07,555 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:24:07,556 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:24:07,558 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:24:07,560 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:24:07,561 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:24:07,563 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:24:07,564 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:24:07,565 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:24:07,567 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:24:07,567 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:24:07,567 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:24:07,568 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:24:07,569 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:24:07,570 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:24:07,570 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:24:07,571 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:24:07,572 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:24:07,572 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:24:07,574 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:24:07,574 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:24:07,575 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:24:07,575 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:24:07,575 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:24:07,576 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:24:07,577 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:24:07,578 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:07,592 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:24:07,592 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:24:07,594 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:24:07,594 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:24:07,594 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:24:07,594 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:24:07,594 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:24:07,595 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:24:07,595 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:24:07,595 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:24:07,595 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:24:07,595 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:24:07,596 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:24:07,596 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:24:07,596 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:24:07,596 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:24:07,596 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:24:07,597 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:24:07,597 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:24:07,597 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:24:07,597 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:24:07,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:24:07,598 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:24:07,598 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:24:07,598 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:24:07,598 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:24:07,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:24:07,599 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:24:07,599 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:07,870 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:24:07,882 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:24:07,886 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:24:07,887 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:24:07,887 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:24:07,888 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-10-13 21:24:07,951 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c6fc386c/d92a24f51a60424cb25370a9a7bf9815/FLAG439357c0f [2019-10-13 21:24:08,673 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:24:08,674 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-10-13 21:24:08,709 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c6fc386c/d92a24f51a60424cb25370a9a7bf9815/FLAG439357c0f [2019-10-13 21:24:08,794 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c6fc386c/d92a24f51a60424cb25370a9a7bf9815 [2019-10-13 21:24:08,805 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:24:08,807 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:24:08,808 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:24:08,808 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:24:08,811 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:24:08,812 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:24:08" (1/1) ... [2019-10-13 21:24:08,815 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1df0f68b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:08, skipping insertion in model container [2019-10-13 21:24:08,815 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:24:08" (1/1) ... [2019-10-13 21:24:08,823 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:24:08,996 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:24:10,120 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:24:10,146 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:24:10,492 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:24:10,540 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:24:10,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:10 WrapperNode [2019-10-13 21:24:10,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:24:10,541 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:24:10,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:24:10,542 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:24:10,561 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:10" (1/1) ... [2019-10-13 21:24:10,561 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:10" (1/1) ... [2019-10-13 21:24:10,642 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:10" (1/1) ... [2019-10-13 21:24:10,645 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:10" (1/1) ... [2019-10-13 21:24:10,741 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:10" (1/1) ... [2019-10-13 21:24:10,786 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:10" (1/1) ... [2019-10-13 21:24:10,806 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:10" (1/1) ... [2019-10-13 21:24:10,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:24:10,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:24:10,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:24:10,830 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:24:10,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:10" (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:10,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:24:10,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:24:10,904 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:24:10,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:24:10,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 21:24:10,906 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 21:24:10,906 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 21:24:10,906 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:24:10,907 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 21:24:10,907 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 21:24:10,908 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 21:24:10,908 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 21:24:10,909 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 21:24:10,909 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 21:24:10,910 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 21:24:10,910 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:24:10,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:24:10,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:24:14,485 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:24:14,487 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 21:24:14,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:24:14 BoogieIcfgContainer [2019-10-13 21:24:14,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:24:14,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:24:14,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:24:14,495 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:24:14,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:24:08" (1/3) ... [2019-10-13 21:24:14,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c0fc0fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:24:14, skipping insertion in model container [2019-10-13 21:24:14,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:10" (2/3) ... [2019-10-13 21:24:14,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c0fc0fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:24:14, skipping insertion in model container [2019-10-13 21:24:14,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:24:14" (3/3) ... [2019-10-13 21:24:14,499 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-10-13 21:24:14,509 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:24:14,519 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-13 21:24:14,531 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-13 21:24:14,567 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:24:14,567 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:24:14,568 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:24:14,568 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:24:14,568 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:24:14,568 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:24:14,569 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:24:14,569 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:24:14,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states. [2019-10-13 21:24:14,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 21:24:14,631 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:14,633 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] [2019-10-13 21:24:14,635 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:14,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:14,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1212138476, now seen corresponding path program 1 times [2019-10-13 21:24:14,653 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:14,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491853602] [2019-10-13 21:24:14,654 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:14,654 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:14,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:15,400 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:15,400 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491853602] [2019-10-13 21:24:15,401 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:15,402 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:24:15,402 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658079274] [2019-10-13 21:24:15,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:24:15,408 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:15,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:24:15,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:24:15,426 INFO L87 Difference]: Start difference. First operand 1195 states. Second operand 6 states. [2019-10-13 21:24:17,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:17,510 INFO L93 Difference]: Finished difference Result 2390 states and 4093 transitions. [2019-10-13 21:24:17,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:17,512 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-10-13 21:24:17,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:17,542 INFO L225 Difference]: With dead ends: 2390 [2019-10-13 21:24:17,542 INFO L226 Difference]: Without dead ends: 1617 [2019-10-13 21:24:17,556 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:24:17,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2019-10-13 21:24:17,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1594. [2019-10-13 21:24:17,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1594 states. [2019-10-13 21:24:17,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 2070 transitions. [2019-10-13 21:24:17,748 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 2070 transitions. Word has length 56 [2019-10-13 21:24:17,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:17,748 INFO L462 AbstractCegarLoop]: Abstraction has 1594 states and 2070 transitions. [2019-10-13 21:24:17,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:24:17,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 2070 transitions. [2019-10-13 21:24:17,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 21:24:17,758 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:17,758 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] [2019-10-13 21:24:17,759 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:17,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:17,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1633149148, now seen corresponding path program 1 times [2019-10-13 21:24:17,760 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:17,761 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654476223] [2019-10-13 21:24:17,761 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:17,761 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:17,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:18,014 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:18,015 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654476223] [2019-10-13 21:24:18,015 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:18,015 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:24:18,016 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175971589] [2019-10-13 21:24:18,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:24:18,018 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:18,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:24:18,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:24:18,019 INFO L87 Difference]: Start difference. First operand 1594 states and 2070 transitions. Second operand 6 states. [2019-10-13 21:24:19,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:19,417 INFO L93 Difference]: Finished difference Result 3490 states and 4654 transitions. [2019-10-13 21:24:19,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:19,418 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-10-13 21:24:19,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:19,430 INFO L225 Difference]: With dead ends: 3490 [2019-10-13 21:24:19,431 INFO L226 Difference]: Without dead ends: 2530 [2019-10-13 21:24:19,434 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:24:19,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2530 states. [2019-10-13 21:24:19,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2530 to 2514. [2019-10-13 21:24:19,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2514 states. [2019-10-13 21:24:19,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2514 states to 2514 states and 3354 transitions. [2019-10-13 21:24:19,538 INFO L78 Accepts]: Start accepts. Automaton has 2514 states and 3354 transitions. Word has length 56 [2019-10-13 21:24:19,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:19,538 INFO L462 AbstractCegarLoop]: Abstraction has 2514 states and 3354 transitions. [2019-10-13 21:24:19,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:24:19,539 INFO L276 IsEmpty]: Start isEmpty. Operand 2514 states and 3354 transitions. [2019-10-13 21:24:19,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 21:24:19,542 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:19,543 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] [2019-10-13 21:24:19,543 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:19,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:19,543 INFO L82 PathProgramCache]: Analyzing trace with hash -755922083, now seen corresponding path program 1 times [2019-10-13 21:24:19,544 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:19,544 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98158834] [2019-10-13 21:24:19,544 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:19,544 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:19,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:19,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:19,675 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:19,676 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98158834] [2019-10-13 21:24:19,676 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:19,676 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:24:19,676 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575484836] [2019-10-13 21:24:19,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:24:19,678 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:19,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:24:19,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:19,679 INFO L87 Difference]: Start difference. First operand 2514 states and 3354 transitions. Second operand 5 states. [2019-10-13 21:24:21,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:21,014 INFO L93 Difference]: Finished difference Result 5219 states and 7042 transitions. [2019-10-13 21:24:21,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:21,015 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-10-13 21:24:21,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:21,033 INFO L225 Difference]: With dead ends: 5219 [2019-10-13 21:24:21,034 INFO L226 Difference]: Without dead ends: 3904 [2019-10-13 21:24:21,039 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:24:21,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3904 states. [2019-10-13 21:24:21,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3904 to 3898. [2019-10-13 21:24:21,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3898 states. [2019-10-13 21:24:21,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3898 states to 3898 states and 5174 transitions. [2019-10-13 21:24:21,208 INFO L78 Accepts]: Start accepts. Automaton has 3898 states and 5174 transitions. Word has length 56 [2019-10-13 21:24:21,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:21,210 INFO L462 AbstractCegarLoop]: Abstraction has 3898 states and 5174 transitions. [2019-10-13 21:24:21,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:24:21,210 INFO L276 IsEmpty]: Start isEmpty. Operand 3898 states and 5174 transitions. [2019-10-13 21:24:21,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 21:24:21,214 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:21,214 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] [2019-10-13 21:24:21,215 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:21,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:21,215 INFO L82 PathProgramCache]: Analyzing trace with hash -418972447, now seen corresponding path program 1 times [2019-10-13 21:24:21,216 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:21,216 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029549671] [2019-10-13 21:24:21,216 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:21,217 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:21,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:21,536 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:21,537 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029549671] [2019-10-13 21:24:21,537 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:21,537 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 21:24:21,538 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90739681] [2019-10-13 21:24:21,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:24:21,538 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:21,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:24:21,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:24:21,540 INFO L87 Difference]: Start difference. First operand 3898 states and 5174 transitions. Second operand 8 states. [2019-10-13 21:24:24,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:24,356 INFO L93 Difference]: Finished difference Result 8917 states and 12719 transitions. [2019-10-13 21:24:24,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 21:24:24,356 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-10-13 21:24:24,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:24,390 INFO L225 Difference]: With dead ends: 8917 [2019-10-13 21:24:24,390 INFO L226 Difference]: Without dead ends: 7575 [2019-10-13 21:24:24,395 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:24:24,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7575 states. [2019-10-13 21:24:24,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7575 to 3898. [2019-10-13 21:24:24,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3898 states. [2019-10-13 21:24:24,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3898 states to 3898 states and 5173 transitions. [2019-10-13 21:24:24,631 INFO L78 Accepts]: Start accepts. Automaton has 3898 states and 5173 transitions. Word has length 58 [2019-10-13 21:24:24,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:24,631 INFO L462 AbstractCegarLoop]: Abstraction has 3898 states and 5173 transitions. [2019-10-13 21:24:24,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:24:24,631 INFO L276 IsEmpty]: Start isEmpty. Operand 3898 states and 5173 transitions. [2019-10-13 21:24:24,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 21:24:24,637 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:24,638 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] [2019-10-13 21:24:24,638 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:24,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:24,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1952539007, now seen corresponding path program 1 times [2019-10-13 21:24:24,639 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:24,639 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617072544] [2019-10-13 21:24:24,640 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:24,640 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:24,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:24,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:24,913 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617072544] [2019-10-13 21:24:24,913 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:24,913 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:24:24,914 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746541540] [2019-10-13 21:24:24,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:24:24,915 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:24,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:24:24,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:24:24,916 INFO L87 Difference]: Start difference. First operand 3898 states and 5173 transitions. Second operand 9 states. [2019-10-13 21:24:28,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:28,972 INFO L93 Difference]: Finished difference Result 8308 states and 11719 transitions. [2019-10-13 21:24:28,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-13 21:24:28,972 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-10-13 21:24:28,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:29,017 INFO L225 Difference]: With dead ends: 8308 [2019-10-13 21:24:29,017 INFO L226 Difference]: Without dead ends: 8302 [2019-10-13 21:24:29,021 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-10-13 21:24:29,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8302 states. [2019-10-13 21:24:29,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8302 to 3898. [2019-10-13 21:24:29,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3898 states. [2019-10-13 21:24:29,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3898 states to 3898 states and 5172 transitions. [2019-10-13 21:24:29,278 INFO L78 Accepts]: Start accepts. Automaton has 3898 states and 5172 transitions. Word has length 58 [2019-10-13 21:24:29,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:29,279 INFO L462 AbstractCegarLoop]: Abstraction has 3898 states and 5172 transitions. [2019-10-13 21:24:29,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:24:29,279 INFO L276 IsEmpty]: Start isEmpty. Operand 3898 states and 5172 transitions. [2019-10-13 21:24:29,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 21:24:29,282 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:29,283 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] [2019-10-13 21:24:29,283 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:29,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:29,284 INFO L82 PathProgramCache]: Analyzing trace with hash -215970595, now seen corresponding path program 1 times [2019-10-13 21:24:29,284 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:29,284 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129434183] [2019-10-13 21:24:29,284 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:29,284 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:29,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:29,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:29,559 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,560 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129434183] [2019-10-13 21:24:29,561 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:29,561 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:24:29,562 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545705076] [2019-10-13 21:24:29,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:24:29,563 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:29,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:24:29,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:24:29,564 INFO L87 Difference]: Start difference. First operand 3898 states and 5172 transitions. Second operand 9 states. [2019-10-13 21:24:33,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:33,337 INFO L93 Difference]: Finished difference Result 10341 states and 14551 transitions. [2019-10-13 21:24:33,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 21:24:33,337 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-10-13 21:24:33,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:33,376 INFO L225 Difference]: With dead ends: 10341 [2019-10-13 21:24:33,376 INFO L226 Difference]: Without dead ends: 9285 [2019-10-13 21:24:33,381 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-10-13 21:24:33,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9285 states. [2019-10-13 21:24:33,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9285 to 3898. [2019-10-13 21:24:33,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3898 states. [2019-10-13 21:24:33,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3898 states to 3898 states and 5171 transitions. [2019-10-13 21:24:33,669 INFO L78 Accepts]: Start accepts. Automaton has 3898 states and 5171 transitions. Word has length 58 [2019-10-13 21:24:33,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:33,669 INFO L462 AbstractCegarLoop]: Abstraction has 3898 states and 5171 transitions. [2019-10-13 21:24:33,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:24:33,670 INFO L276 IsEmpty]: Start isEmpty. Operand 3898 states and 5171 transitions. [2019-10-13 21:24:33,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 21:24:33,674 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:33,674 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] [2019-10-13 21:24:33,674 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:33,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:33,675 INFO L82 PathProgramCache]: Analyzing trace with hash 834918715, now seen corresponding path program 1 times [2019-10-13 21:24:33,675 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:33,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549857165] [2019-10-13 21:24:33,675 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:33,676 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:33,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:33,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:33,768 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:33,768 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549857165] [2019-10-13 21:24:33,769 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:33,769 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:33,769 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018681442] [2019-10-13 21:24:33,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:33,770 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:33,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:33,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:33,770 INFO L87 Difference]: Start difference. First operand 3898 states and 5171 transitions. Second operand 3 states. [2019-10-13 21:24:34,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:34,297 INFO L93 Difference]: Finished difference Result 5770 states and 8000 transitions. [2019-10-13 21:24:34,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:34,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-13 21:24:34,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:34,321 INFO L225 Difference]: With dead ends: 5770 [2019-10-13 21:24:34,322 INFO L226 Difference]: Without dead ends: 4287 [2019-10-13 21:24:34,326 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:34,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4287 states. [2019-10-13 21:24:34,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4287 to 3971. [2019-10-13 21:24:34,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3971 states. [2019-10-13 21:24:34,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3971 states to 3971 states and 5314 transitions. [2019-10-13 21:24:34,685 INFO L78 Accepts]: Start accepts. Automaton has 3971 states and 5314 transitions. Word has length 59 [2019-10-13 21:24:34,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:34,687 INFO L462 AbstractCegarLoop]: Abstraction has 3971 states and 5314 transitions. [2019-10-13 21:24:34,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:34,687 INFO L276 IsEmpty]: Start isEmpty. Operand 3971 states and 5314 transitions. [2019-10-13 21:24:34,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 21:24:34,690 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:34,691 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] [2019-10-13 21:24:34,691 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:34,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:34,691 INFO L82 PathProgramCache]: Analyzing trace with hash 132280932, now seen corresponding path program 1 times [2019-10-13 21:24:34,692 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:34,692 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937547033] [2019-10-13 21:24:34,693 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:34,693 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:34,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:34,816 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,817 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937547033] [2019-10-13 21:24:34,817 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:34,817 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:34,817 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835776115] [2019-10-13 21:24:34,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:34,818 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:34,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:34,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:34,819 INFO L87 Difference]: Start difference. First operand 3971 states and 5314 transitions. Second operand 3 states. [2019-10-13 21:24:35,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:35,311 INFO L93 Difference]: Finished difference Result 6729 states and 9451 transitions. [2019-10-13 21:24:35,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:35,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-13 21:24:35,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:35,321 INFO L225 Difference]: With dead ends: 6729 [2019-10-13 21:24:35,321 INFO L226 Difference]: Without dead ends: 4943 [2019-10-13 21:24:35,325 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,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4943 states. [2019-10-13 21:24:35,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4943 to 4463. [2019-10-13 21:24:35,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4463 states. [2019-10-13 21:24:35,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4463 states to 4463 states and 6066 transitions. [2019-10-13 21:24:35,765 INFO L78 Accepts]: Start accepts. Automaton has 4463 states and 6066 transitions. Word has length 59 [2019-10-13 21:24:35,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:35,765 INFO L462 AbstractCegarLoop]: Abstraction has 4463 states and 6066 transitions. [2019-10-13 21:24:35,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:35,766 INFO L276 IsEmpty]: Start isEmpty. Operand 4463 states and 6066 transitions. [2019-10-13 21:24:35,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 21:24:35,769 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:35,769 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] [2019-10-13 21:24:35,770 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:35,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:35,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1642469980, now seen corresponding path program 1 times [2019-10-13 21:24:35,770 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:35,771 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646088125] [2019-10-13 21:24:35,771 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:35,771 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:35,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:35,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:35,857 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:35,857 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646088125] [2019-10-13 21:24:35,858 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:35,858 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:35,858 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801671910] [2019-10-13 21:24:35,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:35,859 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:35,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:35,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:35,860 INFO L87 Difference]: Start difference. First operand 4463 states and 6066 transitions. Second operand 3 states. [2019-10-13 21:24:36,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:36,517 INFO L93 Difference]: Finished difference Result 8919 states and 12582 transitions. [2019-10-13 21:24:36,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:36,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-13 21:24:36,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:36,530 INFO L225 Difference]: With dead ends: 8919 [2019-10-13 21:24:36,530 INFO L226 Difference]: Without dead ends: 5699 [2019-10-13 21:24:36,537 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:36,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5699 states. [2019-10-13 21:24:37,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5699 to 5697. [2019-10-13 21:24:37,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5697 states. [2019-10-13 21:24:37,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5697 states to 5697 states and 7848 transitions. [2019-10-13 21:24:37,118 INFO L78 Accepts]: Start accepts. Automaton has 5697 states and 7848 transitions. Word has length 59 [2019-10-13 21:24:37,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:37,118 INFO L462 AbstractCegarLoop]: Abstraction has 5697 states and 7848 transitions. [2019-10-13 21:24:37,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:37,119 INFO L276 IsEmpty]: Start isEmpty. Operand 5697 states and 7848 transitions. [2019-10-13 21:24:37,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 21:24:37,122 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:37,122 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:37,122 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:37,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:37,123 INFO L82 PathProgramCache]: Analyzing trace with hash 11887072, now seen corresponding path program 1 times [2019-10-13 21:24:37,123 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:37,123 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505823745] [2019-10-13 21:24:37,123 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:37,124 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:37,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:37,205 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:37,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505823745] [2019-10-13 21:24:37,206 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:37,206 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:37,206 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216932594] [2019-10-13 21:24:37,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:37,207 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:37,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:37,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:37,208 INFO L87 Difference]: Start difference. First operand 5697 states and 7848 transitions. Second operand 3 states. [2019-10-13 21:24:38,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:38,034 INFO L93 Difference]: Finished difference Result 13367 states and 18972 transitions. [2019-10-13 21:24:38,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:38,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-13 21:24:38,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:38,048 INFO L225 Difference]: With dead ends: 13367 [2019-10-13 21:24:38,048 INFO L226 Difference]: Without dead ends: 8543 [2019-10-13 21:24:38,060 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:38,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8543 states. [2019-10-13 21:24:38,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8543 to 6757. [2019-10-13 21:24:38,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6757 states. [2019-10-13 21:24:38,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6757 states to 6757 states and 9505 transitions. [2019-10-13 21:24:38,827 INFO L78 Accepts]: Start accepts. Automaton has 6757 states and 9505 transitions. Word has length 60 [2019-10-13 21:24:38,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:38,827 INFO L462 AbstractCegarLoop]: Abstraction has 6757 states and 9505 transitions. [2019-10-13 21:24:38,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:38,828 INFO L276 IsEmpty]: Start isEmpty. Operand 6757 states and 9505 transitions. [2019-10-13 21:24:38,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 21:24:38,830 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:38,830 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:38,830 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:38,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:38,831 INFO L82 PathProgramCache]: Analyzing trace with hash -2065078364, now seen corresponding path program 1 times [2019-10-13 21:24:38,831 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:38,831 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055223941] [2019-10-13 21:24:38,831 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:38,831 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:38,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:38,905 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,905 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055223941] [2019-10-13 21:24:38,906 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:38,906 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:38,906 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167407688] [2019-10-13 21:24:38,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:38,907 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:38,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:38,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:38,907 INFO L87 Difference]: Start difference. First operand 6757 states and 9505 transitions. Second operand 3 states. [2019-10-13 21:24:39,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:39,962 INFO L93 Difference]: Finished difference Result 17110 states and 24518 transitions. [2019-10-13 21:24:39,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:39,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-13 21:24:39,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:39,974 INFO L225 Difference]: With dead ends: 17110 [2019-10-13 21:24:39,974 INFO L226 Difference]: Without dead ends: 10944 [2019-10-13 21:24:39,985 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:39,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10944 states. [2019-10-13 21:24:40,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10944 to 8515. [2019-10-13 21:24:40,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8515 states. [2019-10-13 21:24:40,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8515 states to 8515 states and 12125 transitions. [2019-10-13 21:24:40,732 INFO L78 Accepts]: Start accepts. Automaton has 8515 states and 12125 transitions. Word has length 60 [2019-10-13 21:24:40,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:40,732 INFO L462 AbstractCegarLoop]: Abstraction has 8515 states and 12125 transitions. [2019-10-13 21:24:40,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:40,732 INFO L276 IsEmpty]: Start isEmpty. Operand 8515 states and 12125 transitions. [2019-10-13 21:24:40,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 21:24:40,734 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:40,735 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:40,735 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:40,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:40,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1780702045, now seen corresponding path program 1 times [2019-10-13 21:24:40,736 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:40,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652616557] [2019-10-13 21:24:40,736 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:40,736 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:40,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:41,347 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,347 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652616557] [2019-10-13 21:24:41,347 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:41,347 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:24:41,348 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20511501] [2019-10-13 21:24:41,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:24:41,349 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:41,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:24:41,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:24:41,350 INFO L87 Difference]: Start difference. First operand 8515 states and 12125 transitions. Second operand 10 states. [2019-10-13 21:24:42,044 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29