/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_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:06:36,505 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:06:36,507 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:06:36,519 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:06:36,519 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:06:36,520 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:06:36,522 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:06:36,523 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:06:36,525 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:06:36,526 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:06:36,527 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:06:36,528 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:06:36,528 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:06:36,529 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:06:36,530 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:06:36,531 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:06:36,532 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:06:36,533 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:06:36,535 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:06:36,537 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:06:36,539 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:06:36,540 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:06:36,541 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:06:36,542 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:06:36,544 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:06:36,545 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:06:36,545 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:06:36,546 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:06:36,546 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:06:36,547 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:06:36,548 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:06:36,548 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:06:36,549 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:06:36,550 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:06:36,551 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:06:36,551 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:06:36,552 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:06:36,552 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:06:36,552 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:06:36,553 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:06:36,554 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:06:36,555 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:06:36,569 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:06:36,569 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:06:36,571 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:06:36,571 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:06:36,571 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:06:36,571 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:06:36,571 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:06:36,572 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:06:36,572 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:06:36,572 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:06:36,572 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:06:36,572 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:06:36,573 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:06:36,573 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:06:36,573 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:06:36,573 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:06:36,573 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:06:36,574 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:06:36,574 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:06:36,574 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:06:36,574 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:06:36,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:06:36,575 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:06:36,575 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:06:36,575 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:06:36,575 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:06:36,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:06:36,576 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:06:36,576 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:06:36,852 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:06:36,865 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:06:36,870 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:06:36,871 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:06:36,872 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:06:36,872 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-07 01:06:36,947 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d1a116f3/a652694f614e48bbb4c77d8b5993c37b/FLAG1de28f647 [2019-11-07 01:06:37,513 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:06:37,514 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-07 01:06:37,529 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d1a116f3/a652694f614e48bbb4c77d8b5993c37b/FLAG1de28f647 [2019-11-07 01:06:37,746 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d1a116f3/a652694f614e48bbb4c77d8b5993c37b [2019-11-07 01:06:37,756 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:06:37,758 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:06:37,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:06:37,759 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:06:37,763 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:06:37,764 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:06:37" (1/1) ... [2019-11-07 01:06:37,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6eaaf5ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:37, skipping insertion in model container [2019-11-07 01:06:37,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:06:37" (1/1) ... [2019-11-07 01:06:37,775 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:06:37,863 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:06:38,556 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:06:38,585 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:06:39,017 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:06:39,040 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:06:39,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:39 WrapperNode [2019-11-07 01:06:39,041 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:06:39,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:06:39,043 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:06:39,043 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:06:39,054 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:39" (1/1) ... [2019-11-07 01:06:39,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:39" (1/1) ... [2019-11-07 01:06:39,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:39" (1/1) ... [2019-11-07 01:06:39,075 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:39" (1/1) ... [2019-11-07 01:06:39,127 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:39" (1/1) ... [2019-11-07 01:06:39,150 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:39" (1/1) ... [2019-11-07 01:06:39,156 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:39" (1/1) ... [2019-11-07 01:06:39,167 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:06:39,167 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:06:39,168 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:06:39,168 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:06:39,169 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:39" (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:06:39,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:06:39,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:06:39,237 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:06:39,237 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:06:39,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 01:06:39,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-11-07 01:06:39,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 01:06:39,240 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 01:06:39,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 01:06:39,241 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 01:06:39,241 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 01:06:39,241 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-07 01:06:39,241 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-07 01:06:39,242 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-07 01:06:39,243 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 01:06:39,243 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 01:06:39,244 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:06:39,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:06:39,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:06:40,924 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:06:40,925 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 01:06:40,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:06:40 BoogieIcfgContainer [2019-11-07 01:06:40,928 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:06:40,929 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:06:40,929 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:06:40,934 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:06:40,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:06:37" (1/3) ... [2019-11-07 01:06:40,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1074245e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:06:40, skipping insertion in model container [2019-11-07 01:06:40,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:39" (2/3) ... [2019-11-07 01:06:40,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1074245e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:06:40, skipping insertion in model container [2019-11-07 01:06:40,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:06:40" (3/3) ... [2019-11-07 01:06:40,943 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-07 01:06:40,957 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:06:40,984 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-07 01:06:40,998 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-07 01:06:41,030 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:06:41,030 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:06:41,030 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:06:41,030 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:06:41,031 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:06:41,031 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:06:41,031 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:06:41,031 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:06:41,066 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states. [2019-11-07 01:06:41,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-07 01:06:41,098 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:41,099 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:06:41,101 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:41,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:41,131 INFO L82 PathProgramCache]: Analyzing trace with hash 598173108, now seen corresponding path program 1 times [2019-11-07 01:06:41,142 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:41,142 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683868710] [2019-11-07 01:06:41,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:42,088 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:06:42,089 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683868710] [2019-11-07 01:06:42,089 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:42,090 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:42,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471563369] [2019-11-07 01:06:42,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:42,099 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:42,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:42,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:42,118 INFO L87 Difference]: Start difference. First operand 429 states. Second operand 4 states. [2019-11-07 01:06:42,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:42,373 INFO L93 Difference]: Finished difference Result 1245 states and 2212 transitions. [2019-11-07 01:06:42,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:06:42,375 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-11-07 01:06:42,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:42,406 INFO L225 Difference]: With dead ends: 1245 [2019-11-07 01:06:42,407 INFO L226 Difference]: Without dead ends: 821 [2019-11-07 01:06:42,414 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:06:42,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2019-11-07 01:06:42,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 794. [2019-11-07 01:06:42,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2019-11-07 01:06:42,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1136 transitions. [2019-11-07 01:06:42,536 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1136 transitions. Word has length 154 [2019-11-07 01:06:42,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:42,537 INFO L462 AbstractCegarLoop]: Abstraction has 794 states and 1136 transitions. [2019-11-07 01:06:42,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:42,537 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1136 transitions. [2019-11-07 01:06:42,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-07 01:06:42,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:42,543 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, 1] [2019-11-07 01:06:42,543 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:42,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:42,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1172332246, now seen corresponding path program 1 times [2019-11-07 01:06:42,544 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:42,544 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476571820] [2019-11-07 01:06:42,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:42,682 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:06:42,682 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476571820] [2019-11-07 01:06:42,683 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:42,683 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:42,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912184188] [2019-11-07 01:06:42,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:42,686 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:42,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:42,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:42,687 INFO L87 Difference]: Start difference. First operand 794 states and 1136 transitions. Second operand 3 states. [2019-11-07 01:06:42,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:42,766 INFO L93 Difference]: Finished difference Result 2336 states and 3338 transitions. [2019-11-07 01:06:42,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:42,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-11-07 01:06:42,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:42,776 INFO L225 Difference]: With dead ends: 2336 [2019-11-07 01:06:42,776 INFO L226 Difference]: Without dead ends: 1574 [2019-11-07 01:06:42,780 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:06:42,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2019-11-07 01:06:42,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 796. [2019-11-07 01:06:42,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2019-11-07 01:06:42,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1138 transitions. [2019-11-07 01:06:42,836 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1138 transitions. Word has length 155 [2019-11-07 01:06:42,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:42,838 INFO L462 AbstractCegarLoop]: Abstraction has 796 states and 1138 transitions. [2019-11-07 01:06:42,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:42,838 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1138 transitions. [2019-11-07 01:06:42,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-07 01:06:42,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:42,845 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, 1, 1] [2019-11-07 01:06:42,845 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:42,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:42,847 INFO L82 PathProgramCache]: Analyzing trace with hash 501625459, now seen corresponding path program 1 times [2019-11-07 01:06:42,848 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:42,848 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331236703] [2019-11-07 01:06:42,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:42,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:43,087 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:06:43,087 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331236703] [2019-11-07 01:06:43,088 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:43,088 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:43,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309310091] [2019-11-07 01:06:43,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:43,092 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:43,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:43,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:43,098 INFO L87 Difference]: Start difference. First operand 796 states and 1138 transitions. Second operand 3 states. [2019-11-07 01:06:43,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:43,253 INFO L93 Difference]: Finished difference Result 2139 states and 3061 transitions. [2019-11-07 01:06:43,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:43,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-11-07 01:06:43,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:43,269 INFO L225 Difference]: With dead ends: 2139 [2019-11-07 01:06:43,278 INFO L226 Difference]: Without dead ends: 1540 [2019-11-07 01:06:43,281 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:06:43,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2019-11-07 01:06:43,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 1513. [2019-11-07 01:06:43,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1513 states. [2019-11-07 01:06:43,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2153 transitions. [2019-11-07 01:06:43,391 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2153 transitions. Word has length 156 [2019-11-07 01:06:43,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:43,392 INFO L462 AbstractCegarLoop]: Abstraction has 1513 states and 2153 transitions. [2019-11-07 01:06:43,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:43,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2153 transitions. [2019-11-07 01:06:43,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-07 01:06:43,397 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:43,397 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, 1, 1] [2019-11-07 01:06:43,398 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:43,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:43,398 INFO L82 PathProgramCache]: Analyzing trace with hash 104654224, now seen corresponding path program 1 times [2019-11-07 01:06:43,399 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:43,399 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746965227] [2019-11-07 01:06:43,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:43,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:43,662 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:06:43,662 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746965227] [2019-11-07 01:06:43,663 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:43,663 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:43,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58674295] [2019-11-07 01:06:43,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:43,664 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:43,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:43,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:43,665 INFO L87 Difference]: Start difference. First operand 1513 states and 2153 transitions. Second operand 4 states. [2019-11-07 01:06:43,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:43,764 INFO L93 Difference]: Finished difference Result 2489 states and 3549 transitions. [2019-11-07 01:06:43,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:43,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-11-07 01:06:43,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:43,773 INFO L225 Difference]: With dead ends: 2489 [2019-11-07 01:06:43,773 INFO L226 Difference]: Without dead ends: 1161 [2019-11-07 01:06:43,776 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:06:43,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2019-11-07 01:06:43,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1161. [2019-11-07 01:06:43,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2019-11-07 01:06:43,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1645 transitions. [2019-11-07 01:06:43,837 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1645 transitions. Word has length 156 [2019-11-07 01:06:43,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:43,838 INFO L462 AbstractCegarLoop]: Abstraction has 1161 states and 1645 transitions. [2019-11-07 01:06:43,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:43,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1645 transitions. [2019-11-07 01:06:43,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-07 01:06:43,842 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:43,842 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, 1, 1, 1, 1] [2019-11-07 01:06:43,842 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:43,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:43,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1233167963, now seen corresponding path program 1 times [2019-11-07 01:06:43,843 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:43,844 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287010638] [2019-11-07 01:06:43,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:43,967 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:06:43,968 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287010638] [2019-11-07 01:06:43,968 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:43,968 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:43,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927624404] [2019-11-07 01:06:43,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:43,969 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:43,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:43,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:43,970 INFO L87 Difference]: Start difference. First operand 1161 states and 1645 transitions. Second operand 3 states. [2019-11-07 01:06:44,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:44,115 INFO L93 Difference]: Finished difference Result 2522 states and 3657 transitions. [2019-11-07 01:06:44,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:44,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-07 01:06:44,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:44,128 INFO L225 Difference]: With dead ends: 2522 [2019-11-07 01:06:44,128 INFO L226 Difference]: Without dead ends: 1547 [2019-11-07 01:06:44,132 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:06:44,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2019-11-07 01:06:44,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1382. [2019-11-07 01:06:44,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1382 states. [2019-11-07 01:06:44,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 2003 transitions. [2019-11-07 01:06:44,245 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 2003 transitions. Word has length 158 [2019-11-07 01:06:44,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:44,247 INFO L462 AbstractCegarLoop]: Abstraction has 1382 states and 2003 transitions. [2019-11-07 01:06:44,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:44,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 2003 transitions. [2019-11-07 01:06:44,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-07 01:06:44,252 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:44,253 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, 1, 1, 1, 1, 1, 1] [2019-11-07 01:06:44,253 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:44,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:44,254 INFO L82 PathProgramCache]: Analyzing trace with hash -866694497, now seen corresponding path program 1 times [2019-11-07 01:06:44,254 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:44,254 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520173778] [2019-11-07 01:06:44,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:44,406 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:06:44,406 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520173778] [2019-11-07 01:06:44,407 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:44,408 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:44,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688333514] [2019-11-07 01:06:44,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:44,409 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:44,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:44,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:44,410 INFO L87 Difference]: Start difference. First operand 1382 states and 2003 transitions. Second operand 3 states. [2019-11-07 01:06:44,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:44,651 INFO L93 Difference]: Finished difference Result 3110 states and 4621 transitions. [2019-11-07 01:06:44,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:44,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-11-07 01:06:44,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:44,665 INFO L225 Difference]: With dead ends: 3110 [2019-11-07 01:06:44,666 INFO L226 Difference]: Without dead ends: 1998 [2019-11-07 01:06:44,670 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:06:44,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2019-11-07 01:06:44,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1771. [2019-11-07 01:06:44,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1771 states. [2019-11-07 01:06:44,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2632 transitions. [2019-11-07 01:06:44,828 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2632 transitions. Word has length 160 [2019-11-07 01:06:44,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:44,830 INFO L462 AbstractCegarLoop]: Abstraction has 1771 states and 2632 transitions. [2019-11-07 01:06:44,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:44,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2632 transitions. [2019-11-07 01:06:44,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-07 01:06:44,842 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:44,842 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:06:44,843 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:44,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:44,846 INFO L82 PathProgramCache]: Analyzing trace with hash 753095009, now seen corresponding path program 1 times [2019-11-07 01:06:44,846 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:44,847 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029908723] [2019-11-07 01:06:44,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:44,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:45,320 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:06:45,321 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029908723] [2019-11-07 01:06:45,321 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:45,321 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-07 01:06:45,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558562107] [2019-11-07 01:06:45,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-07 01:06:45,322 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:45,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-07 01:06:45,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-11-07 01:06:45,324 INFO L87 Difference]: Start difference. First operand 1771 states and 2632 transitions. Second operand 13 states. [2019-11-07 01:06:49,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:49,692 INFO L93 Difference]: Finished difference Result 14490 states and 22590 transitions. [2019-11-07 01:06:49,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-07 01:06:49,693 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 161 [2019-11-07 01:06:49,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:49,759 INFO L225 Difference]: With dead ends: 14490 [2019-11-07 01:06:49,759 INFO L226 Difference]: Without dead ends: 12938 [2019-11-07 01:06:49,765 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=358, Invalid=832, Unknown=0, NotChecked=0, Total=1190 [2019-11-07 01:06:49,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12938 states. [2019-11-07 01:06:50,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12938 to 7935. [2019-11-07 01:06:50,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7935 states. [2019-11-07 01:06:50,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7935 states to 7935 states and 12108 transitions. [2019-11-07 01:06:50,313 INFO L78 Accepts]: Start accepts. Automaton has 7935 states and 12108 transitions. Word has length 161 [2019-11-07 01:06:50,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:50,314 INFO L462 AbstractCegarLoop]: Abstraction has 7935 states and 12108 transitions. [2019-11-07 01:06:50,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-07 01:06:50,314 INFO L276 IsEmpty]: Start isEmpty. Operand 7935 states and 12108 transitions. [2019-11-07 01:06:50,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-07 01:06:50,323 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:50,323 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:06:50,324 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:50,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:50,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1464453224, now seen corresponding path program 1 times [2019-11-07 01:06:50,324 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:50,324 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531428834] [2019-11-07 01:06:50,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:50,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:50,705 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:06:50,706 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531428834] [2019-11-07 01:06:50,706 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:50,706 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 01:06:50,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754648636] [2019-11-07 01:06:50,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 01:06:50,707 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:50,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 01:06:50,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:06:50,708 INFO L87 Difference]: Start difference. First operand 7935 states and 12108 transitions. Second operand 9 states. [2019-11-07 01:06:51,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:51,610 INFO L93 Difference]: Finished difference Result 11115 states and 17157 transitions. [2019-11-07 01:06:51,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 01:06:51,610 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 161 [2019-11-07 01:06:51,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:51,628 INFO L225 Difference]: With dead ends: 11115 [2019-11-07 01:06:51,629 INFO L226 Difference]: Without dead ends: 3905 [2019-11-07 01:06:51,642 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-11-07 01:06:51,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3905 states. [2019-11-07 01:06:51,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3905 to 2924. [2019-11-07 01:06:51,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2924 states. [2019-11-07 01:06:51,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2924 states to 2924 states and 4420 transitions. [2019-11-07 01:06:51,891 INFO L78 Accepts]: Start accepts. Automaton has 2924 states and 4420 transitions. Word has length 161 [2019-11-07 01:06:51,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:51,891 INFO L462 AbstractCegarLoop]: Abstraction has 2924 states and 4420 transitions. [2019-11-07 01:06:51,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 01:06:51,892 INFO L276 IsEmpty]: Start isEmpty. Operand 2924 states and 4420 transitions. [2019-11-07 01:06:51,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-07 01:06:51,895 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:51,895 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:06:51,896 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:51,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:51,896 INFO L82 PathProgramCache]: Analyzing trace with hash -217483962, now seen corresponding path program 1 times [2019-11-07 01:06:51,897 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:51,897 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751756640] [2019-11-07 01:06:51,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:52,093 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:06:52,093 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751756640] [2019-11-07 01:06:52,094 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:52,094 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 01:06:52,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130070169] [2019-11-07 01:06:52,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 01:06:52,096 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:52,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 01:06:52,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:06:52,097 INFO L87 Difference]: Start difference. First operand 2924 states and 4420 transitions. Second operand 9 states. [2019-11-07 01:06:53,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:53,827 INFO L93 Difference]: Finished difference Result 14166 states and 21917 transitions. [2019-11-07 01:06:53,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-07 01:06:53,827 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 161 [2019-11-07 01:06:53,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:53,854 INFO L225 Difference]: With dead ends: 14166 [2019-11-07 01:06:53,855 INFO L226 Difference]: Without dead ends: 11461 [2019-11-07 01:06:53,862 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:06:53,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11461 states. [2019-11-07 01:06:54,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11461 to 7578. [2019-11-07 01:06:54,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7578 states. [2019-11-07 01:06:54,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7578 states to 7578 states and 11480 transitions. [2019-11-07 01:06:54,374 INFO L78 Accepts]: Start accepts. Automaton has 7578 states and 11480 transitions. Word has length 161 [2019-11-07 01:06:54,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:54,374 INFO L462 AbstractCegarLoop]: Abstraction has 7578 states and 11480 transitions. [2019-11-07 01:06:54,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 01:06:54,374 INFO L276 IsEmpty]: Start isEmpty. Operand 7578 states and 11480 transitions. [2019-11-07 01:06:54,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-07 01:06:54,380 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:54,380 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:06:54,381 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:54,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:54,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1859935101, now seen corresponding path program 1 times [2019-11-07 01:06:54,381 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:54,381 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913693576] [2019-11-07 01:06:54,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:54,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:54,546 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:06:54,546 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913693576] [2019-11-07 01:06:54,546 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:54,547 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:54,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320599482] [2019-11-07 01:06:54,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:54,548 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:54,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:54,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:54,548 INFO L87 Difference]: Start difference. First operand 7578 states and 11480 transitions. Second operand 4 states. [2019-11-07 01:06:55,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:55,105 INFO L93 Difference]: Finished difference Result 14483 states and 22537 transitions. [2019-11-07 01:06:55,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:55,106 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-11-07 01:06:55,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:55,123 INFO L225 Difference]: With dead ends: 14483 [2019-11-07 01:06:55,123 INFO L226 Difference]: Without dead ends: 9190 [2019-11-07 01:06:55,136 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:55,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9190 states. [2019-11-07 01:06:55,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9190 to 9188. [2019-11-07 01:06:55,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9188 states. [2019-11-07 01:06:55,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9188 states to 9188 states and 14008 transitions. [2019-11-07 01:06:55,623 INFO L78 Accepts]: Start accepts. Automaton has 9188 states and 14008 transitions. Word has length 161 [2019-11-07 01:06:55,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:55,624 INFO L462 AbstractCegarLoop]: Abstraction has 9188 states and 14008 transitions. [2019-11-07 01:06:55,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:55,624 INFO L276 IsEmpty]: Start isEmpty. Operand 9188 states and 14008 transitions. [2019-11-07 01:06:55,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-07 01:06:55,630 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:55,631 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:06:55,631 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:55,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:55,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1831416783, now seen corresponding path program 1 times [2019-11-07 01:06:55,631 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:55,632 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890685030] [2019-11-07 01:06:55,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:55,895 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:06:55,896 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890685030] [2019-11-07 01:06:55,896 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:55,896 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:55,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947006540] [2019-11-07 01:06:55,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:55,897 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:55,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:55,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:55,898 INFO L87 Difference]: Start difference. First operand 9188 states and 14008 transitions. Second operand 4 states. [2019-11-07 01:06:57,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:57,014 INFO L93 Difference]: Finished difference Result 24236 states and 36925 transitions. [2019-11-07 01:06:57,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:57,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-11-07 01:06:57,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:57,043 INFO L225 Difference]: With dead ends: 24236 [2019-11-07 01:06:57,043 INFO L226 Difference]: Without dead ends: 15071 [2019-11-07 01:06:57,056 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:06:57,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15071 states. [2019-11-07 01:06:58,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15071 to 15048. [2019-11-07 01:06:58,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15048 states. [2019-11-07 01:06:58,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15048 states to 15048 states and 22725 transitions. [2019-11-07 01:06:58,103 INFO L78 Accepts]: Start accepts. Automaton has 15048 states and 22725 transitions. Word has length 161 [2019-11-07 01:06:58,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:58,103 INFO L462 AbstractCegarLoop]: Abstraction has 15048 states and 22725 transitions. [2019-11-07 01:06:58,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:58,104 INFO L276 IsEmpty]: Start isEmpty. Operand 15048 states and 22725 transitions. [2019-11-07 01:06:58,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-07 01:06:58,112 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:58,112 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:06:58,112 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:58,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:58,113 INFO L82 PathProgramCache]: Analyzing trace with hash 668472032, now seen corresponding path program 1 times [2019-11-07 01:06:58,113 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:58,113 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222008244] [2019-11-07 01:06:58,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:58,209 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:06:58,209 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222008244] [2019-11-07 01:06:58,209 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:58,210 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:58,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381701222] [2019-11-07 01:06:58,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:58,210 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:58,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:58,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:58,211 INFO L87 Difference]: Start difference. First operand 15048 states and 22725 transitions. Second operand 3 states. [2019-11-07 01:06:59,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:59,992 INFO L93 Difference]: Finished difference Result 43634 states and 66065 transitions. [2019-11-07 01:06:59,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:59,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-11-07 01:06:59,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:00,050 INFO L225 Difference]: With dead ends: 43634 [2019-11-07 01:07:00,051 INFO L226 Difference]: Without dead ends: 28974 [2019-11-07 01:07:00,080 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:07:00,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28974 states. [2019-11-07 01:07:02,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28974 to 28953. [2019-11-07 01:07:02,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28953 states. [2019-11-07 01:07:02,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28953 states to 28953 states and 43506 transitions. [2019-11-07 01:07:02,376 INFO L78 Accepts]: Start accepts. Automaton has 28953 states and 43506 transitions. Word has length 163 [2019-11-07 01:07:02,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:02,376 INFO L462 AbstractCegarLoop]: Abstraction has 28953 states and 43506 transitions. [2019-11-07 01:07:02,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:07:02,376 INFO L276 IsEmpty]: Start isEmpty. Operand 28953 states and 43506 transitions. [2019-11-07 01:07:02,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-07 01:07:02,391 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:02,391 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:02,391 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:02,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:02,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1439315485, now seen corresponding path program 1 times [2019-11-07 01:07:02,392 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:02,392 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255277862] [2019-11-07 01:07:02,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:02,534 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:07:02,535 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255277862] [2019-11-07 01:07:02,535 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:02,535 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:02,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000637805] [2019-11-07 01:07:02,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:02,536 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:02,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:02,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:02,538 INFO L87 Difference]: Start difference. First operand 28953 states and 43506 transitions. Second operand 4 states. [2019-11-07 01:07:03,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:03,781 INFO L93 Difference]: Finished difference Result 46825 states and 70222 transitions. [2019-11-07 01:07:03,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:07:03,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-11-07 01:07:03,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:03,820 INFO L225 Difference]: With dead ends: 46825 [2019-11-07 01:07:03,820 INFO L226 Difference]: Without dead ends: 23474 [2019-11-07 01:07:03,850 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:07:03,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23474 states. [2019-11-07 01:07:05,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23474 to 23474. [2019-11-07 01:07:05,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23474 states. [2019-11-07 01:07:05,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23474 states to 23474 states and 35144 transitions. [2019-11-07 01:07:05,998 INFO L78 Accepts]: Start accepts. Automaton has 23474 states and 35144 transitions. Word has length 163 [2019-11-07 01:07:05,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:05,998 INFO L462 AbstractCegarLoop]: Abstraction has 23474 states and 35144 transitions. [2019-11-07 01:07:05,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:05,998 INFO L276 IsEmpty]: Start isEmpty. Operand 23474 states and 35144 transitions. [2019-11-07 01:07:06,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-07 01:07:06,015 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:06,015 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:06,016 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:06,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:06,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1713355484, now seen corresponding path program 1 times [2019-11-07 01:07:06,016 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:06,017 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140956142] [2019-11-07 01:07:06,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:06,096 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:07:06,096 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140956142] [2019-11-07 01:07:06,096 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:06,097 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:07:06,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798594899] [2019-11-07 01:07:06,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:07:06,097 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:06,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:07:06,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:06,098 INFO L87 Difference]: Start difference. First operand 23474 states and 35144 transitions. Second operand 3 states. [2019-11-07 01:07:08,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:08,668 INFO L93 Difference]: Finished difference Result 62336 states and 94477 transitions. [2019-11-07 01:07:08,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:07:08,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-11-07 01:07:08,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:08,719 INFO L225 Difference]: With dead ends: 62336 [2019-11-07 01:07:08,719 INFO L226 Difference]: Without dead ends: 39198 [2019-11-07 01:07:08,757 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:07:08,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39198 states. [2019-11-07 01:07:11,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39198 to 35602. [2019-11-07 01:07:11,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35602 states. [2019-11-07 01:07:11,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35602 states to 35602 states and 54441 transitions. [2019-11-07 01:07:11,275 INFO L78 Accepts]: Start accepts. Automaton has 35602 states and 54441 transitions. Word has length 167 [2019-11-07 01:07:11,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:11,275 INFO L462 AbstractCegarLoop]: Abstraction has 35602 states and 54441 transitions. [2019-11-07 01:07:11,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:07:11,275 INFO L276 IsEmpty]: Start isEmpty. Operand 35602 states and 54441 transitions. [2019-11-07 01:07:11,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-07 01:07:11,285 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:11,285 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:11,285 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:11,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:11,286 INFO L82 PathProgramCache]: Analyzing trace with hash 2046979909, now seen corresponding path program 1 times [2019-11-07 01:07:11,286 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:11,286 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697109438] [2019-11-07 01:07:11,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:11,612 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:07:11,612 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697109438] [2019-11-07 01:07:11,613 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:11,613 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:11,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414207362] [2019-11-07 01:07:11,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:11,614 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:11,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:11,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:11,614 INFO L87 Difference]: Start difference. First operand 35602 states and 54441 transitions. Second operand 4 states.