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.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:24:43,024 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:24:43,027 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:24:43,045 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:24:43,046 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:24:43,048 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:24:43,049 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:24:43,058 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:24:43,060 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:24:43,061 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:24:43,062 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:24:43,063 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:24:43,064 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:24:43,066 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:24:43,067 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:24:43,068 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:24:43,068 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:24:43,069 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:24:43,071 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:24:43,072 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:24:43,074 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:24:43,074 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:24:43,075 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:24:43,076 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:24:43,078 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:24:43,078 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:24:43,078 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:24:43,079 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:24:43,080 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:24:43,080 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:24:43,081 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:24:43,081 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:24:43,082 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:24:43,083 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:24:43,084 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:24:43,084 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:24:43,085 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:24:43,085 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:24:43,085 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:24:43,086 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:24:43,087 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:24:43,088 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:43,103 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:24:43,103 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:24:43,104 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:24:43,104 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:24:43,104 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:24:43,105 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:24:43,105 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:24:43,105 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:24:43,105 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:24:43,105 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:24:43,106 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:24:43,106 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:24:43,106 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:24:43,106 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:24:43,106 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:24:43,106 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:24:43,107 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:24:43,107 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:24:43,107 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:24:43,107 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:24:43,107 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:24:43,108 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:24:43,108 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:24:43,108 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:24:43,108 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:24:43,108 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:24:43,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:24:43,109 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:24:43,109 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:43,430 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:24:43,453 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:24:43,456 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:24:43,458 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:24:43,458 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:24:43,459 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.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-13 21:24:43,546 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/668933f55/010a1dc110414378a0cf63339f063d4c/FLAG6f8fa6b98 [2019-10-13 21:24:44,164 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:24:44,165 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-13 21:24:44,184 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/668933f55/010a1dc110414378a0cf63339f063d4c/FLAG6f8fa6b98 [2019-10-13 21:24:44,429 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/668933f55/010a1dc110414378a0cf63339f063d4c [2019-10-13 21:24:44,440 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:24:44,442 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:24:44,445 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:24:44,446 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:24:44,450 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:24:44,451 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:24:44" (1/1) ... [2019-10-13 21:24:44,455 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4325f983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:44, skipping insertion in model container [2019-10-13 21:24:44,455 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:24:44" (1/1) ... [2019-10-13 21:24:44,464 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:24:44,543 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:24:45,093 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:24:45,110 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:24:45,531 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:24:45,550 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:24:45,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:45 WrapperNode [2019-10-13 21:24:45,551 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:24:45,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:24:45,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:24:45,552 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:24:45,562 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:45" (1/1) ... [2019-10-13 21:24:45,563 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:45" (1/1) ... [2019-10-13 21:24:45,578 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:45" (1/1) ... [2019-10-13 21:24:45,579 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:45" (1/1) ... [2019-10-13 21:24:45,604 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:45" (1/1) ... [2019-10-13 21:24:45,627 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:45" (1/1) ... [2019-10-13 21:24:45,632 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:45" (1/1) ... [2019-10-13 21:24:45,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:24:45,650 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:24:45,650 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:24:45,650 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:24:45,653 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:45" (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:45,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:24:45,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:24:45,737 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:24:45,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:24:45,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 21:24:45,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 21:24:45,738 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 21:24:45,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:24:45,738 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 21:24:45,738 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 21:24:45,738 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 21:24:45,739 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 21:24:45,739 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 21:24:45,739 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 21:24:45,739 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 21:24:45,739 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:24:45,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:24:45,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:24:47,412 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:24:47,413 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 21:24:47,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:24:47 BoogieIcfgContainer [2019-10-13 21:24:47,415 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:24:47,419 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:24:47,419 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:24:47,424 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:24:47,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:24:44" (1/3) ... [2019-10-13 21:24:47,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54a7bf28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:24:47, skipping insertion in model container [2019-10-13 21:24:47,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:45" (2/3) ... [2019-10-13 21:24:47,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54a7bf28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:24:47, skipping insertion in model container [2019-10-13 21:24:47,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:24:47" (3/3) ... [2019-10-13 21:24:47,427 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-13 21:24:47,437 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:24:47,446 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:24:47,457 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:24:47,485 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:24:47,485 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:24:47,485 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:24:47,485 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:24:47,485 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:24:47,486 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:24:47,486 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:24:47,486 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:24:47,512 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states. [2019-10-13 21:24:47,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-13 21:24:47,528 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:47,529 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,531 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:47,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:47,537 INFO L82 PathProgramCache]: Analyzing trace with hash 424996304, now seen corresponding path program 1 times [2019-10-13 21:24:47,545 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:47,545 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846507239] [2019-10-13 21:24:47,545 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:47,546 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:47,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:48,260 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:48,261 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846507239] [2019-10-13 21:24:48,262 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:48,262 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:48,263 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287695018] [2019-10-13 21:24:48,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:48,269 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:48,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:48,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:48,287 INFO L87 Difference]: Start difference. First operand 342 states. Second operand 3 states. [2019-10-13 21:24:48,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:48,517 INFO L93 Difference]: Finished difference Result 655 states and 1134 transitions. [2019-10-13 21:24:48,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:48,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-10-13 21:24:48,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:48,544 INFO L225 Difference]: With dead ends: 655 [2019-10-13 21:24:48,545 INFO L226 Difference]: Without dead ends: 540 [2019-10-13 21:24:48,552 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:48,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-10-13 21:24:48,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 538. [2019-10-13 21:24:48,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-10-13 21:24:48,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 803 transitions. [2019-10-13 21:24:48,707 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 803 transitions. Word has length 157 [2019-10-13 21:24:48,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:48,710 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 803 transitions. [2019-10-13 21:24:48,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:48,710 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 803 transitions. [2019-10-13 21:24:48,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-13 21:24:48,723 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:48,724 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,724 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:48,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:48,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1469457116, now seen corresponding path program 1 times [2019-10-13 21:24:48,726 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:48,726 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926109474] [2019-10-13 21:24:48,726 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:48,727 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:48,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:49,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:49,198 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:49,199 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926109474] [2019-10-13 21:24:49,199 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:49,199 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:49,200 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350631872] [2019-10-13 21:24:49,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:49,202 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:49,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:49,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:49,203 INFO L87 Difference]: Start difference. First operand 538 states and 803 transitions. Second operand 4 states. [2019-10-13 21:24:49,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:49,377 INFO L93 Difference]: Finished difference Result 1561 states and 2326 transitions. [2019-10-13 21:24:49,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:49,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-10-13 21:24:49,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:49,384 INFO L225 Difference]: With dead ends: 1561 [2019-10-13 21:24:49,385 INFO L226 Difference]: Without dead ends: 1036 [2019-10-13 21:24:49,389 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:49,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2019-10-13 21:24:49,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1034. [2019-10-13 21:24:49,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2019-10-13 21:24:49,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1529 transitions. [2019-10-13 21:24:49,440 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1529 transitions. Word has length 157 [2019-10-13 21:24:49,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:49,440 INFO L462 AbstractCegarLoop]: Abstraction has 1034 states and 1529 transitions. [2019-10-13 21:24:49,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:49,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1529 transitions. [2019-10-13 21:24:49,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-13 21:24:49,444 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:49,444 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,444 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:49,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:49,445 INFO L82 PathProgramCache]: Analyzing trace with hash -790671312, now seen corresponding path program 1 times [2019-10-13 21:24:49,445 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:49,446 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70057692] [2019-10-13 21:24:49,446 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:49,446 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:49,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:49,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:49,523 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:49,523 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70057692] [2019-10-13 21:24:49,523 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:49,524 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:49,524 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810857230] [2019-10-13 21:24:49,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:49,525 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:49,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:49,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:49,526 INFO L87 Difference]: Start difference. First operand 1034 states and 1529 transitions. Second operand 3 states. [2019-10-13 21:24:49,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:49,635 INFO L93 Difference]: Finished difference Result 3056 states and 4517 transitions. [2019-10-13 21:24:49,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:49,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-10-13 21:24:49,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:49,650 INFO L225 Difference]: With dead ends: 3056 [2019-10-13 21:24:49,650 INFO L226 Difference]: Without dead ends: 2054 [2019-10-13 21:24:49,654 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:49,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2019-10-13 21:24:49,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 1036. [2019-10-13 21:24:49,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2019-10-13 21:24:49,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1531 transitions. [2019-10-13 21:24:49,758 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1531 transitions. Word has length 158 [2019-10-13 21:24:49,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:49,758 INFO L462 AbstractCegarLoop]: Abstraction has 1036 states and 1531 transitions. [2019-10-13 21:24:49,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:49,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1531 transitions. [2019-10-13 21:24:49,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-13 21:24:49,763 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:49,763 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,764 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:49,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:49,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1966932605, now seen corresponding path program 1 times [2019-10-13 21:24:49,765 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:49,765 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135899688] [2019-10-13 21:24:49,765 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:49,765 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:49,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:49,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:50,062 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:50,062 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135899688] [2019-10-13 21:24:50,062 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:50,063 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:50,063 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10562272] [2019-10-13 21:24:50,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:50,064 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:50,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:50,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:50,065 INFO L87 Difference]: Start difference. First operand 1036 states and 1531 transitions. Second operand 4 states. [2019-10-13 21:24:50,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:50,146 INFO L93 Difference]: Finished difference Result 2054 states and 3037 transitions. [2019-10-13 21:24:50,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:50,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-10-13 21:24:50,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:50,153 INFO L225 Difference]: With dead ends: 2054 [2019-10-13 21:24:50,153 INFO L226 Difference]: Without dead ends: 1036 [2019-10-13 21:24:50,156 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:50,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2019-10-13 21:24:50,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1035. [2019-10-13 21:24:50,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1035 states. [2019-10-13 21:24:50,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1528 transitions. [2019-10-13 21:24:50,228 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1528 transitions. Word has length 159 [2019-10-13 21:24:50,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:50,228 INFO L462 AbstractCegarLoop]: Abstraction has 1035 states and 1528 transitions. [2019-10-13 21:24:50,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:50,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1528 transitions. [2019-10-13 21:24:50,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-13 21:24:50,232 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:50,232 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,232 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:50,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:50,233 INFO L82 PathProgramCache]: Analyzing trace with hash 745680526, now seen corresponding path program 1 times [2019-10-13 21:24:50,233 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:50,234 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771804119] [2019-10-13 21:24:50,234 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:50,237 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:50,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:50,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:50,385 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:50,385 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771804119] [2019-10-13 21:24:50,386 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:50,386 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:50,386 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759768893] [2019-10-13 21:24:50,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:50,387 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:50,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:50,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:50,388 INFO L87 Difference]: Start difference. First operand 1035 states and 1528 transitions. Second operand 3 states. [2019-10-13 21:24:50,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:50,562 INFO L93 Difference]: Finished difference Result 2834 states and 4197 transitions. [2019-10-13 21:24:50,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:50,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-10-13 21:24:50,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:50,576 INFO L225 Difference]: With dead ends: 2834 [2019-10-13 21:24:50,576 INFO L226 Difference]: Without dead ends: 1997 [2019-10-13 21:24:50,579 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:50,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2019-10-13 21:24:50,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1995. [2019-10-13 21:24:50,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1995 states. [2019-10-13 21:24:50,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1995 states and 2918 transitions. [2019-10-13 21:24:50,781 INFO L78 Accepts]: Start accepts. Automaton has 1995 states and 2918 transitions. Word has length 159 [2019-10-13 21:24:50,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:50,782 INFO L462 AbstractCegarLoop]: Abstraction has 1995 states and 2918 transitions. [2019-10-13 21:24:50,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:50,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 2918 transitions. [2019-10-13 21:24:50,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-13 21:24:50,787 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:50,787 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,787 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:50,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:50,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1379415471, now seen corresponding path program 1 times [2019-10-13 21:24:50,788 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:50,788 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439831092] [2019-10-13 21:24:50,788 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:50,788 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:50,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:50,956 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:50,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439831092] [2019-10-13 21:24:50,958 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:50,958 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:50,958 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669111205] [2019-10-13 21:24:50,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:50,959 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:50,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:50,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:50,960 INFO L87 Difference]: Start difference. First operand 1995 states and 2918 transitions. Second operand 4 states. [2019-10-13 21:24:51,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:51,075 INFO L93 Difference]: Finished difference Result 3337 states and 4898 transitions. [2019-10-13 21:24:51,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:51,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-10-13 21:24:51,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:51,087 INFO L225 Difference]: With dead ends: 3337 [2019-10-13 21:24:51,089 INFO L226 Difference]: Without dead ends: 1528 [2019-10-13 21:24:51,095 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:51,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2019-10-13 21:24:51,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1528. [2019-10-13 21:24:51,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1528 states. [2019-10-13 21:24:51,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 2228 transitions. [2019-10-13 21:24:51,188 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 2228 transitions. Word has length 159 [2019-10-13 21:24:51,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:51,189 INFO L462 AbstractCegarLoop]: Abstraction has 1528 states and 2228 transitions. [2019-10-13 21:24:51,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:51,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 2228 transitions. [2019-10-13 21:24:51,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-13 21:24:51,193 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:51,193 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,193 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:51,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:51,194 INFO L82 PathProgramCache]: Analyzing trace with hash -51426036, now seen corresponding path program 1 times [2019-10-13 21:24:51,194 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:51,194 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91960464] [2019-10-13 21:24:51,194 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:51,194 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:51,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:51,281 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:51,281 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91960464] [2019-10-13 21:24:51,282 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:51,282 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:51,282 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248550215] [2019-10-13 21:24:51,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:51,283 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:51,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:51,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:51,283 INFO L87 Difference]: Start difference. First operand 1528 states and 2228 transitions. Second operand 3 states. [2019-10-13 21:24:51,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:51,456 INFO L93 Difference]: Finished difference Result 3607 states and 5375 transitions. [2019-10-13 21:24:51,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:51,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-10-13 21:24:51,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:51,468 INFO L225 Difference]: With dead ends: 3607 [2019-10-13 21:24:51,469 INFO L226 Difference]: Without dead ends: 2268 [2019-10-13 21:24:51,472 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:51,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2019-10-13 21:24:51,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 1952. [2019-10-13 21:24:51,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1952 states. [2019-10-13 21:24:51,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 2916 transitions. [2019-10-13 21:24:51,578 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 2916 transitions. Word has length 161 [2019-10-13 21:24:51,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:51,578 INFO L462 AbstractCegarLoop]: Abstraction has 1952 states and 2916 transitions. [2019-10-13 21:24:51,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:51,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2916 transitions. [2019-10-13 21:24:51,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-13 21:24:51,582 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:51,583 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,583 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:51,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:51,583 INFO L82 PathProgramCache]: Analyzing trace with hash -541662678, now seen corresponding path program 1 times [2019-10-13 21:24:51,584 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:51,584 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121117088] [2019-10-13 21:24:51,584 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:51,584 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:51,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:51,670 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:51,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121117088] [2019-10-13 21:24:51,671 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:51,671 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:51,672 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014579731] [2019-10-13 21:24:51,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:51,672 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:51,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:51,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:51,673 INFO L87 Difference]: Start difference. First operand 1952 states and 2916 transitions. Second operand 3 states. [2019-10-13 21:24:51,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:51,859 INFO L93 Difference]: Finished difference Result 4665 states and 7121 transitions. [2019-10-13 21:24:51,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:51,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-10-13 21:24:51,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:51,881 INFO L225 Difference]: With dead ends: 4665 [2019-10-13 21:24:51,882 INFO L226 Difference]: Without dead ends: 2986 [2019-10-13 21:24:51,888 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:51,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2019-10-13 21:24:52,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 2706. [2019-10-13 21:24:52,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2706 states. [2019-10-13 21:24:52,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 4137 transitions. [2019-10-13 21:24:52,116 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 4137 transitions. Word has length 163 [2019-10-13 21:24:52,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:52,116 INFO L462 AbstractCegarLoop]: Abstraction has 2706 states and 4137 transitions. [2019-10-13 21:24:52,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:52,117 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 4137 transitions. [2019-10-13 21:24:52,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-13 21:24:52,121 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:52,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,122 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:52,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:52,122 INFO L82 PathProgramCache]: Analyzing trace with hash 911873176, now seen corresponding path program 1 times [2019-10-13 21:24:52,123 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:52,123 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834003317] [2019-10-13 21:24:52,123 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:52,124 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:52,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:52,445 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:52,445 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834003317] [2019-10-13 21:24:52,446 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:52,446 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:24:52,448 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588644111] [2019-10-13 21:24:52,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:24:52,449 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:52,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:24:52,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:52,450 INFO L87 Difference]: Start difference. First operand 2706 states and 4137 transitions. Second operand 5 states. [2019-10-13 21:24:53,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:53,217 INFO L93 Difference]: Finished difference Result 7601 states and 11754 transitions. [2019-10-13 21:24:53,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:53,218 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 164 [2019-10-13 21:24:53,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:53,252 INFO L225 Difference]: With dead ends: 7601 [2019-10-13 21:24:53,252 INFO L226 Difference]: Without dead ends: 5078 [2019-10-13 21:24:53,260 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:24:53,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5078 states. [2019-10-13 21:24:53,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5078 to 5076. [2019-10-13 21:24:53,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5076 states. [2019-10-13 21:24:53,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5076 states to 5076 states and 7791 transitions. [2019-10-13 21:24:53,743 INFO L78 Accepts]: Start accepts. Automaton has 5076 states and 7791 transitions. Word has length 164 [2019-10-13 21:24:53,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:53,743 INFO L462 AbstractCegarLoop]: Abstraction has 5076 states and 7791 transitions. [2019-10-13 21:24:53,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:24:53,744 INFO L276 IsEmpty]: Start isEmpty. Operand 5076 states and 7791 transitions. [2019-10-13 21:24:53,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-13 21:24:53,749 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:53,749 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,750 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:53,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:53,750 INFO L82 PathProgramCache]: Analyzing trace with hash 2112908957, now seen corresponding path program 1 times [2019-10-13 21:24:53,750 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:53,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903136222] [2019-10-13 21:24:53,751 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:53,751 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:53,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:53,993 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:53,993 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903136222] [2019-10-13 21:24:53,993 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:53,994 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:53,994 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713157664] [2019-10-13 21:24:53,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:53,995 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:53,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:53,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:53,995 INFO L87 Difference]: Start difference. First operand 5076 states and 7791 transitions. Second operand 4 states. [2019-10-13 21:24:54,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:54,526 INFO L93 Difference]: Finished difference Result 13239 states and 20333 transitions. [2019-10-13 21:24:54,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:54,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-10-13 21:24:54,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:54,566 INFO L225 Difference]: With dead ends: 13239 [2019-10-13 21:24:54,566 INFO L226 Difference]: Without dead ends: 8194 [2019-10-13 21:24:54,577 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:54,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8194 states. [2019-10-13 21:24:55,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8194 to 8192. [2019-10-13 21:24:55,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8192 states. [2019-10-13 21:24:55,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8192 states to 8192 states and 12471 transitions. [2019-10-13 21:24:55,040 INFO L78 Accepts]: Start accepts. Automaton has 8192 states and 12471 transitions. Word has length 164 [2019-10-13 21:24:55,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:55,040 INFO L462 AbstractCegarLoop]: Abstraction has 8192 states and 12471 transitions. [2019-10-13 21:24:55,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:55,041 INFO L276 IsEmpty]: Start isEmpty. Operand 8192 states and 12471 transitions. [2019-10-13 21:24:55,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-13 21:24:55,048 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:55,048 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,049 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:55,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:55,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1008257189, now seen corresponding path program 1 times [2019-10-13 21:24:55,049 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:55,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575878879] [2019-10-13 21:24:55,050 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:55,050 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:55,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:55,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:55,160 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:55,161 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575878879] [2019-10-13 21:24:55,161 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:55,161 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:55,161 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071229913] [2019-10-13 21:24:55,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:55,162 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:55,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:55,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:55,163 INFO L87 Difference]: Start difference. First operand 8192 states and 12471 transitions. Second operand 3 states. [2019-10-13 21:24:55,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:55,850 INFO L93 Difference]: Finished difference Result 20555 states and 31330 transitions. [2019-10-13 21:24:55,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:55,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-10-13 21:24:55,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:55,887 INFO L225 Difference]: With dead ends: 20555 [2019-10-13 21:24:55,887 INFO L226 Difference]: Without dead ends: 12739 [2019-10-13 21:24:55,910 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,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12739 states. [2019-10-13 21:24:56,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12739 to 12737. [2019-10-13 21:24:56,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12737 states. [2019-10-13 21:24:56,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12737 states to 12737 states and 19158 transitions. [2019-10-13 21:24:56,755 INFO L78 Accepts]: Start accepts. Automaton has 12737 states and 19158 transitions. Word has length 166 [2019-10-13 21:24:56,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:56,755 INFO L462 AbstractCegarLoop]: Abstraction has 12737 states and 19158 transitions. [2019-10-13 21:24:56,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:56,755 INFO L276 IsEmpty]: Start isEmpty. Operand 12737 states and 19158 transitions. [2019-10-13 21:24:56,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-13 21:24:56,765 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:56,766 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,766 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:56,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:56,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1356015054, now seen corresponding path program 1 times [2019-10-13 21:24:56,767 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:56,767 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720302234] [2019-10-13 21:24:56,767 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:56,767 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:56,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:56,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:56,859 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:56,859 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720302234] [2019-10-13 21:24:56,860 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:56,860 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:56,860 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484859848] [2019-10-13 21:24:56,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:56,861 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:56,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:56,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:56,862 INFO L87 Difference]: Start difference. First operand 12737 states and 19158 transitions. Second operand 3 states. [2019-10-13 21:24:58,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:58,032 INFO L93 Difference]: Finished difference Result 33839 states and 51503 transitions. [2019-10-13 21:24:58,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:58,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-10-13 21:24:58,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:58,096 INFO L225 Difference]: With dead ends: 33839 [2019-10-13 21:24:58,096 INFO L226 Difference]: Without dead ends: 21443 [2019-10-13 21:24:58,130 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:58,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21443 states. [2019-10-13 21:24:59,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21443 to 19533. [2019-10-13 21:24:59,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19533 states. [2019-10-13 21:24:59,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19533 states to 19533 states and 29933 transitions. [2019-10-13 21:24:59,845 INFO L78 Accepts]: Start accepts. Automaton has 19533 states and 29933 transitions. Word has length 170 [2019-10-13 21:24:59,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:59,846 INFO L462 AbstractCegarLoop]: Abstraction has 19533 states and 29933 transitions. [2019-10-13 21:24:59,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:59,846 INFO L276 IsEmpty]: Start isEmpty. Operand 19533 states and 29933 transitions. [2019-10-13 21:24:59,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-13 21:24:59,857 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:59,857 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59,858 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:59,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:59,858 INFO L82 PathProgramCache]: Analyzing trace with hash -927051742, now seen corresponding path program 1 times [2019-10-13 21:24:59,858 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:59,858 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403621688] [2019-10-13 21:24:59,859 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:59,859 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:59,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:59,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:00,068 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:25:00,069 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403621688] [2019-10-13 21:25:00,069 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:00,069 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 21:25:00,069 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220828997] [2019-10-13 21:25:00,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:25:00,070 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:00,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:25:00,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:25:00,071 INFO L87 Difference]: Start difference. First operand 19533 states and 29933 transitions. Second operand 8 states. [2019-10-13 21:25:03,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:03,533 INFO L93 Difference]: Finished difference Result 80177 states and 123376 transitions. [2019-10-13 21:25:03,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 21:25:03,533 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 171 [2019-10-13 21:25:03,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:03,703 INFO L225 Difference]: With dead ends: 80177 [2019-10-13 21:25:03,703 INFO L226 Difference]: Without dead ends: 61059 [2019-10-13 21:25:03,746 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:25:03,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61059 states. [2019-10-13 21:25:06,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61059 to 32625. [2019-10-13 21:25:06,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32625 states. [2019-10-13 21:25:06,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32625 states to 32625 states and 49361 transitions. [2019-10-13 21:25:06,383 INFO L78 Accepts]: Start accepts. Automaton has 32625 states and 49361 transitions. Word has length 171 [2019-10-13 21:25:06,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:06,384 INFO L462 AbstractCegarLoop]: Abstraction has 32625 states and 49361 transitions. [2019-10-13 21:25:06,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:25:06,384 INFO L276 IsEmpty]: Start isEmpty. Operand 32625 states and 49361 transitions. [2019-10-13 21:25:06,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-13 21:25:06,394 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:06,394 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:06,394 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:06,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:06,395 INFO L82 PathProgramCache]: Analyzing trace with hash 299202232, now seen corresponding path program 1 times [2019-10-13 21:25:06,395 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:06,395 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106456973] [2019-10-13 21:25:06,395 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:06,396 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:06,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:06,591 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:25:06,592 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106456973] [2019-10-13 21:25:06,592 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:06,592 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:06,592 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538653121] [2019-10-13 21:25:06,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:06,593 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:06,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:06,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:06,594 INFO L87 Difference]: Start difference. First operand 32625 states and 49361 transitions. Second operand 4 states. [2019-10-13 21:25:09,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:09,426 INFO L93 Difference]: Finished difference Result 90603 states and 136692 transitions. [2019-10-13 21:25:09,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:09,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-10-13 21:25:09,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:09,544 INFO L225 Difference]: With dead ends: 90603 [2019-10-13 21:25:09,544 INFO L226 Difference]: Without dead ends: 58021 [2019-10-13 21:25:09,597 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:09,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58021 states. [2019-10-13 21:25:13,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58021 to 58019. [2019-10-13 21:25:13,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58019 states. [2019-10-13 21:25:13,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58019 states to 58019 states and 86398 transitions. [2019-10-13 21:25:13,968 INFO L78 Accepts]: Start accepts. Automaton has 58019 states and 86398 transitions. Word has length 171 [2019-10-13 21:25:13,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:13,969 INFO L462 AbstractCegarLoop]: Abstraction has 58019 states and 86398 transitions. [2019-10-13 21:25:13,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:13,969 INFO L276 IsEmpty]: Start isEmpty. Operand 58019 states and 86398 transitions. [2019-10-13 21:25:13,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-13 21:25:13,987 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:13,987 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:13,987 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:13,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:13,988 INFO L82 PathProgramCache]: Analyzing trace with hash -996193854, now seen corresponding path program 1 times [2019-10-13 21:25:13,988 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:13,988 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497833239] [2019-10-13 21:25:13,988 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:13,989 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:13,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:14,050 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:25:14,051 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497833239] [2019-10-13 21:25:14,051 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:14,051 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:25:14,051 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365417137] [2019-10-13 21:25:14,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:25:14,052 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:14,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:25:14,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:25:14,053 INFO L87 Difference]: Start difference. First operand 58019 states and 86398 transitions. Second operand 3 states.