/usr/bin/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-fb55353 [2019-11-07 01:05:11,376 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:05:11,379 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:05:11,396 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:05:11,397 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:05:11,399 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:05:11,400 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:05:11,405 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:05:11,407 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:05:11,411 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:05:11,412 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:05:11,413 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:05:11,414 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:05:11,416 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:05:11,418 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:05:11,420 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:05:11,422 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:05:11,424 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:05:11,426 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:05:11,430 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:05:11,434 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:05:11,436 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:05:11,439 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:05:11,440 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:05:11,443 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:05:11,443 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:05:11,443 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:05:11,445 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:05:11,445 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:05:11,447 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:05:11,447 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:05:11,448 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:05:11,449 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:05:11,449 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:05:11,451 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:05:11,451 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:05:11,452 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:05:11,452 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:05:11,452 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:05:11,453 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:05:11,453 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:05:11,454 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-11-07 01:05:11,473 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:05:11,473 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:05:11,474 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:05:11,475 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:05:11,475 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:05:11,475 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:05:11,475 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:05:11,475 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:05:11,476 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:05:11,476 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:05:11,477 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:05:11,477 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:05:11,477 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:05:11,478 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:05:11,478 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:05:11,478 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:05:11,478 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:05:11,478 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:05:11,479 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:05:11,479 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:05:11,479 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:05:11,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:05:11,479 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:05:11,480 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:05:11,480 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:05:11,480 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:05:11,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:05:11,480 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:05:11,480 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-11-07 01:05:11,750 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:05:11,764 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:05:11,767 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:05:11,769 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:05:11,769 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:05:11,770 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-11-07 01:05:11,845 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d12b00fd6/aa710f606a834025934d8b3467e1dcad/FLAG8e41f7b88 [2019-11-07 01:05:12,443 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:05:12,443 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-11-07 01:05:12,460 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d12b00fd6/aa710f606a834025934d8b3467e1dcad/FLAG8e41f7b88 [2019-11-07 01:05:12,717 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d12b00fd6/aa710f606a834025934d8b3467e1dcad [2019-11-07 01:05:12,741 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:05:12,744 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:05:12,749 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:05:12,749 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:05:12,758 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:05:12,761 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:05:12" (1/1) ... [2019-11-07 01:05:12,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4398e13a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:12, skipping insertion in model container [2019-11-07 01:05:12,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:05:12" (1/1) ... [2019-11-07 01:05:12,788 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:05:12,942 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:05:13,876 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:05:13,890 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:05:14,095 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:05:14,117 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:05:14,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:14 WrapperNode [2019-11-07 01:05:14,118 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:05:14,119 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:05:14,119 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:05:14,119 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:05:14,134 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:14" (1/1) ... [2019-11-07 01:05:14,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:14" (1/1) ... [2019-11-07 01:05:14,155 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:14" (1/1) ... [2019-11-07 01:05:14,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:14" (1/1) ... [2019-11-07 01:05:14,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:14" (1/1) ... [2019-11-07 01:05:14,227 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:14" (1/1) ... [2019-11-07 01:05:14,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:14" (1/1) ... [2019-11-07 01:05:14,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:05:14,252 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:05:14,252 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:05:14,253 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:05:14,254 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:14" (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-11-07 01:05:14,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:05:14,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:05:14,342 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:05:14,342 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:05:14,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 01:05:14,344 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-11-07 01:05:14,344 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 01:05:14,344 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 01:05:14,345 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 01:05:14,345 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 01:05:14,346 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 01:05:14,346 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-07 01:05:14,346 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-07 01:05:14,347 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-07 01:05:14,348 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 01:05:14,348 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 01:05:14,350 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:05:14,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:05:14,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:05:16,003 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:05:16,003 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 01:05:16,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:05:16 BoogieIcfgContainer [2019-11-07 01:05:16,005 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:05:16,006 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:05:16,006 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:05:16,009 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:05:16,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:05:12" (1/3) ... [2019-11-07 01:05:16,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b96a2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:05:16, skipping insertion in model container [2019-11-07 01:05:16,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:14" (2/3) ... [2019-11-07 01:05:16,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b96a2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:05:16, skipping insertion in model container [2019-11-07 01:05:16,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:05:16" (3/3) ... [2019-11-07 01:05:16,012 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-07 01:05:16,022 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:05:16,031 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-07 01:05:16,042 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-07 01:05:16,072 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:05:16,072 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:05:16,072 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:05:16,072 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:05:16,073 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:05:16,073 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:05:16,073 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:05:16,073 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:05:16,101 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states. [2019-11-07 01:05:16,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-07 01:05:16,117 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:16,118 INFO L410 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-11-07 01:05:16,120 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:16,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:16,126 INFO L82 PathProgramCache]: Analyzing trace with hash -242885028, now seen corresponding path program 1 times [2019-11-07 01:05:16,136 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:16,136 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585190319] [2019-11-07 01:05:16,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:16,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:16,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:16,823 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585190319] [2019-11-07 01:05:16,824 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:16,824 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:16,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214421476] [2019-11-07 01:05:16,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:16,832 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:16,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:16,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:16,849 INFO L87 Difference]: Start difference. First operand 382 states. Second operand 3 states. [2019-11-07 01:05:17,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:17,057 INFO L93 Difference]: Finished difference Result 692 states and 1229 transitions. [2019-11-07 01:05:17,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:17,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-11-07 01:05:17,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:17,093 INFO L225 Difference]: With dead ends: 692 [2019-11-07 01:05:17,093 INFO L226 Difference]: Without dead ends: 537 [2019-11-07 01:05:17,101 INFO L630 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-11-07 01:05:17,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-11-07 01:05:17,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 535. [2019-11-07 01:05:17,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2019-11-07 01:05:17,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 778 transitions. [2019-11-07 01:05:17,238 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 778 transitions. Word has length 142 [2019-11-07 01:05:17,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:17,241 INFO L462 AbstractCegarLoop]: Abstraction has 535 states and 778 transitions. [2019-11-07 01:05:17,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:17,242 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 778 transitions. [2019-11-07 01:05:17,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-07 01:05:17,253 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:17,254 INFO L410 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-11-07 01:05:17,254 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:17,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:17,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1296834716, now seen corresponding path program 1 times [2019-11-07 01:05:17,255 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:17,256 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13562103] [2019-11-07 01:05:17,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:17,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:17,438 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13562103] [2019-11-07 01:05:17,438 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:17,438 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:17,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350457157] [2019-11-07 01:05:17,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:17,441 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:17,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:17,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:17,442 INFO L87 Difference]: Start difference. First operand 535 states and 778 transitions. Second operand 3 states. [2019-11-07 01:05:17,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:17,623 INFO L93 Difference]: Finished difference Result 1070 states and 1613 transitions. [2019-11-07 01:05:17,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:17,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-11-07 01:05:17,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:17,634 INFO L225 Difference]: With dead ends: 1070 [2019-11-07 01:05:17,635 INFO L226 Difference]: Without dead ends: 853 [2019-11-07 01:05:17,640 INFO L630 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-11-07 01:05:17,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2019-11-07 01:05:17,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 851. [2019-11-07 01:05:17,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2019-11-07 01:05:17,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1260 transitions. [2019-11-07 01:05:17,678 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1260 transitions. Word has length 142 [2019-11-07 01:05:17,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:17,679 INFO L462 AbstractCegarLoop]: Abstraction has 851 states and 1260 transitions. [2019-11-07 01:05:17,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:17,679 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1260 transitions. [2019-11-07 01:05:17,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-07 01:05:17,682 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:17,682 INFO L410 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-11-07 01:05:17,683 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:17,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:17,683 INFO L82 PathProgramCache]: Analyzing trace with hash 156483868, now seen corresponding path program 1 times [2019-11-07 01:05:17,684 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:17,684 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86491606] [2019-11-07 01:05:17,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:18,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:18,018 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86491606] [2019-11-07 01:05:18,018 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:18,019 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:05:18,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350632043] [2019-11-07 01:05:18,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:05:18,020 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:18,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:05:18,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:05:18,024 INFO L87 Difference]: Start difference. First operand 851 states and 1260 transitions. Second operand 4 states. [2019-11-07 01:05:18,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:18,183 INFO L93 Difference]: Finished difference Result 2496 states and 3689 transitions. [2019-11-07 01:05:18,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:05:18,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-11-07 01:05:18,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:18,192 INFO L225 Difference]: With dead ends: 2496 [2019-11-07 01:05:18,193 INFO L226 Difference]: Without dead ends: 1658 [2019-11-07 01:05:18,195 INFO L630 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-11-07 01:05:18,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2019-11-07 01:05:18,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1630. [2019-11-07 01:05:18,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1630 states. [2019-11-07 01:05:18,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2403 transitions. [2019-11-07 01:05:18,289 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2403 transitions. Word has length 142 [2019-11-07 01:05:18,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:18,290 INFO L462 AbstractCegarLoop]: Abstraction has 1630 states and 2403 transitions. [2019-11-07 01:05:18,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:05:18,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2403 transitions. [2019-11-07 01:05:18,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-07 01:05:18,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:18,294 INFO L410 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-11-07 01:05:18,294 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:18,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:18,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1506911746, now seen corresponding path program 1 times [2019-11-07 01:05:18,295 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:18,295 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440832424] [2019-11-07 01:05:18,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:18,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:18,368 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440832424] [2019-11-07 01:05:18,368 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:18,369 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:18,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792850937] [2019-11-07 01:05:18,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:18,370 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:18,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:18,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:18,370 INFO L87 Difference]: Start difference. First operand 1630 states and 2403 transitions. Second operand 3 states. [2019-11-07 01:05:18,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:18,536 INFO L93 Difference]: Finished difference Result 4844 states and 7139 transitions. [2019-11-07 01:05:18,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:18,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-11-07 01:05:18,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:18,559 INFO L225 Difference]: With dead ends: 4844 [2019-11-07 01:05:18,559 INFO L226 Difference]: Without dead ends: 3246 [2019-11-07 01:05:18,563 INFO L630 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-11-07 01:05:18,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3246 states. [2019-11-07 01:05:18,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3246 to 1632. [2019-11-07 01:05:18,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1632 states. [2019-11-07 01:05:18,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1632 states and 2405 transitions. [2019-11-07 01:05:18,703 INFO L78 Accepts]: Start accepts. Automaton has 1632 states and 2405 transitions. Word has length 143 [2019-11-07 01:05:18,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:18,704 INFO L462 AbstractCegarLoop]: Abstraction has 1632 states and 2405 transitions. [2019-11-07 01:05:18,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:18,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1632 states and 2405 transitions. [2019-11-07 01:05:18,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-07 01:05:18,709 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:18,710 INFO L410 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-11-07 01:05:18,710 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:18,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:18,711 INFO L82 PathProgramCache]: Analyzing trace with hash -705286279, now seen corresponding path program 1 times [2019-11-07 01:05:18,711 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:18,712 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135323979] [2019-11-07 01:05:18,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:18,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:18,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:18,938 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135323979] [2019-11-07 01:05:18,938 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:18,939 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:18,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681995003] [2019-11-07 01:05:18,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:18,940 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:18,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:18,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:18,941 INFO L87 Difference]: Start difference. First operand 1632 states and 2405 transitions. Second operand 3 states. [2019-11-07 01:05:19,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:19,209 INFO L93 Difference]: Finished difference Result 4281 states and 6311 transitions. [2019-11-07 01:05:19,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:19,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-11-07 01:05:19,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:19,225 INFO L225 Difference]: With dead ends: 4281 [2019-11-07 01:05:19,225 INFO L226 Difference]: Without dead ends: 2829 [2019-11-07 01:05:19,229 INFO L630 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-11-07 01:05:19,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2829 states. [2019-11-07 01:05:19,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2829 to 2801. [2019-11-07 01:05:19,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2801 states. [2019-11-07 01:05:19,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2801 states to 2801 states and 4081 transitions. [2019-11-07 01:05:19,399 INFO L78 Accepts]: Start accepts. Automaton has 2801 states and 4081 transitions. Word has length 144 [2019-11-07 01:05:19,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:19,399 INFO L462 AbstractCegarLoop]: Abstraction has 2801 states and 4081 transitions. [2019-11-07 01:05:19,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:19,400 INFO L276 IsEmpty]: Start isEmpty. Operand 2801 states and 4081 transitions. [2019-11-07 01:05:19,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-07 01:05:19,405 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:19,405 INFO L410 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-11-07 01:05:19,406 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:19,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:19,406 INFO L82 PathProgramCache]: Analyzing trace with hash 2069030422, now seen corresponding path program 1 times [2019-11-07 01:05:19,406 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:19,407 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032827220] [2019-11-07 01:05:19,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:19,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:19,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:19,644 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032827220] [2019-11-07 01:05:19,644 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:19,644 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:05:19,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605257481] [2019-11-07 01:05:19,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:05:19,645 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:19,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:05:19,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:05:19,646 INFO L87 Difference]: Start difference. First operand 2801 states and 4081 transitions. Second operand 4 states. [2019-11-07 01:05:19,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:19,809 INFO L93 Difference]: Finished difference Result 5024 states and 7338 transitions. [2019-11-07 01:05:19,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:05:19,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2019-11-07 01:05:19,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:19,822 INFO L225 Difference]: With dead ends: 5024 [2019-11-07 01:05:19,822 INFO L226 Difference]: Without dead ends: 2393 [2019-11-07 01:05:19,828 INFO L630 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-11-07 01:05:19,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2393 states. [2019-11-07 01:05:19,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2393 to 2393. [2019-11-07 01:05:19,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2393 states. [2019-11-07 01:05:19,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2393 states to 2393 states and 3482 transitions. [2019-11-07 01:05:19,965 INFO L78 Accepts]: Start accepts. Automaton has 2393 states and 3482 transitions. Word has length 144 [2019-11-07 01:05:19,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:19,967 INFO L462 AbstractCegarLoop]: Abstraction has 2393 states and 3482 transitions. [2019-11-07 01:05:19,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:05:19,971 INFO L276 IsEmpty]: Start isEmpty. Operand 2393 states and 3482 transitions. [2019-11-07 01:05:19,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-07 01:05:19,975 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:19,975 INFO L410 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-11-07 01:05:19,976 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:19,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:19,976 INFO L82 PathProgramCache]: Analyzing trace with hash -839538967, now seen corresponding path program 1 times [2019-11-07 01:05:19,984 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:19,984 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767644199] [2019-11-07 01:05:19,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:20,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:20,458 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767644199] [2019-11-07 01:05:20,459 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:20,459 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-07 01:05:20,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660536631] [2019-11-07 01:05:20,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-07 01:05:20,460 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:20,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-07 01:05:20,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-11-07 01:05:20,461 INFO L87 Difference]: Start difference. First operand 2393 states and 3482 transitions. Second operand 13 states. [2019-11-07 01:05:24,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:24,586 INFO L93 Difference]: Finished difference Result 10628 states and 16267 transitions. [2019-11-07 01:05:24,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-07 01:05:24,586 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 147 [2019-11-07 01:05:24,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:24,628 INFO L225 Difference]: With dead ends: 10628 [2019-11-07 01:05:24,628 INFO L226 Difference]: Without dead ends: 8437 [2019-11-07 01:05:24,638 INFO L630 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-11-07 01:05:24,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8437 states. [2019-11-07 01:05:25,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8437 to 5241. [2019-11-07 01:05:25,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5241 states. [2019-11-07 01:05:25,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5241 states to 5241 states and 7870 transitions. [2019-11-07 01:05:25,079 INFO L78 Accepts]: Start accepts. Automaton has 5241 states and 7870 transitions. Word has length 147 [2019-11-07 01:05:25,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:25,081 INFO L462 AbstractCegarLoop]: Abstraction has 5241 states and 7870 transitions. [2019-11-07 01:05:25,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-07 01:05:25,081 INFO L276 IsEmpty]: Start isEmpty. Operand 5241 states and 7870 transitions. [2019-11-07 01:05:25,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-07 01:05:25,090 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:25,090 INFO L410 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-11-07 01:05:25,090 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:25,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:25,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1983851261, now seen corresponding path program 1 times [2019-11-07 01:05:25,091 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:25,091 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909495645] [2019-11-07 01:05:25,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:25,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:25,281 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909495645] [2019-11-07 01:05:25,281 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:25,281 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:05:25,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69409568] [2019-11-07 01:05:25,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:05:25,283 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:25,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:05:25,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:05:25,283 INFO L87 Difference]: Start difference. First operand 5241 states and 7870 transitions. Second operand 5 states. [2019-11-07 01:05:25,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:25,840 INFO L93 Difference]: Finished difference Result 7383 states and 11193 transitions. [2019-11-07 01:05:25,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:05:25,840 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-11-07 01:05:25,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:25,854 INFO L225 Difference]: With dead ends: 7383 [2019-11-07 01:05:25,854 INFO L226 Difference]: Without dead ends: 2962 [2019-11-07 01:05:25,862 INFO L630 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-11-07 01:05:25,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2019-11-07 01:05:25,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 2393. [2019-11-07 01:05:25,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2393 states. [2019-11-07 01:05:25,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2393 states to 2393 states and 3467 transitions. [2019-11-07 01:05:25,987 INFO L78 Accepts]: Start accepts. Automaton has 2393 states and 3467 transitions. Word has length 147 [2019-11-07 01:05:25,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:25,987 INFO L462 AbstractCegarLoop]: Abstraction has 2393 states and 3467 transitions. [2019-11-07 01:05:25,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:05:25,988 INFO L276 IsEmpty]: Start isEmpty. Operand 2393 states and 3467 transitions. [2019-11-07 01:05:25,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-07 01:05:25,992 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:25,992 INFO L410 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-11-07 01:05:25,992 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:25,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:25,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1902905006, now seen corresponding path program 1 times [2019-11-07 01:05:25,993 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:25,993 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465526076] [2019-11-07 01:05:25,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:26,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:26,187 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465526076] [2019-11-07 01:05:26,187 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:26,187 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 01:05:26,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229026369] [2019-11-07 01:05:26,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 01:05:26,188 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:26,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 01:05:26,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:05:26,189 INFO L87 Difference]: Start difference. First operand 2393 states and 3467 transitions. Second operand 9 states. [2019-11-07 01:05:27,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:27,746 INFO L93 Difference]: Finished difference Result 8933 states and 13661 transitions. [2019-11-07 01:05:27,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-07 01:05:27,747 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 147 [2019-11-07 01:05:27,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:27,778 INFO L225 Difference]: With dead ends: 8933 [2019-11-07 01:05:27,778 INFO L226 Difference]: Without dead ends: 6742 [2019-11-07 01:05:27,784 INFO L630 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-11-07 01:05:27,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6742 states. [2019-11-07 01:05:28,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6742 to 4124. [2019-11-07 01:05:28,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4124 states. [2019-11-07 01:05:28,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4124 states to 4124 states and 6152 transitions. [2019-11-07 01:05:28,216 INFO L78 Accepts]: Start accepts. Automaton has 4124 states and 6152 transitions. Word has length 147 [2019-11-07 01:05:28,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:28,218 INFO L462 AbstractCegarLoop]: Abstraction has 4124 states and 6152 transitions. [2019-11-07 01:05:28,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 01:05:28,218 INFO L276 IsEmpty]: Start isEmpty. Operand 4124 states and 6152 transitions. [2019-11-07 01:05:28,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-07 01:05:28,225 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:28,225 INFO L410 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-11-07 01:05:28,226 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:28,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:28,226 INFO L82 PathProgramCache]: Analyzing trace with hash 431327938, now seen corresponding path program 1 times [2019-11-07 01:05:28,227 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:28,227 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638724680] [2019-11-07 01:05:28,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:28,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:28,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:28,565 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638724680] [2019-11-07 01:05:28,566 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:28,566 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:05:28,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559343643] [2019-11-07 01:05:28,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:05:28,567 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:28,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:05:28,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:05:28,568 INFO L87 Difference]: Start difference. First operand 4124 states and 6152 transitions. Second operand 4 states. [2019-11-07 01:05:29,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:29,080 INFO L93 Difference]: Finished difference Result 10839 states and 16152 transitions. [2019-11-07 01:05:29,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:05:29,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-11-07 01:05:29,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:29,097 INFO L225 Difference]: With dead ends: 10839 [2019-11-07 01:05:29,097 INFO L226 Difference]: Without dead ends: 6738 [2019-11-07 01:05:29,112 INFO L630 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-11-07 01:05:29,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6738 states. [2019-11-07 01:05:29,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6738 to 6716. [2019-11-07 01:05:29,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6716 states. [2019-11-07 01:05:29,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6716 states to 6716 states and 9913 transitions. [2019-11-07 01:05:29,629 INFO L78 Accepts]: Start accepts. Automaton has 6716 states and 9913 transitions. Word has length 147 [2019-11-07 01:05:29,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:29,630 INFO L462 AbstractCegarLoop]: Abstraction has 6716 states and 9913 transitions. [2019-11-07 01:05:29,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:05:29,630 INFO L276 IsEmpty]: Start isEmpty. Operand 6716 states and 9913 transitions. [2019-11-07 01:05:29,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-07 01:05:29,636 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:29,637 INFO L410 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-11-07 01:05:29,637 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:29,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:29,637 INFO L82 PathProgramCache]: Analyzing trace with hash 569231315, now seen corresponding path program 1 times [2019-11-07 01:05:29,638 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:29,638 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827200848] [2019-11-07 01:05:29,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:29,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:29,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:29,733 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827200848] [2019-11-07 01:05:29,733 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:29,733 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:29,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741985153] [2019-11-07 01:05:29,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:29,734 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:29,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:29,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:29,735 INFO L87 Difference]: Start difference. First operand 6716 states and 9913 transitions. Second operand 3 states. [2019-11-07 01:05:30,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:30,429 INFO L93 Difference]: Finished difference Result 19274 states and 28571 transitions. [2019-11-07 01:05:30,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:30,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-11-07 01:05:30,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:30,460 INFO L225 Difference]: With dead ends: 19274 [2019-11-07 01:05:30,460 INFO L226 Difference]: Without dead ends: 12911 [2019-11-07 01:05:30,472 INFO L630 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-11-07 01:05:30,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12911 states. [2019-11-07 01:05:31,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12911 to 12891. [2019-11-07 01:05:31,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12891 states. [2019-11-07 01:05:31,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12891 states to 12891 states and 18910 transitions. [2019-11-07 01:05:31,435 INFO L78 Accepts]: Start accepts. Automaton has 12891 states and 18910 transitions. Word has length 149 [2019-11-07 01:05:31,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:31,435 INFO L462 AbstractCegarLoop]: Abstraction has 12891 states and 18910 transitions. [2019-11-07 01:05:31,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:31,435 INFO L276 IsEmpty]: Start isEmpty. Operand 12891 states and 18910 transitions. [2019-11-07 01:05:31,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-07 01:05:31,451 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:31,451 INFO L410 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-11-07 01:05:31,451 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:31,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:31,452 INFO L82 PathProgramCache]: Analyzing trace with hash -2112573418, now seen corresponding path program 1 times [2019-11-07 01:05:31,452 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:31,452 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691971902] [2019-11-07 01:05:31,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:31,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:31,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:31,590 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691971902] [2019-11-07 01:05:31,590 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:31,590 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:05:31,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370816891] [2019-11-07 01:05:31,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:05:31,591 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:31,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:05:31,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:05:31,592 INFO L87 Difference]: Start difference. First operand 12891 states and 18910 transitions. Second operand 4 states. [2019-11-07 01:05:32,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:32,194 INFO L93 Difference]: Finished difference Result 20704 states and 30338 transitions. [2019-11-07 01:05:32,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:05:32,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-11-07 01:05:32,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:32,214 INFO L225 Difference]: With dead ends: 20704 [2019-11-07 01:05:32,214 INFO L226 Difference]: Without dead ends: 10439 [2019-11-07 01:05:32,228 INFO L630 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-11-07 01:05:32,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10439 states. [2019-11-07 01:05:32,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10439 to 10439. [2019-11-07 01:05:32,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10439 states. [2019-11-07 01:05:32,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10439 states to 10439 states and 15246 transitions. [2019-11-07 01:05:32,898 INFO L78 Accepts]: Start accepts. Automaton has 10439 states and 15246 transitions. Word has length 149 [2019-11-07 01:05:32,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:32,898 INFO L462 AbstractCegarLoop]: Abstraction has 10439 states and 15246 transitions. [2019-11-07 01:05:32,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:05:32,898 INFO L276 IsEmpty]: Start isEmpty. Operand 10439 states and 15246 transitions. [2019-11-07 01:05:32,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-07 01:05:32,908 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:32,908 INFO L410 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-11-07 01:05:32,909 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:32,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:32,909 INFO L82 PathProgramCache]: Analyzing trace with hash 424881092, now seen corresponding path program 1 times [2019-11-07 01:05:32,909 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:32,909 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622402470] [2019-11-07 01:05:32,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:33,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:33,211 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622402470] [2019-11-07 01:05:33,212 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:33,212 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:05:33,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114147913] [2019-11-07 01:05:33,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:05:33,213 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:33,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:05:33,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:05:33,214 INFO L87 Difference]: Start difference. First operand 10439 states and 15246 transitions. Second operand 4 states. [2019-11-07 01:05:34,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:34,384 INFO L93 Difference]: Finished difference Result 30627 states and 44764 transitions. [2019-11-07 01:05:34,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:05:34,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-11-07 01:05:34,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:34,412 INFO L225 Difference]: With dead ends: 30627 [2019-11-07 01:05:34,413 INFO L226 Difference]: Without dead ends: 20231 [2019-11-07 01:05:34,429 INFO L630 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-11-07 01:05:34,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20231 states. [2019-11-07 01:05:36,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20231 to 20191. [2019-11-07 01:05:36,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20191 states. [2019-11-07 01:05:36,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20191 states to 20191 states and 29305 transitions. [2019-11-07 01:05:36,331 INFO L78 Accepts]: Start accepts. Automaton has 20191 states and 29305 transitions. Word has length 152 [2019-11-07 01:05:36,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:36,331 INFO L462 AbstractCegarLoop]: Abstraction has 20191 states and 29305 transitions. [2019-11-07 01:05:36,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:05:36,331 INFO L276 IsEmpty]: Start isEmpty. Operand 20191 states and 29305 transitions. [2019-11-07 01:05:36,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-07 01:05:36,345 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:36,345 INFO L410 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-11-07 01:05:36,345 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:36,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:36,346 INFO L82 PathProgramCache]: Analyzing trace with hash 598575340, now seen corresponding path program 1 times [2019-11-07 01:05:36,346 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:36,346 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642560773] [2019-11-07 01:05:36,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:36,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:36,402 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642560773] [2019-11-07 01:05:36,402 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:36,402 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:36,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348123173] [2019-11-07 01:05:36,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:36,403 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:36,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:36,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:36,404 INFO L87 Difference]: Start difference. First operand 20191 states and 29305 transitions. Second operand 3 states. [2019-11-07 01:05:38,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:38,621 INFO L93 Difference]: Finished difference Result 60381 states and 87668 transitions. [2019-11-07 01:05:38,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:38,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-11-07 01:05:38,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:38,668 INFO L225 Difference]: With dead ends: 60381 [2019-11-07 01:05:38,668 INFO L226 Difference]: Without dead ends: 40295 [2019-11-07 01:05:38,698 INFO L630 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-11-07 01:05:38,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40295 states. [2019-11-07 01:05:40,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40295 to 20197. [2019-11-07 01:05:40,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20197 states. [2019-11-07 01:05:40,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20197 states to 20197 states and 29311 transitions. [2019-11-07 01:05:40,208 INFO L78 Accepts]: Start accepts. Automaton has 20197 states and 29311 transitions. Word has length 153 [2019-11-07 01:05:40,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:40,208 INFO L462 AbstractCegarLoop]: Abstraction has 20197 states and 29311 transitions. [2019-11-07 01:05:40,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:40,208 INFO L276 IsEmpty]: Start isEmpty. Operand 20197 states and 29311 transitions. [2019-11-07 01:05:40,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-07 01:05:40,220 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:40,220 INFO L410 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-11-07 01:05:40,221 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:40,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:40,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1058530053, now seen corresponding path program 1 times [2019-11-07 01:05:40,221 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:40,221 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545152505] [2019-11-07 01:05:40,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:40,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:40,354 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545152505] [2019-11-07 01:05:40,354 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:40,355 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:05:40,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018295640] [2019-11-07 01:05:40,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:05:40,356 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:40,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:05:40,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:05:40,356 INFO L87 Difference]: Start difference. First operand 20197 states and 29311 transitions. Second operand 4 states. [2019-11-07 01:05:42,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:42,146 INFO L93 Difference]: Finished difference Result 40352 states and 58566 transitions. [2019-11-07 01:05:42,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:05:42,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-11-07 01:05:42,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:42,166 INFO L225 Difference]: With dead ends: 40352 [2019-11-07 01:05:42,167 INFO L226 Difference]: Without dead ends: 20191 [2019-11-07 01:05:42,183 INFO L630 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-11-07 01:05:42,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20191 states. [2019-11-07 01:05:43,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20191 to 20191. [2019-11-07 01:05:43,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20191 states. [2019-11-07 01:05:43,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20191 states to 20191 states and 29299 transitions. [2019-11-07 01:05:43,936 INFO L78 Accepts]: Start accepts. Automaton has 20191 states and 29299 transitions. Word has length 154 [2019-11-07 01:05:43,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:43,936 INFO L462 AbstractCegarLoop]: Abstraction has 20191 states and 29299 transitions. [2019-11-07 01:05:43,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:05:43,936 INFO L276 IsEmpty]: Start isEmpty. Operand 20191 states and 29299 transitions. [2019-11-07 01:05:43,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-07 01:05:43,947 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:43,947 INFO L410 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-11-07 01:05:43,948 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:43,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:43,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1392175557, now seen corresponding path program 1 times [2019-11-07 01:05:43,948 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:43,948 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182937219] [2019-11-07 01:05:43,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:44,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:44,054 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182937219] [2019-11-07 01:05:44,056 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:44,057 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:44,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437730454] [2019-11-07 01:05:44,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:44,058 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:44,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:44,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:44,058 INFO L87 Difference]: Start difference. First operand 20191 states and 29299 transitions. Second operand 3 states.