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.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:22:51,055 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:22:51,058 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:22:51,073 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:22:51,073 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:22:51,074 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:22:51,076 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:22:51,077 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:22:51,079 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:22:51,080 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:22:51,081 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:22:51,082 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:22:51,082 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:22:51,083 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:22:51,084 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:22:51,085 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:22:51,086 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:22:51,087 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:22:51,089 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:22:51,091 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:22:51,092 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:22:51,093 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:22:51,094 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:22:51,095 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:22:51,097 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:22:51,097 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:22:51,098 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:22:51,098 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:22:51,099 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:22:51,100 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:22:51,100 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:22:51,101 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:22:51,102 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:22:51,102 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:22:51,103 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:22:51,104 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:22:51,104 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:22:51,104 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:22:51,105 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:22:51,106 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:22:51,106 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:22:51,107 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:51,125 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:22:51,126 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:22:51,127 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:22:51,128 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:22:51,128 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:22:51,129 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:22:51,129 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:22:51,129 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:22:51,129 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:22:51,129 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:22:51,130 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:22:51,131 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:22:51,131 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:22:51,131 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:22:51,131 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:22:51,132 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:22:51,132 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:22:51,132 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:22:51,132 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:22:51,132 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:22:51,133 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:22:51,133 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:22:51,133 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:22:51,134 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:22:51,134 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:22:51,134 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:22:51,134 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:22:51,134 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:22:51,134 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:51,397 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:22:51,410 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:22:51,413 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:22:51,415 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:22:51,415 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:22:51,416 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.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-15 01:22:51,473 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3b474478/e6e29be93d39453885b43c4148af9d38/FLAGf63b3b15e [2019-10-15 01:22:51,994 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:22:51,995 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-15 01:22:52,014 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3b474478/e6e29be93d39453885b43c4148af9d38/FLAGf63b3b15e [2019-10-15 01:22:52,336 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3b474478/e6e29be93d39453885b43c4148af9d38 [2019-10-15 01:22:52,346 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:22:52,347 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:22:52,348 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:22:52,348 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:22:52,351 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:22:52,352 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:22:52" (1/1) ... [2019-10-15 01:22:52,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f5f647f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:52, skipping insertion in model container [2019-10-15 01:22:52,355 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:22:52" (1/1) ... [2019-10-15 01:22:52,362 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:22:52,446 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:22:53,041 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:22:53,070 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:22:53,482 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:22:53,512 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:22:53,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:53 WrapperNode [2019-10-15 01:22:53,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:22:53,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:22:53,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:22:53,515 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:22:53,528 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:53" (1/1) ... [2019-10-15 01:22:53,529 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:53" (1/1) ... [2019-10-15 01:22:53,571 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:53" (1/1) ... [2019-10-15 01:22:53,574 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:53" (1/1) ... [2019-10-15 01:22:53,622 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:53" (1/1) ... [2019-10-15 01:22:53,643 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:53" (1/1) ... [2019-10-15 01:22:53,649 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:53" (1/1) ... [2019-10-15 01:22:53,658 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:22:53,658 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:22:53,658 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:22:53,659 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:22:53,659 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:22:53,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:22:53,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:22:53,760 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:22:53,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:22:53,761 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:22:53,761 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-15 01:22:53,761 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 01:22:53,761 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 01:22:53,761 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:22:53,762 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 01:22:53,762 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 01:22:53,762 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 01:22:53,762 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 01:22:53,763 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 01:22:53,763 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 01:22:53,763 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 01:22:53,763 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:22:53,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:22:53,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:22:55,369 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:22:55,370 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 01:22:55,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:22:55 BoogieIcfgContainer [2019-10-15 01:22:55,372 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:22:55,373 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:22:55,373 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:22:55,378 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:22:55,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:22:52" (1/3) ... [2019-10-15 01:22:55,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d005c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:22:55, skipping insertion in model container [2019-10-15 01:22:55,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:53" (2/3) ... [2019-10-15 01:22:55,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d005c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:22:55, skipping insertion in model container [2019-10-15 01:22:55,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:22:55" (3/3) ... [2019-10-15 01:22:55,386 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-15 01:22:55,396 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:22:55,415 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-10-15 01:22:55,427 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-10-15 01:22:55,456 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:22:55,456 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:22:55,457 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:22:55,457 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:22:55,457 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:22:55,457 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:22:55,457 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:22:55,457 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:22:55,485 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states. [2019-10-15 01:22:55,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-15 01:22:55,502 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:55,503 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] [2019-10-15 01:22:55,505 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:55,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:55,510 INFO L82 PathProgramCache]: Analyzing trace with hash -242885028, now seen corresponding path program 1 times [2019-10-15 01:22:55,519 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:55,520 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938584401] [2019-10-15 01:22:55,520 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:55,520 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:55,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:55,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:56,221 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,222 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938584401] [2019-10-15 01:22:56,223 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:56,223 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:56,224 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550653994] [2019-10-15 01:22:56,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:56,230 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:56,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:56,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:56,247 INFO L87 Difference]: Start difference. First operand 382 states. Second operand 3 states. [2019-10-15 01:22:56,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:56,505 INFO L93 Difference]: Finished difference Result 692 states and 1229 transitions. [2019-10-15 01:22:56,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:56,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-10-15 01:22:56,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:56,542 INFO L225 Difference]: With dead ends: 692 [2019-10-15 01:22:56,542 INFO L226 Difference]: Without dead ends: 537 [2019-10-15 01:22:56,546 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,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-10-15 01:22:56,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 535. [2019-10-15 01:22:56,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2019-10-15 01:22:56,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 778 transitions. [2019-10-15 01:22:56,646 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 778 transitions. Word has length 142 [2019-10-15 01:22:56,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:56,647 INFO L462 AbstractCegarLoop]: Abstraction has 535 states and 778 transitions. [2019-10-15 01:22:56,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:56,648 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 778 transitions. [2019-10-15 01:22:56,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-15 01:22:56,652 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:56,652 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] [2019-10-15 01:22:56,653 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:56,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:56,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1296834716, now seen corresponding path program 1 times [2019-10-15 01:22:56,654 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:56,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229755485] [2019-10-15 01:22:56,654 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:56,654 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:56,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:56,889 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,890 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229755485] [2019-10-15 01:22:56,890 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:56,890 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:56,890 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645775386] [2019-10-15 01:22:56,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:56,894 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:56,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:56,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:56,895 INFO L87 Difference]: Start difference. First operand 535 states and 778 transitions. Second operand 3 states. [2019-10-15 01:22:57,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:57,069 INFO L93 Difference]: Finished difference Result 1070 states and 1613 transitions. [2019-10-15 01:22:57,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:57,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-10-15 01:22:57,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:57,078 INFO L225 Difference]: With dead ends: 1070 [2019-10-15 01:22:57,078 INFO L226 Difference]: Without dead ends: 853 [2019-10-15 01:22:57,082 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:57,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2019-10-15 01:22:57,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 851. [2019-10-15 01:22:57,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2019-10-15 01:22:57,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1260 transitions. [2019-10-15 01:22:57,131 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1260 transitions. Word has length 142 [2019-10-15 01:22:57,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:57,132 INFO L462 AbstractCegarLoop]: Abstraction has 851 states and 1260 transitions. [2019-10-15 01:22:57,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:57,132 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1260 transitions. [2019-10-15 01:22:57,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-15 01:22:57,137 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:57,137 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] [2019-10-15 01:22:57,137 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:57,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:57,138 INFO L82 PathProgramCache]: Analyzing trace with hash 156483868, now seen corresponding path program 1 times [2019-10-15 01:22:57,138 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:57,138 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765906110] [2019-10-15 01:22:57,138 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:57,139 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:57,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:57,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:57,440 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765906110] [2019-10-15 01:22:57,440 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:57,440 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:57,440 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805240702] [2019-10-15 01:22:57,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:57,441 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:57,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:57,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:57,442 INFO L87 Difference]: Start difference. First operand 851 states and 1260 transitions. Second operand 4 states. [2019-10-15 01:22:57,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:57,615 INFO L93 Difference]: Finished difference Result 2496 states and 3689 transitions. [2019-10-15 01:22:57,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:57,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-10-15 01:22:57,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:57,624 INFO L225 Difference]: With dead ends: 2496 [2019-10-15 01:22:57,624 INFO L226 Difference]: Without dead ends: 1658 [2019-10-15 01:22:57,627 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:57,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2019-10-15 01:22:57,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1630. [2019-10-15 01:22:57,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1630 states. [2019-10-15 01:22:57,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2403 transitions. [2019-10-15 01:22:57,740 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2403 transitions. Word has length 142 [2019-10-15 01:22:57,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:57,740 INFO L462 AbstractCegarLoop]: Abstraction has 1630 states and 2403 transitions. [2019-10-15 01:22:57,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:57,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2403 transitions. [2019-10-15 01:22:57,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-15 01:22:57,745 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:57,745 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] [2019-10-15 01:22:57,745 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:57,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:57,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1506911746, now seen corresponding path program 1 times [2019-10-15 01:22:57,746 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:57,746 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002845800] [2019-10-15 01:22:57,746 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:57,746 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:57,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:57,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:57,816 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002845800] [2019-10-15 01:22:57,817 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:57,817 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:57,817 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460346978] [2019-10-15 01:22:57,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:57,818 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:57,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:57,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:57,819 INFO L87 Difference]: Start difference. First operand 1630 states and 2403 transitions. Second operand 3 states. [2019-10-15 01:22:57,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:57,961 INFO L93 Difference]: Finished difference Result 4844 states and 7139 transitions. [2019-10-15 01:22:57,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:57,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-10-15 01:22:57,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:57,981 INFO L225 Difference]: With dead ends: 4844 [2019-10-15 01:22:57,981 INFO L226 Difference]: Without dead ends: 3246 [2019-10-15 01:22:57,986 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:57,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3246 states. [2019-10-15 01:22:58,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3246 to 1632. [2019-10-15 01:22:58,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1632 states. [2019-10-15 01:22:58,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1632 states and 2405 transitions. [2019-10-15 01:22:58,093 INFO L78 Accepts]: Start accepts. Automaton has 1632 states and 2405 transitions. Word has length 143 [2019-10-15 01:22:58,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:58,094 INFO L462 AbstractCegarLoop]: Abstraction has 1632 states and 2405 transitions. [2019-10-15 01:22:58,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:58,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1632 states and 2405 transitions. [2019-10-15 01:22:58,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-15 01:22:58,098 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:58,098 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] [2019-10-15 01:22:58,098 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:58,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:58,099 INFO L82 PathProgramCache]: Analyzing trace with hash -705286279, now seen corresponding path program 1 times [2019-10-15 01:22:58,099 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:58,099 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467503825] [2019-10-15 01:22:58,099 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:58,100 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:58,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:58,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:58,251 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,252 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467503825] [2019-10-15 01:22:58,252 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:58,252 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:58,252 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824026194] [2019-10-15 01:22:58,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:58,253 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:58,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:58,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:58,254 INFO L87 Difference]: Start difference. First operand 1632 states and 2405 transitions. Second operand 3 states. [2019-10-15 01:22:58,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:58,491 INFO L93 Difference]: Finished difference Result 4281 states and 6311 transitions. [2019-10-15 01:22:58,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:58,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-10-15 01:22:58,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:58,513 INFO L225 Difference]: With dead ends: 4281 [2019-10-15 01:22:58,513 INFO L226 Difference]: Without dead ends: 2829 [2019-10-15 01:22:58,517 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:58,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2829 states. [2019-10-15 01:22:58,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2829 to 2801. [2019-10-15 01:22:58,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2801 states. [2019-10-15 01:22:58,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2801 states to 2801 states and 4081 transitions. [2019-10-15 01:22:58,750 INFO L78 Accepts]: Start accepts. Automaton has 2801 states and 4081 transitions. Word has length 144 [2019-10-15 01:22:58,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:58,751 INFO L462 AbstractCegarLoop]: Abstraction has 2801 states and 4081 transitions. [2019-10-15 01:22:58,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:58,751 INFO L276 IsEmpty]: Start isEmpty. Operand 2801 states and 4081 transitions. [2019-10-15 01:22:58,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-15 01:22:58,759 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:58,760 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] [2019-10-15 01:22:58,760 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:58,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:58,761 INFO L82 PathProgramCache]: Analyzing trace with hash 2069030422, now seen corresponding path program 1 times [2019-10-15 01:22:58,761 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:58,762 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177556160] [2019-10-15 01:22:58,762 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:58,762 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:58,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:58,960 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,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177556160] [2019-10-15 01:22:58,961 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:58,961 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:58,961 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440121371] [2019-10-15 01:22:58,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:58,962 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:58,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:58,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:58,963 INFO L87 Difference]: Start difference. First operand 2801 states and 4081 transitions. Second operand 4 states. [2019-10-15 01:22:59,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:59,153 INFO L93 Difference]: Finished difference Result 5024 states and 7338 transitions. [2019-10-15 01:22:59,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:59,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2019-10-15 01:22:59,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:59,166 INFO L225 Difference]: With dead ends: 5024 [2019-10-15 01:22:59,166 INFO L226 Difference]: Without dead ends: 2393 [2019-10-15 01:22:59,172 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:59,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2393 states. [2019-10-15 01:22:59,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2393 to 2393. [2019-10-15 01:22:59,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2393 states. [2019-10-15 01:22:59,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2393 states to 2393 states and 3482 transitions. [2019-10-15 01:22:59,322 INFO L78 Accepts]: Start accepts. Automaton has 2393 states and 3482 transitions. Word has length 144 [2019-10-15 01:22:59,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:59,322 INFO L462 AbstractCegarLoop]: Abstraction has 2393 states and 3482 transitions. [2019-10-15 01:22:59,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:59,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2393 states and 3482 transitions. [2019-10-15 01:22:59,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-15 01:22:59,327 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:59,327 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:59,328 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:59,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:59,328 INFO L82 PathProgramCache]: Analyzing trace with hash -839538967, now seen corresponding path program 1 times [2019-10-15 01:22:59,328 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:59,328 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349460593] [2019-10-15 01:22:59,329 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:59,329 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:59,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:59,659 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,660 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349460593] [2019-10-15 01:22:59,660 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:59,660 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-15 01:22:59,660 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548815516] [2019-10-15 01:22:59,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-15 01:22:59,661 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:59,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-15 01:22:59,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:22:59,663 INFO L87 Difference]: Start difference. First operand 2393 states and 3482 transitions. Second operand 13 states. [2019-10-15 01:23:03,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:03,767 INFO L93 Difference]: Finished difference Result 10628 states and 16267 transitions. [2019-10-15 01:23:03,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-15 01:23:03,768 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 147 [2019-10-15 01:23:03,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:03,808 INFO L225 Difference]: With dead ends: 10628 [2019-10-15 01:23:03,809 INFO L226 Difference]: Without dead ends: 8437 [2019-10-15 01:23:03,815 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=358, Invalid=832, Unknown=0, NotChecked=0, Total=1190 [2019-10-15 01:23:03,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8437 states. [2019-10-15 01:23:04,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8437 to 5241. [2019-10-15 01:23:04,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5241 states. [2019-10-15 01:23:04,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5241 states to 5241 states and 7870 transitions. [2019-10-15 01:23:04,219 INFO L78 Accepts]: Start accepts. Automaton has 5241 states and 7870 transitions. Word has length 147 [2019-10-15 01:23:04,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:04,220 INFO L462 AbstractCegarLoop]: Abstraction has 5241 states and 7870 transitions. [2019-10-15 01:23:04,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-15 01:23:04,220 INFO L276 IsEmpty]: Start isEmpty. Operand 5241 states and 7870 transitions. [2019-10-15 01:23:04,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-15 01:23:04,226 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:04,226 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:23:04,227 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:04,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:04,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1983851261, now seen corresponding path program 1 times [2019-10-15 01:23:04,228 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:04,228 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837431129] [2019-10-15 01:23:04,228 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:04,228 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:04,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:04,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:04,472 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:04,473 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837431129] [2019-10-15 01:23:04,473 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:04,474 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:23:04,474 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492121603] [2019-10-15 01:23:04,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:23:04,475 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:04,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:23:04,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:04,476 INFO L87 Difference]: Start difference. First operand 5241 states and 7870 transitions. Second operand 5 states. [2019-10-15 01:23:04,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:04,929 INFO L93 Difference]: Finished difference Result 7383 states and 11193 transitions. [2019-10-15 01:23:04,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:04,930 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-10-15 01:23:04,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:04,942 INFO L225 Difference]: With dead ends: 7383 [2019-10-15 01:23:04,943 INFO L226 Difference]: Without dead ends: 2962 [2019-10-15 01:23:04,953 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:23:04,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2019-10-15 01:23:05,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 2393. [2019-10-15 01:23:05,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2393 states. [2019-10-15 01:23:05,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2393 states to 2393 states and 3467 transitions. [2019-10-15 01:23:05,176 INFO L78 Accepts]: Start accepts. Automaton has 2393 states and 3467 transitions. Word has length 147 [2019-10-15 01:23:05,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:05,176 INFO L462 AbstractCegarLoop]: Abstraction has 2393 states and 3467 transitions. [2019-10-15 01:23:05,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:23:05,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2393 states and 3467 transitions. [2019-10-15 01:23:05,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-15 01:23:05,180 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:05,180 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,181 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:05,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:05,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1902905006, now seen corresponding path program 1 times [2019-10-15 01:23:05,181 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:05,182 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121243179] [2019-10-15 01:23:05,182 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:05,182 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:05,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:05,399 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,399 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121243179] [2019-10-15 01:23:05,399 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:05,399 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:23:05,400 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493610440] [2019-10-15 01:23:05,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:23:05,400 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:05,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:23:05,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:23:05,401 INFO L87 Difference]: Start difference. First operand 2393 states and 3467 transitions. Second operand 9 states. [2019-10-15 01:23:06,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:06,797 INFO L93 Difference]: Finished difference Result 8933 states and 13661 transitions. [2019-10-15 01:23:06,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 01:23:06,797 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 147 [2019-10-15 01:23:06,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:06,822 INFO L225 Difference]: With dead ends: 8933 [2019-10-15 01:23:06,822 INFO L226 Difference]: Without dead ends: 6742 [2019-10-15 01:23:06,828 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:23:06,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6742 states. [2019-10-15 01:23:07,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6742 to 4124. [2019-10-15 01:23:07,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4124 states. [2019-10-15 01:23:07,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4124 states to 4124 states and 6152 transitions. [2019-10-15 01:23:07,111 INFO L78 Accepts]: Start accepts. Automaton has 4124 states and 6152 transitions. Word has length 147 [2019-10-15 01:23:07,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:07,112 INFO L462 AbstractCegarLoop]: Abstraction has 4124 states and 6152 transitions. [2019-10-15 01:23:07,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:23:07,120 INFO L276 IsEmpty]: Start isEmpty. Operand 4124 states and 6152 transitions. [2019-10-15 01:23:07,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-15 01:23:07,125 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:07,125 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:23:07,126 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:07,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:07,133 INFO L82 PathProgramCache]: Analyzing trace with hash 431327938, now seen corresponding path program 1 times [2019-10-15 01:23:07,133 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:07,133 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270092378] [2019-10-15 01:23:07,133 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:07,134 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:07,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:07,359 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:07,360 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270092378] [2019-10-15 01:23:07,360 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:07,360 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:07,360 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521808243] [2019-10-15 01:23:07,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:07,361 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:07,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:07,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:07,362 INFO L87 Difference]: Start difference. First operand 4124 states and 6152 transitions. Second operand 4 states. [2019-10-15 01:23:08,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:08,009 INFO L93 Difference]: Finished difference Result 10839 states and 16152 transitions. [2019-10-15 01:23:08,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:08,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-10-15 01:23:08,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:08,028 INFO L225 Difference]: With dead ends: 10839 [2019-10-15 01:23:08,029 INFO L226 Difference]: Without dead ends: 6738 [2019-10-15 01:23:08,045 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:08,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6738 states. [2019-10-15 01:23:08,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6738 to 6716. [2019-10-15 01:23:08,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6716 states. [2019-10-15 01:23:08,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6716 states to 6716 states and 9913 transitions. [2019-10-15 01:23:08,505 INFO L78 Accepts]: Start accepts. Automaton has 6716 states and 9913 transitions. Word has length 147 [2019-10-15 01:23:08,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:08,506 INFO L462 AbstractCegarLoop]: Abstraction has 6716 states and 9913 transitions. [2019-10-15 01:23:08,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:08,506 INFO L276 IsEmpty]: Start isEmpty. Operand 6716 states and 9913 transitions. [2019-10-15 01:23:08,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-15 01:23:08,512 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:08,513 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] [2019-10-15 01:23:08,513 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:08,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:08,513 INFO L82 PathProgramCache]: Analyzing trace with hash 569231315, now seen corresponding path program 1 times [2019-10-15 01:23:08,514 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:08,514 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524594519] [2019-10-15 01:23:08,514 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:08,514 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:08,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:08,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:08,604 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,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524594519] [2019-10-15 01:23:08,604 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:08,605 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:08,605 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629197171] [2019-10-15 01:23:08,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:08,605 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:08,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:08,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:08,606 INFO L87 Difference]: Start difference. First operand 6716 states and 9913 transitions. Second operand 3 states. [2019-10-15 01:23:09,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:09,444 INFO L93 Difference]: Finished difference Result 19274 states and 28571 transitions. [2019-10-15 01:23:09,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:09,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-10-15 01:23:09,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:09,470 INFO L225 Difference]: With dead ends: 19274 [2019-10-15 01:23:09,470 INFO L226 Difference]: Without dead ends: 12911 [2019-10-15 01:23:09,481 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:09,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12911 states. [2019-10-15 01:23:10,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12911 to 12891. [2019-10-15 01:23:10,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12891 states. [2019-10-15 01:23:10,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12891 states to 12891 states and 18910 transitions. [2019-10-15 01:23:10,274 INFO L78 Accepts]: Start accepts. Automaton has 12891 states and 18910 transitions. Word has length 149 [2019-10-15 01:23:10,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:10,274 INFO L462 AbstractCegarLoop]: Abstraction has 12891 states and 18910 transitions. [2019-10-15 01:23:10,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:10,274 INFO L276 IsEmpty]: Start isEmpty. Operand 12891 states and 18910 transitions. [2019-10-15 01:23:10,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-15 01:23:10,284 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:10,284 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] [2019-10-15 01:23:10,284 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:10,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:10,285 INFO L82 PathProgramCache]: Analyzing trace with hash -2112573418, now seen corresponding path program 1 times [2019-10-15 01:23:10,285 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:10,285 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043822441] [2019-10-15 01:23:10,285 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:10,286 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:10,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:10,415 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,415 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043822441] [2019-10-15 01:23:10,415 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:10,416 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:10,416 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788950324] [2019-10-15 01:23:10,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:10,416 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:10,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:10,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:10,417 INFO L87 Difference]: Start difference. First operand 12891 states and 18910 transitions. Second operand 4 states. [2019-10-15 01:23:10,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:10,860 INFO L93 Difference]: Finished difference Result 20704 states and 30338 transitions. [2019-10-15 01:23:10,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:10,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-10-15 01:23:10,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:10,881 INFO L225 Difference]: With dead ends: 20704 [2019-10-15 01:23:10,881 INFO L226 Difference]: Without dead ends: 10439 [2019-10-15 01:23:10,900 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:10,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10439 states. [2019-10-15 01:23:12,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10439 to 10439. [2019-10-15 01:23:12,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10439 states. [2019-10-15 01:23:12,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10439 states to 10439 states and 15246 transitions. [2019-10-15 01:23:12,017 INFO L78 Accepts]: Start accepts. Automaton has 10439 states and 15246 transitions. Word has length 149 [2019-10-15 01:23:12,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:12,017 INFO L462 AbstractCegarLoop]: Abstraction has 10439 states and 15246 transitions. [2019-10-15 01:23:12,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:12,018 INFO L276 IsEmpty]: Start isEmpty. Operand 10439 states and 15246 transitions. [2019-10-15 01:23:12,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-15 01:23:12,025 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:12,025 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:12,025 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:12,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:12,026 INFO L82 PathProgramCache]: Analyzing trace with hash 424881092, now seen corresponding path program 1 times [2019-10-15 01:23:12,026 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:12,026 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316765] [2019-10-15 01:23:12,026 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:12,027 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:12,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:12,190 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:12,190 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316765] [2019-10-15 01:23:12,190 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:12,190 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:12,191 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211958996] [2019-10-15 01:23:12,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:12,191 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:12,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:12,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:12,192 INFO L87 Difference]: Start difference. First operand 10439 states and 15246 transitions. Second operand 4 states. [2019-10-15 01:23:13,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:13,162 INFO L93 Difference]: Finished difference Result 30627 states and 44764 transitions. [2019-10-15 01:23:13,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:13,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-10-15 01:23:13,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:13,192 INFO L225 Difference]: With dead ends: 30627 [2019-10-15 01:23:13,192 INFO L226 Difference]: Without dead ends: 20231 [2019-10-15 01:23:13,215 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:13,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20231 states. [2019-10-15 01:23:14,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20231 to 20191. [2019-10-15 01:23:14,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20191 states. [2019-10-15 01:23:14,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20191 states to 20191 states and 29305 transitions. [2019-10-15 01:23:14,429 INFO L78 Accepts]: Start accepts. Automaton has 20191 states and 29305 transitions. Word has length 152 [2019-10-15 01:23:14,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:14,429 INFO L462 AbstractCegarLoop]: Abstraction has 20191 states and 29305 transitions. [2019-10-15 01:23:14,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:14,429 INFO L276 IsEmpty]: Start isEmpty. Operand 20191 states and 29305 transitions. [2019-10-15 01:23:14,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-15 01:23:14,441 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:14,441 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] [2019-10-15 01:23:14,441 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:14,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:14,442 INFO L82 PathProgramCache]: Analyzing trace with hash 598575340, now seen corresponding path program 1 times [2019-10-15 01:23:14,442 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:14,442 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268803775] [2019-10-15 01:23:14,442 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:14,442 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:14,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:14,495 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:14,495 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268803775] [2019-10-15 01:23:14,496 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:14,496 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:14,496 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537317438] [2019-10-15 01:23:14,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:14,497 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:14,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:14,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:14,497 INFO L87 Difference]: Start difference. First operand 20191 states and 29305 transitions. Second operand 3 states. [2019-10-15 01:23:16,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:16,600 INFO L93 Difference]: Finished difference Result 60381 states and 87668 transitions. [2019-10-15 01:23:16,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:16,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-10-15 01:23:16,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:16,657 INFO L225 Difference]: With dead ends: 60381 [2019-10-15 01:23:16,657 INFO L226 Difference]: Without dead ends: 40295 [2019-10-15 01:23:16,690 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:16,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40295 states. [2019-10-15 01:23:18,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40295 to 20197. [2019-10-15 01:23:18,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20197 states. [2019-10-15 01:23:18,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20197 states to 20197 states and 29311 transitions. [2019-10-15 01:23:18,741 INFO L78 Accepts]: Start accepts. Automaton has 20197 states and 29311 transitions. Word has length 153 [2019-10-15 01:23:18,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:18,741 INFO L462 AbstractCegarLoop]: Abstraction has 20197 states and 29311 transitions. [2019-10-15 01:23:18,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:18,741 INFO L276 IsEmpty]: Start isEmpty. Operand 20197 states and 29311 transitions. [2019-10-15 01:23:18,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-15 01:23:18,750 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:18,750 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] [2019-10-15 01:23:18,750 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:18,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:18,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1058530053, now seen corresponding path program 1 times [2019-10-15 01:23:18,751 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:18,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577511880] [2019-10-15 01:23:18,751 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:18,751 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:18,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:18,875 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,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577511880] [2019-10-15 01:23:18,876 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:18,876 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:18,876 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694001388] [2019-10-15 01:23:18,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:18,877 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:18,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:18,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:18,877 INFO L87 Difference]: Start difference. First operand 20197 states and 29311 transitions. Second operand 4 states. [2019-10-15 01:23:20,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:20,071 INFO L93 Difference]: Finished difference Result 40352 states and 58566 transitions. [2019-10-15 01:23:20,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:20,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-10-15 01:23:20,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:20,090 INFO L225 Difference]: With dead ends: 40352 [2019-10-15 01:23:20,091 INFO L226 Difference]: Without dead ends: 20191 [2019-10-15 01:23:20,104 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:20,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20191 states. [2019-10-15 01:23:21,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20191 to 20191. [2019-10-15 01:23:21,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20191 states. [2019-10-15 01:23:21,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20191 states to 20191 states and 29299 transitions. [2019-10-15 01:23:21,167 INFO L78 Accepts]: Start accepts. Automaton has 20191 states and 29299 transitions. Word has length 154 [2019-10-15 01:23:21,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:21,167 INFO L462 AbstractCegarLoop]: Abstraction has 20191 states and 29299 transitions. [2019-10-15 01:23:21,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:21,168 INFO L276 IsEmpty]: Start isEmpty. Operand 20191 states and 29299 transitions. [2019-10-15 01:23:21,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-15 01:23:21,176 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:21,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, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:21,176 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:21,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:21,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1392175557, now seen corresponding path program 1 times [2019-10-15 01:23:21,177 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:21,177 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782226158] [2019-10-15 01:23:21,177 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:21,177 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:21,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:21,274 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:21,275 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782226158] [2019-10-15 01:23:21,275 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:21,275 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:21,275 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580699472] [2019-10-15 01:23:21,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:21,276 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:21,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:21,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:21,277 INFO L87 Difference]: Start difference. First operand 20191 states and 29299 transitions. Second operand 3 states. [2019-10-15 01:23:23,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:23,048 INFO L93 Difference]: Finished difference Result 49506 states and 71780 transitions. [2019-10-15 01:23:23,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:23,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-10-15 01:23:23,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:23,081 INFO L225 Difference]: With dead ends: 49506 [2019-10-15 01:23:23,081 INFO L226 Difference]: Without dead ends: 29990 [2019-10-15 01:23:23,103 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:23,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29990 states. [2019-10-15 01:23:24,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29990 to 29950. [2019-10-15 01:23:24,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29950 states. [2019-10-15 01:23:24,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29950 states to 29950 states and 42762 transitions. [2019-10-15 01:23:24,961 INFO L78 Accepts]: Start accepts. Automaton has 29950 states and 42762 transitions. Word has length 154 [2019-10-15 01:23:24,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:24,962 INFO L462 AbstractCegarLoop]: Abstraction has 29950 states and 42762 transitions. [2019-10-15 01:23:24,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:24,962 INFO L276 IsEmpty]: Start isEmpty. Operand 29950 states and 42762 transitions. [2019-10-15 01:23:24,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-15 01:23:24,973 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:24,973 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] [2019-10-15 01:23:24,973 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:24,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:24,974 INFO L82 PathProgramCache]: Analyzing trace with hash 734640385, now seen corresponding path program 1 times [2019-10-15 01:23:24,974 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:24,974 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615886896] [2019-10-15 01:23:24,974 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:24,974 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:24,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:25,212 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:25,213 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615886896] [2019-10-15 01:23:25,213 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:25,213 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-15 01:23:25,213 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004274751] [2019-10-15 01:23:25,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 01:23:25,214 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:25,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 01:23:25,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:23:25,215 INFO L87 Difference]: Start difference. First operand 29950 states and 42762 transitions. Second operand 11 states. [2019-10-15 01:23:26,052 WARN L191 SmtUtils]: Spent 535.00 ms on a formula simplification that was a NOOP. DAG size: 17