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.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:23:51,264 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:23:51,266 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:23:51,285 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:23:51,285 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:23:51,287 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:23:51,289 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:23:51,302 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:23:51,304 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:23:51,305 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:23:51,308 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:23:51,310 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:23:51,310 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:23:51,313 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:23:51,316 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:23:51,318 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:23:51,320 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:23:51,321 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:23:51,323 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:23:51,329 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:23:51,333 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:23:51,334 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:23:51,336 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:23:51,336 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:23:51,340 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:23:51,340 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:23:51,341 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:23:51,342 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:23:51,344 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:23:51,345 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:23:51,345 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:23:51,347 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:23:51,348 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:23:51,349 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:23:51,350 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:23:51,351 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:23:51,351 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:23:51,351 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:23:51,352 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:23:51,354 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:23:51,357 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:23:51,359 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-15 01:23:51,380 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:23:51,380 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:23:51,383 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:23:51,383 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:23:51,383 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:23:51,383 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:23:51,384 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:23:51,384 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:23:51,384 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:23:51,384 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:23:51,385 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:23:51,386 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:23:51,386 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:23:51,387 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:23:51,387 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:23:51,387 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:23:51,387 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:23:51,387 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:23:51,388 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:23:51,388 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:23:51,388 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:23:51,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:23:51,389 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:23:51,389 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:23:51,389 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:23:51,389 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:23:51,389 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:23:51,390 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:23:51,390 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-15 01:23:51,710 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:23:51,727 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:23:51,732 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:23:51,733 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:23:51,734 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:23:51,734 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.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-15 01:23:51,807 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/934a7be3f/f91820c48a004c4ea520ce3778c3e7c7/FLAGc248b3423 [2019-10-15 01:23:52,369 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:23:52,370 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-15 01:23:52,386 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/934a7be3f/f91820c48a004c4ea520ce3778c3e7c7/FLAGc248b3423 [2019-10-15 01:23:52,702 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/934a7be3f/f91820c48a004c4ea520ce3778c3e7c7 [2019-10-15 01:23:52,716 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:23:52,717 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:23:52,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:23:52,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:23:52,721 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:23:52,722 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:23:52" (1/1) ... [2019-10-15 01:23:52,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ef64dac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:52, skipping insertion in model container [2019-10-15 01:23:52,725 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:23:52" (1/1) ... [2019-10-15 01:23:52,731 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:23:52,805 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:23:53,354 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:23:53,366 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:23:53,517 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:23:53,535 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:23:53,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:53 WrapperNode [2019-10-15 01:23:53,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:23:53,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:23:53,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:23:53,537 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:23:53,550 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:53" (1/1) ... [2019-10-15 01:23:53,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:53" (1/1) ... [2019-10-15 01:23:53,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:53" (1/1) ... [2019-10-15 01:23:53,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:53" (1/1) ... [2019-10-15 01:23:53,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:53" (1/1) ... [2019-10-15 01:23:53,616 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:53" (1/1) ... [2019-10-15 01:23:53,631 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:53" (1/1) ... [2019-10-15 01:23:53,644 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:23:53,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:23:53,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:23:53,645 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:23:53,646 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:53" (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-15 01:23:53,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:23:53,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:23:53,724 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:23:53,725 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:23:53,725 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:23:53,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-15 01:23:53,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 01:23:53,726 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 01:23:53,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:23:53,727 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 01:23:53,727 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 01:23:53,728 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 01:23:53,728 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 01:23:53,729 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 01:23:53,729 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 01:23:53,729 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 01:23:53,732 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:23:53,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:23:53,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:23:55,245 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:23:55,245 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 01:23:55,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:23:55 BoogieIcfgContainer [2019-10-15 01:23:55,247 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:23:55,248 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:23:55,248 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:23:55,251 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:23:55,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:23:52" (1/3) ... [2019-10-15 01:23:55,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a928d81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:23:55, skipping insertion in model container [2019-10-15 01:23:55,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:53" (2/3) ... [2019-10-15 01:23:55,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a928d81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:23:55, skipping insertion in model container [2019-10-15 01:23:55,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:23:55" (3/3) ... [2019-10-15 01:23:55,255 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-15 01:23:55,264 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:23:55,273 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:23:55,285 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:23:55,315 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:23:55,315 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:23:55,315 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:23:55,316 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:23:55,316 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:23:55,316 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:23:55,316 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:23:55,316 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:23:55,343 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states. [2019-10-15 01:23:55,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-15 01:23:55,360 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:55,361 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] [2019-10-15 01:23:55,363 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:55,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:55,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1155837260, now seen corresponding path program 1 times [2019-10-15 01:23:55,379 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:55,379 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547043702] [2019-10-15 01:23:55,379 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:55,380 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:55,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:55,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:56,139 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-15 01:23:56,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547043702] [2019-10-15 01:23:56,142 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:56,142 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:56,143 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778735942] [2019-10-15 01:23:56,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:56,154 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:56,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:56,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:56,174 INFO L87 Difference]: Start difference. First operand 336 states. Second operand 3 states. [2019-10-15 01:23:56,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:56,405 INFO L93 Difference]: Finished difference Result 647 states and 1119 transitions. [2019-10-15 01:23:56,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:56,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-10-15 01:23:56,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:56,445 INFO L225 Difference]: With dead ends: 647 [2019-10-15 01:23:56,447 INFO L226 Difference]: Without dead ends: 527 [2019-10-15 01:23:56,459 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-15 01:23:56,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-10-15 01:23:56,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 525. [2019-10-15 01:23:56,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2019-10-15 01:23:56,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 780 transitions. [2019-10-15 01:23:56,615 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 780 transitions. Word has length 156 [2019-10-15 01:23:56,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:56,618 INFO L462 AbstractCegarLoop]: Abstraction has 525 states and 780 transitions. [2019-10-15 01:23:56,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:56,619 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 780 transitions. [2019-10-15 01:23:56,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-15 01:23:56,630 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:56,630 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] [2019-10-15 01:23:56,631 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:56,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:56,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1353690447, now seen corresponding path program 1 times [2019-10-15 01:23:56,632 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:56,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469281550] [2019-10-15 01:23:56,632 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:56,633 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:56,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:57,130 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-15 01:23:57,131 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469281550] [2019-10-15 01:23:57,131 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:57,131 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:57,131 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706099815] [2019-10-15 01:23:57,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:57,135 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:57,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:57,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:57,136 INFO L87 Difference]: Start difference. First operand 525 states and 780 transitions. Second operand 4 states. [2019-10-15 01:23:57,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:57,285 INFO L93 Difference]: Finished difference Result 1532 states and 2273 transitions. [2019-10-15 01:23:57,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:57,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-10-15 01:23:57,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:57,293 INFO L225 Difference]: With dead ends: 1532 [2019-10-15 01:23:57,294 INFO L226 Difference]: Without dead ends: 1020 [2019-10-15 01:23:57,301 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-15 01:23:57,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2019-10-15 01:23:57,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 1018. [2019-10-15 01:23:57,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1018 states. [2019-10-15 01:23:57,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1501 transitions. [2019-10-15 01:23:57,373 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1501 transitions. Word has length 156 [2019-10-15 01:23:57,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:57,375 INFO L462 AbstractCegarLoop]: Abstraction has 1018 states and 1501 transitions. [2019-10-15 01:23:57,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:57,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1501 transitions. [2019-10-15 01:23:57,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-15 01:23:57,379 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:57,380 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-15 01:23:57,381 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:57,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:57,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1552789903, now seen corresponding path program 1 times [2019-10-15 01:23:57,382 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:57,382 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43141909] [2019-10-15 01:23:57,382 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:57,383 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:57,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:57,473 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-15 01:23:57,474 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43141909] [2019-10-15 01:23:57,474 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:57,474 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:57,474 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741619399] [2019-10-15 01:23:57,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:57,478 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:57,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:57,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:57,479 INFO L87 Difference]: Start difference. First operand 1018 states and 1501 transitions. Second operand 3 states. [2019-10-15 01:23:57,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:57,599 INFO L93 Difference]: Finished difference Result 3008 states and 4433 transitions. [2019-10-15 01:23:57,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:57,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-10-15 01:23:57,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:57,618 INFO L225 Difference]: With dead ends: 3008 [2019-10-15 01:23:57,619 INFO L226 Difference]: Without dead ends: 2022 [2019-10-15 01:23:57,623 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-15 01:23:57,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2022 states. [2019-10-15 01:23:57,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2022 to 1020. [2019-10-15 01:23:57,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2019-10-15 01:23:57,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1503 transitions. [2019-10-15 01:23:57,759 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1503 transitions. Word has length 157 [2019-10-15 01:23:57,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:57,760 INFO L462 AbstractCegarLoop]: Abstraction has 1020 states and 1503 transitions. [2019-10-15 01:23:57,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:57,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1503 transitions. [2019-10-15 01:23:57,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-15 01:23:57,765 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:57,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] [2019-10-15 01:23:57,766 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:57,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:57,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1516867775, now seen corresponding path program 1 times [2019-10-15 01:23:57,767 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:57,768 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287285957] [2019-10-15 01:23:57,768 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:57,768 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:57,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:57,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:57,954 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-15 01:23:57,955 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287285957] [2019-10-15 01:23:57,955 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:57,956 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:57,956 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247588704] [2019-10-15 01:23:57,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:57,957 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:57,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:57,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:57,958 INFO L87 Difference]: Start difference. First operand 1020 states and 1503 transitions. Second operand 3 states. [2019-10-15 01:23:58,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:58,108 INFO L93 Difference]: Finished difference Result 2789 states and 4120 transitions. [2019-10-15 01:23:58,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:58,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-10-15 01:23:58,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:58,120 INFO L225 Difference]: With dead ends: 2789 [2019-10-15 01:23:58,121 INFO L226 Difference]: Without dead ends: 1966 [2019-10-15 01:23:58,125 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-15 01:23:58,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1966 states. [2019-10-15 01:23:58,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1966 to 1964. [2019-10-15 01:23:58,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-10-15 01:23:58,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 2867 transitions. [2019-10-15 01:23:58,233 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 2867 transitions. Word has length 158 [2019-10-15 01:23:58,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:58,234 INFO L462 AbstractCegarLoop]: Abstraction has 1964 states and 2867 transitions. [2019-10-15 01:23:58,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:58,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 2867 transitions. [2019-10-15 01:23:58,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-15 01:23:58,238 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:58,238 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-15 01:23:58,239 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:58,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:58,239 INFO L82 PathProgramCache]: Analyzing trace with hash -2015367012, now seen corresponding path program 1 times [2019-10-15 01:23:58,239 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:58,240 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985239783] [2019-10-15 01:23:58,240 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:58,240 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:58,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:58,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:58,469 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-15 01:23:58,469 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985239783] [2019-10-15 01:23:58,469 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:58,470 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:58,470 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086397313] [2019-10-15 01:23:58,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:58,471 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:58,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:58,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:58,471 INFO L87 Difference]: Start difference. First operand 1964 states and 2867 transitions. Second operand 4 states. [2019-10-15 01:23:58,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:58,576 INFO L93 Difference]: Finished difference Result 3278 states and 4800 transitions. [2019-10-15 01:23:58,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:58,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-10-15 01:23:58,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:58,585 INFO L225 Difference]: With dead ends: 3278 [2019-10-15 01:23:58,585 INFO L226 Difference]: Without dead ends: 1499 [2019-10-15 01:23:58,589 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-15 01:23:58,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2019-10-15 01:23:58,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1499. [2019-10-15 01:23:58,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1499 states. [2019-10-15 01:23:58,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 2182 transitions. [2019-10-15 01:23:58,678 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 2182 transitions. Word has length 158 [2019-10-15 01:23:58,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:58,678 INFO L462 AbstractCegarLoop]: Abstraction has 1499 states and 2182 transitions. [2019-10-15 01:23:58,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:58,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 2182 transitions. [2019-10-15 01:23:58,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-15 01:23:58,684 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:58,684 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-15 01:23:58,685 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:58,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:58,685 INFO L82 PathProgramCache]: Analyzing trace with hash -528962491, now seen corresponding path program 1 times [2019-10-15 01:23:58,686 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:58,686 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859389535] [2019-10-15 01:23:58,686 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:58,687 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:58,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:58,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:58,787 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-15 01:23:58,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859389535] [2019-10-15 01:23:58,788 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:58,788 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:58,788 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834057131] [2019-10-15 01:23:58,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:58,789 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:58,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:58,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:58,790 INFO L87 Difference]: Start difference. First operand 1499 states and 2182 transitions. Second operand 3 states. [2019-10-15 01:23:58,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:58,965 INFO L93 Difference]: Finished difference Result 3290 states and 4921 transitions. [2019-10-15 01:23:58,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:58,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-10-15 01:23:58,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:58,976 INFO L225 Difference]: With dead ends: 3290 [2019-10-15 01:23:58,976 INFO L226 Difference]: Without dead ends: 1977 [2019-10-15 01:23:58,979 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-15 01:23:58,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2019-10-15 01:23:59,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1933. [2019-10-15 01:23:59,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1933 states. [2019-10-15 01:23:59,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1933 states to 1933 states and 2888 transitions. [2019-10-15 01:23:59,095 INFO L78 Accepts]: Start accepts. Automaton has 1933 states and 2888 transitions. Word has length 159 [2019-10-15 01:23:59,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:59,095 INFO L462 AbstractCegarLoop]: Abstraction has 1933 states and 2888 transitions. [2019-10-15 01:23:59,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:59,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1933 states and 2888 transitions. [2019-10-15 01:23:59,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-15 01:23:59,099 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:59,099 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] [2019-10-15 01:23:59,099 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:59,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:59,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1484207381, now seen corresponding path program 1 times [2019-10-15 01:23:59,100 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:59,100 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54179593] [2019-10-15 01:23:59,100 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:59,101 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:59,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:59,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:59,201 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-15 01:23:59,202 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54179593] [2019-10-15 01:23:59,202 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:59,202 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:59,202 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485385447] [2019-10-15 01:23:59,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:59,203 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:59,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:59,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:59,204 INFO L87 Difference]: Start difference. First operand 1933 states and 2888 transitions. Second operand 3 states. [2019-10-15 01:23:59,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:59,407 INFO L93 Difference]: Finished difference Result 4690 states and 7155 transitions. [2019-10-15 01:23:59,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:59,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-10-15 01:23:59,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:59,424 INFO L225 Difference]: With dead ends: 4690 [2019-10-15 01:23:59,425 INFO L226 Difference]: Without dead ends: 3027 [2019-10-15 01:23:59,429 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-15 01:23:59,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3027 states. [2019-10-15 01:23:59,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3027 to 2711. [2019-10-15 01:23:59,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2711 states. [2019-10-15 01:23:59,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 4151 transitions. [2019-10-15 01:23:59,662 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 4151 transitions. Word has length 162 [2019-10-15 01:23:59,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:59,663 INFO L462 AbstractCegarLoop]: Abstraction has 2711 states and 4151 transitions. [2019-10-15 01:23:59,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:59,663 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 4151 transitions. [2019-10-15 01:23:59,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-15 01:23:59,666 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:59,666 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] [2019-10-15 01:23:59,667 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:59,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:59,667 INFO L82 PathProgramCache]: Analyzing trace with hash 2071220188, now seen corresponding path program 1 times [2019-10-15 01:23:59,668 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:59,668 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650229750] [2019-10-15 01:23:59,668 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:59,668 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:59,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:59,983 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-15 01:23:59,983 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650229750] [2019-10-15 01:23:59,983 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:59,983 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:23:59,984 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867186524] [2019-10-15 01:23:59,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:23:59,984 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:59,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:23:59,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:23:59,985 INFO L87 Difference]: Start difference. First operand 2711 states and 4151 transitions. Second operand 9 states. [2019-10-15 01:24:01,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:01,286 INFO L93 Difference]: Finished difference Result 9554 states and 14922 transitions. [2019-10-15 01:24:01,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:24:01,287 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 162 [2019-10-15 01:24:01,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:01,328 INFO L225 Difference]: With dead ends: 9554 [2019-10-15 01:24:01,328 INFO L226 Difference]: Without dead ends: 7023 [2019-10-15 01:24:01,336 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:24:01,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7023 states. [2019-10-15 01:24:01,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7023 to 5089. [2019-10-15 01:24:01,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5089 states. [2019-10-15 01:24:01,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5089 states to 5089 states and 7829 transitions. [2019-10-15 01:24:01,851 INFO L78 Accepts]: Start accepts. Automaton has 5089 states and 7829 transitions. Word has length 162 [2019-10-15 01:24:01,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:01,852 INFO L462 AbstractCegarLoop]: Abstraction has 5089 states and 7829 transitions. [2019-10-15 01:24:01,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:24:01,852 INFO L276 IsEmpty]: Start isEmpty. Operand 5089 states and 7829 transitions. [2019-10-15 01:24:01,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-15 01:24:01,858 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:01,859 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] [2019-10-15 01:24:01,859 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:01,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:01,860 INFO L82 PathProgramCache]: Analyzing trace with hash 430958199, now seen corresponding path program 1 times [2019-10-15 01:24:01,860 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:01,861 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274915688] [2019-10-15 01:24:01,861 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:01,861 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:01,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:02,081 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-15 01:24:02,081 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274915688] [2019-10-15 01:24:02,083 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:02,083 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:02,083 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643720424] [2019-10-15 01:24:02,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:02,084 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:02,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:02,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:02,085 INFO L87 Difference]: Start difference. First operand 5089 states and 7829 transitions. Second operand 4 states. [2019-10-15 01:24:02,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:02,762 INFO L93 Difference]: Finished difference Result 13547 states and 21235 transitions. [2019-10-15 01:24:02,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:02,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-10-15 01:24:02,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:02,805 INFO L225 Difference]: With dead ends: 13547 [2019-10-15 01:24:02,805 INFO L226 Difference]: Without dead ends: 9797 [2019-10-15 01:24:02,814 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:02,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9797 states. [2019-10-15 01:24:03,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9797 to 9795. [2019-10-15 01:24:03,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9795 states. [2019-10-15 01:24:03,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9795 states to 9795 states and 15103 transitions. [2019-10-15 01:24:03,593 INFO L78 Accepts]: Start accepts. Automaton has 9795 states and 15103 transitions. Word has length 162 [2019-10-15 01:24:03,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:03,593 INFO L462 AbstractCegarLoop]: Abstraction has 9795 states and 15103 transitions. [2019-10-15 01:24:03,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:03,595 INFO L276 IsEmpty]: Start isEmpty. Operand 9795 states and 15103 transitions. [2019-10-15 01:24:03,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-15 01:24:03,603 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:03,603 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] [2019-10-15 01:24:03,603 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:03,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:03,604 INFO L82 PathProgramCache]: Analyzing trace with hash 169281566, now seen corresponding path program 1 times [2019-10-15 01:24:03,605 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:03,605 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639220328] [2019-10-15 01:24:03,605 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:03,605 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:03,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:03,822 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-15 01:24:03,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639220328] [2019-10-15 01:24:03,823 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:03,823 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:03,823 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075459211] [2019-10-15 01:24:03,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:03,824 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:03,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:03,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:03,825 INFO L87 Difference]: Start difference. First operand 9795 states and 15103 transitions. Second operand 4 states. [2019-10-15 01:24:04,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:04,760 INFO L93 Difference]: Finished difference Result 25746 states and 39693 transitions. [2019-10-15 01:24:04,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:04,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-10-15 01:24:04,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:04,797 INFO L225 Difference]: With dead ends: 25746 [2019-10-15 01:24:04,797 INFO L226 Difference]: Without dead ends: 15974 [2019-10-15 01:24:04,816 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-15 01:24:04,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15974 states. [2019-10-15 01:24:05,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15974 to 15972. [2019-10-15 01:24:05,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15972 states. [2019-10-15 01:24:05,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15972 states to 15972 states and 24436 transitions. [2019-10-15 01:24:05,769 INFO L78 Accepts]: Start accepts. Automaton has 15972 states and 24436 transitions. Word has length 162 [2019-10-15 01:24:05,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:05,770 INFO L462 AbstractCegarLoop]: Abstraction has 15972 states and 24436 transitions. [2019-10-15 01:24:05,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:05,770 INFO L276 IsEmpty]: Start isEmpty. Operand 15972 states and 24436 transitions. [2019-10-15 01:24:05,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-15 01:24:05,781 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:05,781 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-15 01:24:05,781 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:05,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:05,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1075293888, now seen corresponding path program 1 times [2019-10-15 01:24:05,782 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:05,782 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548389804] [2019-10-15 01:24:05,782 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:05,783 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:05,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:05,885 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-15 01:24:05,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548389804] [2019-10-15 01:24:05,885 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:05,886 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:24:05,886 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801374892] [2019-10-15 01:24:05,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:24:05,887 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:05,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:24:05,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:05,887 INFO L87 Difference]: Start difference. First operand 15972 states and 24436 transitions. Second operand 3 states. [2019-10-15 01:24:07,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:07,572 INFO L93 Difference]: Finished difference Result 43438 states and 66412 transitions. [2019-10-15 01:24:07,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:24:07,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-10-15 01:24:07,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:07,641 INFO L225 Difference]: With dead ends: 43438 [2019-10-15 01:24:07,642 INFO L226 Difference]: Without dead ends: 27862 [2019-10-15 01:24:07,677 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-15 01:24:07,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27862 states. [2019-10-15 01:24:09,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27862 to 27860. [2019-10-15 01:24:09,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27860 states. [2019-10-15 01:24:09,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27860 states to 27860 states and 42130 transitions. [2019-10-15 01:24:09,073 INFO L78 Accepts]: Start accepts. Automaton has 27860 states and 42130 transitions. Word has length 164 [2019-10-15 01:24:09,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:09,073 INFO L462 AbstractCegarLoop]: Abstraction has 27860 states and 42130 transitions. [2019-10-15 01:24:09,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:24:09,073 INFO L276 IsEmpty]: Start isEmpty. Operand 27860 states and 42130 transitions. [2019-10-15 01:24:09,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-15 01:24:09,092 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:09,092 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-15 01:24:09,093 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:09,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:09,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1992197475, now seen corresponding path program 1 times [2019-10-15 01:24:09,093 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:09,094 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528900930] [2019-10-15 01:24:09,094 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:09,094 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:09,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:09,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:09,236 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-15 01:24:09,236 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528900930] [2019-10-15 01:24:09,236 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:09,237 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:09,237 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358967058] [2019-10-15 01:24:09,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:09,238 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:09,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:09,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:09,238 INFO L87 Difference]: Start difference. First operand 27860 states and 42130 transitions. Second operand 4 states. [2019-10-15 01:24:10,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:10,632 INFO L93 Difference]: Finished difference Result 46369 states and 70138 transitions. [2019-10-15 01:24:10,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:10,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-10-15 01:24:10,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:10,674 INFO L225 Difference]: With dead ends: 46369 [2019-10-15 01:24:10,674 INFO L226 Difference]: Without dead ends: 24890 [2019-10-15 01:24:10,716 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-15 01:24:10,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24890 states. [2019-10-15 01:24:12,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24890 to 24890. [2019-10-15 01:24:12,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24890 states. [2019-10-15 01:24:12,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24890 states to 24890 states and 37611 transitions. [2019-10-15 01:24:12,478 INFO L78 Accepts]: Start accepts. Automaton has 24890 states and 37611 transitions. Word has length 164 [2019-10-15 01:24:12,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:12,478 INFO L462 AbstractCegarLoop]: Abstraction has 24890 states and 37611 transitions. [2019-10-15 01:24:12,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:12,478 INFO L276 IsEmpty]: Start isEmpty. Operand 24890 states and 37611 transitions. [2019-10-15 01:24:12,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-15 01:24:12,492 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:12,492 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] [2019-10-15 01:24:12,492 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:12,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:12,493 INFO L82 PathProgramCache]: Analyzing trace with hash 914961264, now seen corresponding path program 1 times [2019-10-15 01:24:12,493 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:12,493 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570450621] [2019-10-15 01:24:12,493 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:12,493 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:12,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:12,573 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-15 01:24:12,574 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570450621] [2019-10-15 01:24:12,574 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:12,574 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:24:12,574 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204749764] [2019-10-15 01:24:12,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:24:12,575 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:12,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:24:12,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:12,576 INFO L87 Difference]: Start difference. First operand 24890 states and 37611 transitions. Second operand 3 states. [2019-10-15 01:24:14,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:14,511 INFO L93 Difference]: Finished difference Result 67686 states and 103354 transitions. [2019-10-15 01:24:14,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:24:14,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-10-15 01:24:14,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:14,604 INFO L225 Difference]: With dead ends: 67686 [2019-10-15 01:24:14,604 INFO L226 Difference]: Without dead ends: 43132 [2019-10-15 01:24:14,636 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-15 01:24:14,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43132 states. [2019-10-15 01:24:16,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43132 to 38738. [2019-10-15 01:24:16,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38738 states. [2019-10-15 01:24:16,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38738 states to 38738 states and 59682 transitions. [2019-10-15 01:24:16,218 INFO L78 Accepts]: Start accepts. Automaton has 38738 states and 59682 transitions. Word has length 168 [2019-10-15 01:24:16,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:16,219 INFO L462 AbstractCegarLoop]: Abstraction has 38738 states and 59682 transitions. [2019-10-15 01:24:16,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:24:16,219 INFO L276 IsEmpty]: Start isEmpty. Operand 38738 states and 59682 transitions. [2019-10-15 01:24:16,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-15 01:24:16,230 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:16,230 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] [2019-10-15 01:24:16,231 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:16,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:16,231 INFO L82 PathProgramCache]: Analyzing trace with hash -808861162, now seen corresponding path program 1 times [2019-10-15 01:24:16,231 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:16,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220799033] [2019-10-15 01:24:16,232 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:16,232 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:16,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:16,452 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-15 01:24:16,452 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220799033] [2019-10-15 01:24:16,452 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:16,452 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:24:16,453 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753636701] [2019-10-15 01:24:16,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:24:16,453 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:16,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:24:16,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:24:16,454 INFO L87 Difference]: Start difference. First operand 38738 states and 59682 transitions. Second operand 9 states. [2019-10-15 01:24:24,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:24,773 INFO L93 Difference]: Finished difference Result 185670 states and 287874 transitions. [2019-10-15 01:24:24,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 01:24:24,778 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 168 [2019-10-15 01:24:24,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:25,005 INFO L225 Difference]: With dead ends: 185670 [2019-10-15 01:24:25,005 INFO L226 Difference]: Without dead ends: 147342 [2019-10-15 01:24:25,056 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:24:25,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147342 states.