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_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:22:49,451 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:22:49,455 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:22:49,474 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:22:49,475 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:22:49,477 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:22:49,479 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:22:49,486 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:22:49,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:22:49,489 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:22:49,491 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:22:49,493 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:22:49,493 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:22:49,494 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:22:49,495 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:22:49,496 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:22:49,497 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:22:49,498 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:22:49,500 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:22:49,502 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:22:49,503 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:22:49,504 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:22:49,506 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:22:49,506 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:22:49,509 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:22:49,509 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:22:49,509 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:22:49,510 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:22:49,511 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:22:49,512 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:22:49,512 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:22:49,513 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:22:49,513 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:22:49,514 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:22:49,515 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:22:49,515 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:22:49,516 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:22:49,516 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:22:49,517 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:22:49,517 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:22:49,518 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:22:49,519 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:22:49,534 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:22:49,534 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:22:49,535 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:22:49,536 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:22:49,536 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:22:49,536 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:22:49,536 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:22:49,536 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:22:49,537 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:22:49,537 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:22:49,537 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:22:49,537 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:22:49,537 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:22:49,538 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:22:49,538 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:22:49,538 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:22:49,538 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:22:49,539 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:22:49,539 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:22:49,539 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:22:49,539 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:22:49,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:22:49,540 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:22:49,540 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:22:49,540 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:22:49,540 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:22:49,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:22:49,541 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:22:49,541 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:22:49,842 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:22:49,864 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:22:49,868 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:22:49,870 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:22:49,870 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:22:49,871 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-15 01:22:49,949 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25aa3b948/77c8261bfb37460c9c847ce5bc426e74/FLAGbe00d5c9d [2019-10-15 01:22:50,555 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:22:50,556 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-15 01:22:50,576 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25aa3b948/77c8261bfb37460c9c847ce5bc426e74/FLAGbe00d5c9d [2019-10-15 01:22:50,804 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25aa3b948/77c8261bfb37460c9c847ce5bc426e74 [2019-10-15 01:22:50,815 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:22:50,817 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:22:50,818 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:22:50,818 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:22:50,821 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:22:50,822 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:22:50" (1/1) ... [2019-10-15 01:22:50,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2539de21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:50, skipping insertion in model container [2019-10-15 01:22:50,826 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:22:50" (1/1) ... [2019-10-15 01:22:50,833 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:22:50,905 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:22:51,465 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:22:51,480 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:22:51,640 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:22:51,662 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:22:51,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:51 WrapperNode [2019-10-15 01:22:51,663 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:22:51,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:22:51,664 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:22:51,664 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:22:51,681 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:51" (1/1) ... [2019-10-15 01:22:51,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:51" (1/1) ... [2019-10-15 01:22:51,704 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:51" (1/1) ... [2019-10-15 01:22:51,705 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:51" (1/1) ... [2019-10-15 01:22:51,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:51" (1/1) ... [2019-10-15 01:22:51,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:51" (1/1) ... [2019-10-15 01:22:51,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:51" (1/1) ... [2019-10-15 01:22:51,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:22:51,806 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:22:51,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:22:51,806 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:22:51,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:51" (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:22:51,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:22:51,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:22:51,882 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:22:51,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:22:51,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:22:51,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 01:22:51,883 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 01:22:51,884 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:22:51,884 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 01:22:51,885 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 01:22:51,885 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 01:22:51,885 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 01:22:51,885 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 01:22:51,886 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 01:22:51,887 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 01:22:51,887 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:22:51,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:22:51,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:22:53,445 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:22:53,446 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 01:22:53,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:22:53 BoogieIcfgContainer [2019-10-15 01:22:53,449 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:22:53,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:22:53,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:22:53,455 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:22:53,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:22:50" (1/3) ... [2019-10-15 01:22:53,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a614eb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:22:53, skipping insertion in model container [2019-10-15 01:22:53,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:51" (2/3) ... [2019-10-15 01:22:53,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a614eb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:22:53, skipping insertion in model container [2019-10-15 01:22:53,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:22:53" (3/3) ... [2019-10-15 01:22:53,464 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-15 01:22:53,476 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:22:53,500 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:22:53,511 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:22:53,540 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:22:53,540 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:22:53,540 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:22:53,540 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:22:53,540 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:22:53,540 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:22:53,541 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:22:53,541 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:22:53,569 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states. [2019-10-15 01:22:53,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-15 01:22:53,584 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:53,586 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] [2019-10-15 01:22:53,587 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:53,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:53,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1545579630, now seen corresponding path program 1 times [2019-10-15 01:22:53,599 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:53,600 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496364532] [2019-10-15 01:22:53,600 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:53,600 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:53,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:53,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:54,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:54,259 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496364532] [2019-10-15 01:22:54,260 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:54,261 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:54,261 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004057699] [2019-10-15 01:22:54,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:54,268 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:54,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:54,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:54,287 INFO L87 Difference]: Start difference. First operand 299 states. Second operand 3 states. [2019-10-15 01:22:54,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:54,521 INFO L93 Difference]: Finished difference Result 569 states and 997 transitions. [2019-10-15 01:22:54,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:54,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-10-15 01:22:54,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:54,555 INFO L225 Difference]: With dead ends: 569 [2019-10-15 01:22:54,556 INFO L226 Difference]: Without dead ends: 465 [2019-10-15 01:22:54,561 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:22:54,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-10-15 01:22:54,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 463. [2019-10-15 01:22:54,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-10-15 01:22:54,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 686 transitions. [2019-10-15 01:22:54,652 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 686 transitions. Word has length 145 [2019-10-15 01:22:54,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:54,653 INFO L462 AbstractCegarLoop]: Abstraction has 463 states and 686 transitions. [2019-10-15 01:22:54,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:54,653 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 686 transitions. [2019-10-15 01:22:54,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-15 01:22:54,658 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:54,658 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] [2019-10-15 01:22:54,658 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:54,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:54,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1852792009, now seen corresponding path program 1 times [2019-10-15 01:22:54,659 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:54,660 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937644618] [2019-10-15 01:22:54,660 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:54,660 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:54,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:55,126 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:22:55,126 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937644618] [2019-10-15 01:22:55,127 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:55,127 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:55,127 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327732575] [2019-10-15 01:22:55,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:55,130 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:55,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:55,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:55,131 INFO L87 Difference]: Start difference. First operand 463 states and 686 transitions. Second operand 4 states. [2019-10-15 01:22:55,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:55,265 INFO L93 Difference]: Finished difference Result 1349 states and 1997 transitions. [2019-10-15 01:22:55,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:55,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-10-15 01:22:55,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:55,272 INFO L225 Difference]: With dead ends: 1349 [2019-10-15 01:22:55,272 INFO L226 Difference]: Without dead ends: 899 [2019-10-15 01:22:55,276 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:22:55,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2019-10-15 01:22:55,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 897. [2019-10-15 01:22:55,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 897 states. [2019-10-15 01:22:55,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1319 transitions. [2019-10-15 01:22:55,338 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1319 transitions. Word has length 145 [2019-10-15 01:22:55,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:55,339 INFO L462 AbstractCegarLoop]: Abstraction has 897 states and 1319 transitions. [2019-10-15 01:22:55,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:55,339 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1319 transitions. [2019-10-15 01:22:55,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-15 01:22:55,344 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:55,344 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] [2019-10-15 01:22:55,344 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:55,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:55,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1132437897, now seen corresponding path program 1 times [2019-10-15 01:22:55,345 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:55,345 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353938592] [2019-10-15 01:22:55,346 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:55,346 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:55,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:55,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:55,490 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:22:55,491 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353938592] [2019-10-15 01:22:55,492 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:55,492 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:55,493 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835188147] [2019-10-15 01:22:55,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:55,494 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:55,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:55,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:55,494 INFO L87 Difference]: Start difference. First operand 897 states and 1319 transitions. Second operand 3 states. [2019-10-15 01:22:55,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:55,583 INFO L93 Difference]: Finished difference Result 2645 states and 3887 transitions. [2019-10-15 01:22:55,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:55,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-10-15 01:22:55,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:55,597 INFO L225 Difference]: With dead ends: 2645 [2019-10-15 01:22:55,598 INFO L226 Difference]: Without dead ends: 1780 [2019-10-15 01:22:55,601 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:22:55,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1780 states. [2019-10-15 01:22:55,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 899. [2019-10-15 01:22:55,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2019-10-15 01:22:55,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1321 transitions. [2019-10-15 01:22:55,667 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1321 transitions. Word has length 146 [2019-10-15 01:22:55,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:55,668 INFO L462 AbstractCegarLoop]: Abstraction has 899 states and 1321 transitions. [2019-10-15 01:22:55,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:55,668 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1321 transitions. [2019-10-15 01:22:55,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-15 01:22:55,672 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:55,672 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] [2019-10-15 01:22:55,672 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:55,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:55,673 INFO L82 PathProgramCache]: Analyzing trace with hash 18878169, now seen corresponding path program 1 times [2019-10-15 01:22:55,673 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:55,673 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453194713] [2019-10-15 01:22:55,674 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:55,674 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:55,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:55,803 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:22:55,803 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453194713] [2019-10-15 01:22:55,803 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:55,804 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:55,804 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754624652] [2019-10-15 01:22:55,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:55,805 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:55,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:55,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:55,805 INFO L87 Difference]: Start difference. First operand 899 states and 1321 transitions. Second operand 3 states. [2019-10-15 01:22:56,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:56,012 INFO L93 Difference]: Finished difference Result 2451 states and 3620 transitions. [2019-10-15 01:22:56,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:56,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-10-15 01:22:56,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:56,025 INFO L225 Difference]: With dead ends: 2451 [2019-10-15 01:22:56,026 INFO L226 Difference]: Without dead ends: 1734 [2019-10-15 01:22:56,028 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:22:56,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-10-15 01:22:56,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1732. [2019-10-15 01:22:56,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1732 states. [2019-10-15 01:22:56,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 2523 transitions. [2019-10-15 01:22:56,168 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 2523 transitions. Word has length 147 [2019-10-15 01:22:56,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:56,168 INFO L462 AbstractCegarLoop]: Abstraction has 1732 states and 2523 transitions. [2019-10-15 01:22:56,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:56,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2523 transitions. [2019-10-15 01:22:56,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-15 01:22:56,176 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:56,176 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] [2019-10-15 01:22:56,176 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:56,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:56,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1632040732, now seen corresponding path program 1 times [2019-10-15 01:22:56,178 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:56,178 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368819668] [2019-10-15 01:22:56,178 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:56,178 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:56,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:56,440 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:22:56,441 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368819668] [2019-10-15 01:22:56,442 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:56,442 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:56,442 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597366263] [2019-10-15 01:22:56,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:56,444 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:56,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:56,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:56,445 INFO L87 Difference]: Start difference. First operand 1732 states and 2523 transitions. Second operand 4 states. [2019-10-15 01:22:56,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:56,596 INFO L93 Difference]: Finished difference Result 2881 states and 4212 transitions. [2019-10-15 01:22:56,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:56,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-10-15 01:22:56,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:56,606 INFO L225 Difference]: With dead ends: 2881 [2019-10-15 01:22:56,607 INFO L226 Difference]: Without dead ends: 1321 [2019-10-15 01:22:56,611 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:22:56,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2019-10-15 01:22:56,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1321. [2019-10-15 01:22:56,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1321 states. [2019-10-15 01:22:56,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1916 transitions. [2019-10-15 01:22:56,709 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1916 transitions. Word has length 147 [2019-10-15 01:22:56,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:56,711 INFO L462 AbstractCegarLoop]: Abstraction has 1321 states and 1916 transitions. [2019-10-15 01:22:56,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:56,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1916 transitions. [2019-10-15 01:22:56,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:22:56,716 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:56,716 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] [2019-10-15 01:22:56,716 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:56,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:56,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1705432715, now seen corresponding path program 1 times [2019-10-15 01:22:56,717 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:56,718 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584129395] [2019-10-15 01:22:56,718 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:56,718 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:56,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:56,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:56,996 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:22:56,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584129395] [2019-10-15 01:22:56,998 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:56,998 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:22:56,999 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583627778] [2019-10-15 01:22:56,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:22:57,000 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:57,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:22:57,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:22:57,001 INFO L87 Difference]: Start difference. First operand 1321 states and 1916 transitions. Second operand 8 states. [2019-10-15 01:22:58,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:58,018 INFO L93 Difference]: Finished difference Result 3867 states and 5900 transitions. [2019-10-15 01:22:58,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 01:22:58,019 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 150 [2019-10-15 01:22:58,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:58,042 INFO L225 Difference]: With dead ends: 3867 [2019-10-15 01:22:58,046 INFO L226 Difference]: Without dead ends: 2751 [2019-10-15 01:22:58,052 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-15 01:22:58,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2751 states. [2019-10-15 01:22:58,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2751 to 1652. [2019-10-15 01:22:58,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1652 states. [2019-10-15 01:22:58,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 2413 transitions. [2019-10-15 01:22:58,210 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 2413 transitions. Word has length 150 [2019-10-15 01:22:58,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:58,211 INFO L462 AbstractCegarLoop]: Abstraction has 1652 states and 2413 transitions. [2019-10-15 01:22:58,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:22:58,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 2413 transitions. [2019-10-15 01:22:58,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:22:58,215 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:58,215 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] [2019-10-15 01:22:58,216 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:58,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:58,216 INFO L82 PathProgramCache]: Analyzing trace with hash -912214424, now seen corresponding path program 1 times [2019-10-15 01:22:58,217 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:58,217 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659779333] [2019-10-15 01:22:58,217 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:58,217 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:58,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:58,466 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:22:58,466 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659779333] [2019-10-15 01:22:58,467 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:58,467 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:58,467 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795364914] [2019-10-15 01:22:58,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:58,468 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:58,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:58,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:58,469 INFO L87 Difference]: Start difference. First operand 1652 states and 2413 transitions. Second operand 4 states. [2019-10-15 01:22:58,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:58,837 INFO L93 Difference]: Finished difference Result 4332 states and 6340 transitions. [2019-10-15 01:22:58,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:58,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-10-15 01:22:58,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:58,858 INFO L225 Difference]: With dead ends: 4332 [2019-10-15 01:22:58,859 INFO L226 Difference]: Without dead ends: 2703 [2019-10-15 01:22:58,865 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:22:58,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2703 states. [2019-10-15 01:22:59,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2703 to 2701. [2019-10-15 01:22:59,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2701 states. [2019-10-15 01:22:59,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2701 states to 2701 states and 3924 transitions. [2019-10-15 01:22:59,310 INFO L78 Accepts]: Start accepts. Automaton has 2701 states and 3924 transitions. Word has length 150 [2019-10-15 01:22:59,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:59,311 INFO L462 AbstractCegarLoop]: Abstraction has 2701 states and 3924 transitions. [2019-10-15 01:22:59,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:59,311 INFO L276 IsEmpty]: Start isEmpty. Operand 2701 states and 3924 transitions. [2019-10-15 01:22:59,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-15 01:22:59,316 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:59,316 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] [2019-10-15 01:22:59,317 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:59,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:59,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1681251574, now seen corresponding path program 1 times [2019-10-15 01:22:59,317 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:59,317 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596745473] [2019-10-15 01:22:59,318 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:59,318 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:59,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:59,439 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:22:59,440 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596745473] [2019-10-15 01:22:59,440 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:59,440 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:59,440 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116637462] [2019-10-15 01:22:59,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:59,441 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:59,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:59,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:59,442 INFO L87 Difference]: Start difference. First operand 2701 states and 3924 transitions. Second operand 3 states. [2019-10-15 01:22:59,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:59,882 INFO L93 Difference]: Finished difference Result 7038 states and 10298 transitions. [2019-10-15 01:22:59,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:59,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-10-15 01:22:59,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:59,909 INFO L225 Difference]: With dead ends: 7038 [2019-10-15 01:22:59,910 INFO L226 Difference]: Without dead ends: 4666 [2019-10-15 01:22:59,918 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:22:59,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4666 states. [2019-10-15 01:23:00,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4666 to 4664. [2019-10-15 01:23:00,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4664 states. [2019-10-15 01:23:00,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4664 states to 4664 states and 6720 transitions. [2019-10-15 01:23:00,300 INFO L78 Accepts]: Start accepts. Automaton has 4664 states and 6720 transitions. Word has length 152 [2019-10-15 01:23:00,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:00,300 INFO L462 AbstractCegarLoop]: Abstraction has 4664 states and 6720 transitions. [2019-10-15 01:23:00,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:00,301 INFO L276 IsEmpty]: Start isEmpty. Operand 4664 states and 6720 transitions. [2019-10-15 01:23:00,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-15 01:23:00,310 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:00,310 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] [2019-10-15 01:23:00,310 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:00,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:00,311 INFO L82 PathProgramCache]: Analyzing trace with hash -344412185, now seen corresponding path program 1 times [2019-10-15 01:23:00,311 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:00,311 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200560685] [2019-10-15 01:23:00,311 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:00,312 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:00,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:00,478 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:00,479 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200560685] [2019-10-15 01:23:00,479 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:00,481 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:00,483 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227469272] [2019-10-15 01:23:00,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:00,484 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:00,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:00,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:00,485 INFO L87 Difference]: Start difference. First operand 4664 states and 6720 transitions. Second operand 4 states. [2019-10-15 01:23:00,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:00,912 INFO L93 Difference]: Finished difference Result 7769 states and 11256 transitions. [2019-10-15 01:23:00,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:00,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-10-15 01:23:00,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:00,934 INFO L225 Difference]: With dead ends: 7769 [2019-10-15 01:23:00,935 INFO L226 Difference]: Without dead ends: 4098 [2019-10-15 01:23:00,942 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:00,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2019-10-15 01:23:01,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 4098. [2019-10-15 01:23:01,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2019-10-15 01:23:01,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 5895 transitions. [2019-10-15 01:23:01,293 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 5895 transitions. Word has length 152 [2019-10-15 01:23:01,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:01,293 INFO L462 AbstractCegarLoop]: Abstraction has 4098 states and 5895 transitions. [2019-10-15 01:23:01,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:01,295 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 5895 transitions. [2019-10-15 01:23:01,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-15 01:23:01,302 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:01,302 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] [2019-10-15 01:23:01,302 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:01,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:01,303 INFO L82 PathProgramCache]: Analyzing trace with hash 71132805, now seen corresponding path program 1 times [2019-10-15 01:23:01,304 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:01,304 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295241563] [2019-10-15 01:23:01,304 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:01,304 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:01,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:01,417 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:01,418 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295241563] [2019-10-15 01:23:01,419 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:01,419 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:01,419 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739214205] [2019-10-15 01:23:01,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:01,421 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:01,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:01,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:01,422 INFO L87 Difference]: Start difference. First operand 4098 states and 5895 transitions. Second operand 3 states. [2019-10-15 01:23:02,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:02,151 INFO L93 Difference]: Finished difference Result 10865 states and 15855 transitions. [2019-10-15 01:23:02,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:02,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-10-15 01:23:02,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:02,210 INFO L225 Difference]: With dead ends: 10865 [2019-10-15 01:23:02,211 INFO L226 Difference]: Without dead ends: 7902 [2019-10-15 01:23:02,224 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:02,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7902 states. [2019-10-15 01:23:02,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7902 to 7900. [2019-10-15 01:23:02,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7900 states. [2019-10-15 01:23:02,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 11351 transitions. [2019-10-15 01:23:02,797 INFO L78 Accepts]: Start accepts. Automaton has 7900 states and 11351 transitions. Word has length 155 [2019-10-15 01:23:02,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:02,797 INFO L462 AbstractCegarLoop]: Abstraction has 7900 states and 11351 transitions. [2019-10-15 01:23:02,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:02,798 INFO L276 IsEmpty]: Start isEmpty. Operand 7900 states and 11351 transitions. [2019-10-15 01:23:02,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-15 01:23:02,813 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:02,814 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] [2019-10-15 01:23:02,814 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:02,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:02,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1126763328, now seen corresponding path program 1 times [2019-10-15 01:23:02,815 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:02,815 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033755269] [2019-10-15 01:23:02,816 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:02,816 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:02,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:03,169 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:03,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033755269] [2019-10-15 01:23:03,169 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:03,170 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:03,170 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146203963] [2019-10-15 01:23:03,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:03,171 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:03,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:03,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:03,171 INFO L87 Difference]: Start difference. First operand 7900 states and 11351 transitions. Second operand 4 states. [2019-10-15 01:23:04,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:04,041 INFO L93 Difference]: Finished difference Result 23082 states and 33193 transitions. [2019-10-15 01:23:04,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:04,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-10-15 01:23:04,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:04,077 INFO L225 Difference]: With dead ends: 23082 [2019-10-15 01:23:04,077 INFO L226 Difference]: Without dead ends: 15225 [2019-10-15 01:23:04,095 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:04,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15225 states. [2019-10-15 01:23:05,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15225 to 15223. [2019-10-15 01:23:05,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15223 states. [2019-10-15 01:23:05,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15223 states to 15223 states and 21696 transitions. [2019-10-15 01:23:05,198 INFO L78 Accepts]: Start accepts. Automaton has 15223 states and 21696 transitions. Word has length 155 [2019-10-15 01:23:05,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:05,199 INFO L462 AbstractCegarLoop]: Abstraction has 15223 states and 21696 transitions. [2019-10-15 01:23:05,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:05,199 INFO L276 IsEmpty]: Start isEmpty. Operand 15223 states and 21696 transitions. [2019-10-15 01:23:05,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-15 01:23:05,221 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:05,221 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:05,221 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:05,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:05,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1208295678, now seen corresponding path program 1 times [2019-10-15 01:23:05,222 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:05,222 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334468012] [2019-10-15 01:23:05,222 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:05,222 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:05,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:05,284 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:05,284 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334468012] [2019-10-15 01:23:05,284 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:05,285 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:05,285 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204164146] [2019-10-15 01:23:05,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:05,286 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:05,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:05,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:05,286 INFO L87 Difference]: Start difference. First operand 15223 states and 21696 transitions. Second operand 3 states. [2019-10-15 01:23:06,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:06,918 INFO L93 Difference]: Finished difference Result 45469 states and 64831 transitions. [2019-10-15 01:23:06,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:06,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-10-15 01:23:06,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:07,002 INFO L225 Difference]: With dead ends: 45469 [2019-10-15 01:23:07,003 INFO L226 Difference]: Without dead ends: 30355 [2019-10-15 01:23:07,041 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:07,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30355 states. [2019-10-15 01:23:08,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30355 to 15229. [2019-10-15 01:23:08,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15229 states. [2019-10-15 01:23:08,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15229 states to 15229 states and 21702 transitions. [2019-10-15 01:23:08,209 INFO L78 Accepts]: Start accepts. Automaton has 15229 states and 21702 transitions. Word has length 156 [2019-10-15 01:23:08,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:08,209 INFO L462 AbstractCegarLoop]: Abstraction has 15229 states and 21702 transitions. [2019-10-15 01:23:08,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:08,209 INFO L276 IsEmpty]: Start isEmpty. Operand 15229 states and 21702 transitions. [2019-10-15 01:23:08,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-15 01:23:08,226 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:08,227 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:08,227 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:08,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:08,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1010309857, now seen corresponding path program 1 times [2019-10-15 01:23:08,228 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:08,228 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313444337] [2019-10-15 01:23:08,228 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:08,228 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:08,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:08,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:08,369 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:08,369 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313444337] [2019-10-15 01:23:08,370 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:08,370 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:08,370 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658213262] [2019-10-15 01:23:08,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:08,371 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:08,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:08,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:08,372 INFO L87 Difference]: Start difference. First operand 15229 states and 21702 transitions. Second operand 4 states. [2019-10-15 01:23:09,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:09,401 INFO L93 Difference]: Finished difference Result 30416 states and 43348 transitions. [2019-10-15 01:23:09,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:09,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-10-15 01:23:09,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:09,428 INFO L225 Difference]: With dead ends: 30416 [2019-10-15 01:23:09,428 INFO L226 Difference]: Without dead ends: 15223 [2019-10-15 01:23:09,456 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:09,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15223 states. [2019-10-15 01:23:10,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15223 to 15223. [2019-10-15 01:23:10,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15223 states. [2019-10-15 01:23:10,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15223 states to 15223 states and 21690 transitions. [2019-10-15 01:23:10,399 INFO L78 Accepts]: Start accepts. Automaton has 15223 states and 21690 transitions. Word has length 157 [2019-10-15 01:23:10,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:10,400 INFO L462 AbstractCegarLoop]: Abstraction has 15223 states and 21690 transitions. [2019-10-15 01:23:10,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:10,400 INFO L276 IsEmpty]: Start isEmpty. Operand 15223 states and 21690 transitions. [2019-10-15 01:23:10,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-15 01:23:10,414 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:10,415 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:10,415 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:10,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:10,415 INFO L82 PathProgramCache]: Analyzing trace with hash -702669460, now seen corresponding path program 1 times [2019-10-15 01:23:10,416 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:10,416 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889270027] [2019-10-15 01:23:10,416 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:10,416 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:10,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:10,616 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:10,617 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889270027] [2019-10-15 01:23:10,617 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:10,617 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:10,617 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931930351] [2019-10-15 01:23:10,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:10,618 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:10,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:10,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:10,618 INFO L87 Difference]: Start difference. First operand 15223 states and 21690 transitions. Second operand 3 states. [2019-10-15 01:23:11,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:11,669 INFO L93 Difference]: Finished difference Result 36857 states and 52495 transitions. [2019-10-15 01:23:11,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:11,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-10-15 01:23:11,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:11,708 INFO L225 Difference]: With dead ends: 36857 [2019-10-15 01:23:11,709 INFO L226 Difference]: Without dead ends: 22575 [2019-10-15 01:23:11,739 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:11,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22575 states. [2019-10-15 01:23:12,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22575 to 22573. [2019-10-15 01:23:12,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22573 states. [2019-10-15 01:23:12,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22573 states to 22573 states and 31549 transitions. [2019-10-15 01:23:12,948 INFO L78 Accepts]: Start accepts. Automaton has 22573 states and 31549 transitions. Word has length 157 [2019-10-15 01:23:12,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:12,948 INFO L462 AbstractCegarLoop]: Abstraction has 22573 states and 31549 transitions. [2019-10-15 01:23:12,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:12,949 INFO L276 IsEmpty]: Start isEmpty. Operand 22573 states and 31549 transitions. [2019-10-15 01:23:12,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-15 01:23:12,963 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:12,963 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-15 01:23:12,964 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:12,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:12,964 INFO L82 PathProgramCache]: Analyzing trace with hash 586917850, now seen corresponding path program 1 times [2019-10-15 01:23:12,964 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:12,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006358602] [2019-10-15 01:23:12,965 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:12,965 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:12,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:13,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:13,181 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006358602] [2019-10-15 01:23:13,181 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:13,181 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:13,181 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030953152] [2019-10-15 01:23:13,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:13,182 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:13,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:13,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:13,183 INFO L87 Difference]: Start difference. First operand 22573 states and 31549 transitions. Second operand 4 states. [2019-10-15 01:23:14,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:14,852 INFO L93 Difference]: Finished difference Result 42369 states and 59188 transitions. [2019-10-15 01:23:14,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:14,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-10-15 01:23:14,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:14,876 INFO L225 Difference]: With dead ends: 42369 [2019-10-15 01:23:14,876 INFO L226 Difference]: Without dead ends: 20147 [2019-10-15 01:23:14,894 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:14,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20147 states. [2019-10-15 01:23:15,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20147 to 20078. [2019-10-15 01:23:15,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20078 states. [2019-10-15 01:23:15,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20078 states to 20078 states and 27953 transitions. [2019-10-15 01:23:15,952 INFO L78 Accepts]: Start accepts. Automaton has 20078 states and 27953 transitions. Word has length 163 [2019-10-15 01:23:15,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:15,953 INFO L462 AbstractCegarLoop]: Abstraction has 20078 states and 27953 transitions. [2019-10-15 01:23:15,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:15,953 INFO L276 IsEmpty]: Start isEmpty. Operand 20078 states and 27953 transitions. [2019-10-15 01:23:15,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-15 01:23:15,963 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:15,964 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] [2019-10-15 01:23:15,964 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:15,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:15,964 INFO L82 PathProgramCache]: Analyzing trace with hash 330827924, now seen corresponding path program 1 times [2019-10-15 01:23:15,964 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:15,964 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403877557] [2019-10-15 01:23:15,965 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:15,965 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:15,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:16,161 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:16,161 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403877557] [2019-10-15 01:23:16,161 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:16,162 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:16,162 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731715192] [2019-10-15 01:23:16,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:16,163 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:16,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:16,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:16,163 INFO L87 Difference]: Start difference. First operand 20078 states and 27953 transitions. Second operand 4 states. [2019-10-15 01:23:17,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:17,303 INFO L93 Difference]: Finished difference Result 40252 states and 56019 transitions. [2019-10-15 01:23:17,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:17,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-10-15 01:23:17,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:17,332 INFO L225 Difference]: With dead ends: 40252 [2019-10-15 01:23:17,333 INFO L226 Difference]: Without dead ends: 20329 [2019-10-15 01:23:17,357 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:17,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20329 states. [2019-10-15 01:23:18,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20329 to 20223. [2019-10-15 01:23:18,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20223 states. [2019-10-15 01:23:18,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20223 states to 20223 states and 28107 transitions. [2019-10-15 01:23:18,655 INFO L78 Accepts]: Start accepts. Automaton has 20223 states and 28107 transitions. Word has length 165 [2019-10-15 01:23:18,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:18,655 INFO L462 AbstractCegarLoop]: Abstraction has 20223 states and 28107 transitions. [2019-10-15 01:23:18,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:18,656 INFO L276 IsEmpty]: Start isEmpty. Operand 20223 states and 28107 transitions. [2019-10-15 01:23:18,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-15 01:23:18,667 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:18,668 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-15 01:23:18,668 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:18,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:18,668 INFO L82 PathProgramCache]: Analyzing trace with hash 721201180, now seen corresponding path program 1 times [2019-10-15 01:23:18,669 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:18,669 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668626499] [2019-10-15 01:23:18,669 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:18,669 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:18,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:18,740 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:18,741 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668626499] [2019-10-15 01:23:18,741 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:18,741 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:18,741 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068747438] [2019-10-15 01:23:18,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:18,742 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:18,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:18,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:18,743 INFO L87 Difference]: Start difference. First operand 20223 states and 28107 transitions. Second operand 3 states. [2019-10-15 01:23:20,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:20,679 INFO L93 Difference]: Finished difference Result 55040 states and 76650 transitions. [2019-10-15 01:23:20,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:20,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-10-15 01:23:20,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:20,727 INFO L225 Difference]: With dead ends: 55040 [2019-10-15 01:23:20,727 INFO L226 Difference]: Without dead ends: 40241 [2019-10-15 01:23:20,744 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:20,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40241 states. [2019-10-15 01:23:22,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40241 to 20233. [2019-10-15 01:23:22,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20233 states. [2019-10-15 01:23:22,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20233 states to 20233 states and 28117 transitions. [2019-10-15 01:23:22,871 INFO L78 Accepts]: Start accepts. Automaton has 20233 states and 28117 transitions. Word has length 166 [2019-10-15 01:23:22,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:22,872 INFO L462 AbstractCegarLoop]: Abstraction has 20233 states and 28117 transitions. [2019-10-15 01:23:22,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:22,872 INFO L276 IsEmpty]: Start isEmpty. Operand 20233 states and 28117 transitions. [2019-10-15 01:23:22,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-15 01:23:22,882 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:22,882 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] [2019-10-15 01:23:22,883 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:22,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:22,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1747659725, now seen corresponding path program 1 times [2019-10-15 01:23:22,883 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:22,883 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542838476] [2019-10-15 01:23:22,883 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:22,883 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:22,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:23,027 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:23,028 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542838476] [2019-10-15 01:23:23,028 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:23,028 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:23,028 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039877872] [2019-10-15 01:23:23,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:23,029 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:23,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:23,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:23,030 INFO L87 Difference]: Start difference. First operand 20233 states and 28117 transitions. Second operand 4 states.