/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.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:06:23,467 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:06:23,470 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:06:23,489 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:06:23,490 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:06:23,492 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:06:23,493 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:06:23,503 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:06:23,507 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:06:23,511 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:06:23,513 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:06:23,515 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:06:23,515 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:06:23,517 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:06:23,519 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:06:23,521 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:06:23,523 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:06:23,523 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:06:23,525 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:06:23,529 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:06:23,534 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:06:23,537 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:06:23,539 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:06:23,540 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:06:23,542 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:06:23,543 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:06:23,543 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:06:23,545 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:06:23,545 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:06:23,547 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:06:23,548 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:06:23,550 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:06:23,551 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:06:23,552 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:06:23,553 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:06:23,553 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:06:23,554 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:06:23,554 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:06:23,554 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:06:23,555 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:06:23,556 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:06:23,557 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:23,589 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:06:23,595 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:06:23,596 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:06:23,596 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:06:23,597 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:06:23,597 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:06:23,597 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:06:23,597 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:06:23,597 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:06:23,598 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:06:23,598 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:06:23,598 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:06:23,598 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:06:23,598 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:06:23,599 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:06:23,599 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:06:23,599 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:06:23,599 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:06:23,599 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:06:23,600 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:06:23,603 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:06:23,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:06:23,603 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:06:23,604 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:06:23,604 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:06:23,604 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:06:23,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:06:23,604 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:06:23,605 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:23,925 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:06:23,947 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:06:23,951 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:06:23,953 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:06:23,953 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:06:23,954 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.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-07 01:06:24,028 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48d044335/a96f759a280b48669e381b2ea359d50a/FLAG4dded3683 [2019-11-07 01:06:24,617 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:06:24,621 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-07 01:06:24,638 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48d044335/a96f759a280b48669e381b2ea359d50a/FLAG4dded3683 [2019-11-07 01:06:24,831 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48d044335/a96f759a280b48669e381b2ea359d50a [2019-11-07 01:06:24,842 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:06:24,843 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:06:24,845 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:06:24,845 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:06:24,848 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:06:24,850 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:06:24" (1/1) ... [2019-11-07 01:06:24,853 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48f0e6f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:24, skipping insertion in model container [2019-11-07 01:06:24,853 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:06:24" (1/1) ... [2019-11-07 01:06:24,861 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:06:24,943 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:06:25,681 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:06:25,693 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:06:25,902 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:06:25,924 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:06:25,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:25 WrapperNode [2019-11-07 01:06:25,925 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:06:25,926 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:06:25,926 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:06:25,926 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:06:25,941 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:25" (1/1) ... [2019-11-07 01:06:25,942 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:25" (1/1) ... [2019-11-07 01:06:25,961 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:25" (1/1) ... [2019-11-07 01:06:25,961 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:25" (1/1) ... [2019-11-07 01:06:26,023 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:25" (1/1) ... [2019-11-07 01:06:26,054 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:25" (1/1) ... [2019-11-07 01:06:26,066 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:25" (1/1) ... [2019-11-07 01:06:26,081 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:06:26,082 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:06:26,082 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:06:26,082 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:06:26,084 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:25" (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:26,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:06:26,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:06:26,175 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:06:26,175 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:06:26,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 01:06:26,177 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 01:06:26,177 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 01:06:26,178 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 01:06:26,178 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 01:06:26,179 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 01:06:26,179 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-07 01:06:26,180 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-07 01:06:26,180 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-07 01:06:26,181 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 01:06:26,181 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 01:06:26,182 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:06:26,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:06:26,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:06:28,074 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:06:28,074 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 01:06:28,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:06:28 BoogieIcfgContainer [2019-11-07 01:06:28,077 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:06:28,078 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:06:28,078 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:06:28,082 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:06:28,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:06:24" (1/3) ... [2019-11-07 01:06:28,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76491fd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:06:28, skipping insertion in model container [2019-11-07 01:06:28,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:25" (2/3) ... [2019-11-07 01:06:28,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76491fd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:06:28, skipping insertion in model container [2019-11-07 01:06:28,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:06:28" (3/3) ... [2019-11-07 01:06:28,086 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-07 01:06:28,098 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:06:28,107 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-07 01:06:28,120 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-07 01:06:28,152 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:06:28,153 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:06:28,153 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:06:28,153 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:06:28,153 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:06:28,153 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:06:28,153 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:06:28,154 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:06:28,200 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states. [2019-11-07 01:06:28,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-07 01:06:28,230 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:28,231 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:06:28,233 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:28,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:28,240 INFO L82 PathProgramCache]: Analyzing trace with hash 42890573, now seen corresponding path program 1 times [2019-11-07 01:06:28,250 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:28,250 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048634631] [2019-11-07 01:06:28,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:29,366 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:29,367 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048634631] [2019-11-07 01:06:29,368 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:29,368 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:29,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066149969] [2019-11-07 01:06:29,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:29,377 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:29,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:29,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:29,396 INFO L87 Difference]: Start difference. First operand 418 states. Second operand 4 states. [2019-11-07 01:06:29,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:29,673 INFO L93 Difference]: Finished difference Result 1212 states and 2155 transitions. [2019-11-07 01:06:29,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:06:29,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-11-07 01:06:29,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:29,696 INFO L225 Difference]: With dead ends: 1212 [2019-11-07 01:06:29,697 INFO L226 Difference]: Without dead ends: 799 [2019-11-07 01:06:29,703 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:29,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-11-07 01:06:29,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 773. [2019-11-07 01:06:29,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2019-11-07 01:06:29,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1109 transitions. [2019-11-07 01:06:29,853 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1109 transitions. Word has length 152 [2019-11-07 01:06:29,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:29,854 INFO L462 AbstractCegarLoop]: Abstraction has 773 states and 1109 transitions. [2019-11-07 01:06:29,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:29,854 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1109 transitions. [2019-11-07 01:06:29,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-07 01:06:29,865 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:29,865 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:06:29,866 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:29,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:29,867 INFO L82 PathProgramCache]: Analyzing trace with hash -832663523, now seen corresponding path program 1 times [2019-11-07 01:06:29,867 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:29,867 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670801867] [2019-11-07 01:06:29,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:29,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:30,014 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:30,014 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670801867] [2019-11-07 01:06:30,014 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:30,015 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:30,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338556022] [2019-11-07 01:06:30,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:30,017 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:30,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:30,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:30,018 INFO L87 Difference]: Start difference. First operand 773 states and 1109 transitions. Second operand 3 states. [2019-11-07 01:06:30,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:30,097 INFO L93 Difference]: Finished difference Result 2273 states and 3257 transitions. [2019-11-07 01:06:30,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:30,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-11-07 01:06:30,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:30,107 INFO L225 Difference]: With dead ends: 2273 [2019-11-07 01:06:30,108 INFO L226 Difference]: Without dead ends: 1532 [2019-11-07 01:06:30,111 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:30,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2019-11-07 01:06:30,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 775. [2019-11-07 01:06:30,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2019-11-07 01:06:30,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1111 transitions. [2019-11-07 01:06:30,159 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1111 transitions. Word has length 153 [2019-11-07 01:06:30,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:30,159 INFO L462 AbstractCegarLoop]: Abstraction has 775 states and 1111 transitions. [2019-11-07 01:06:30,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:30,160 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1111 transitions. [2019-11-07 01:06:30,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-07 01:06:30,163 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:30,163 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:30,164 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:30,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:30,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1878298894, now seen corresponding path program 1 times [2019-11-07 01:06:30,165 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:30,165 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144528355] [2019-11-07 01:06:30,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:30,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:30,379 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:30,380 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144528355] [2019-11-07 01:06:30,380 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:30,380 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:30,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334820909] [2019-11-07 01:06:30,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:30,382 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:30,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:30,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:30,383 INFO L87 Difference]: Start difference. First operand 775 states and 1111 transitions. Second operand 4 states. [2019-11-07 01:06:30,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:30,477 INFO L93 Difference]: Finished difference Result 1532 states and 2197 transitions. [2019-11-07 01:06:30,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:30,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-11-07 01:06:30,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:30,484 INFO L225 Difference]: With dead ends: 1532 [2019-11-07 01:06:30,485 INFO L226 Difference]: Without dead ends: 775 [2019-11-07 01:06:30,495 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:30,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-11-07 01:06:30,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 774. [2019-11-07 01:06:30,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-11-07 01:06:30,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1108 transitions. [2019-11-07 01:06:30,537 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1108 transitions. Word has length 154 [2019-11-07 01:06:30,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:30,538 INFO L462 AbstractCegarLoop]: Abstraction has 774 states and 1108 transitions. [2019-11-07 01:06:30,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:30,538 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1108 transitions. [2019-11-07 01:06:30,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-07 01:06:30,540 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:30,541 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:30,541 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:30,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:30,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1636071890, now seen corresponding path program 1 times [2019-11-07 01:06:30,542 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:30,542 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168321869] [2019-11-07 01:06:30,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:30,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:30,752 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:30,752 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168321869] [2019-11-07 01:06:30,753 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:30,753 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:30,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852731927] [2019-11-07 01:06:30,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:30,755 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:30,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:30,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:30,756 INFO L87 Difference]: Start difference. First operand 774 states and 1108 transitions. Second operand 4 states. [2019-11-07 01:06:30,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:30,852 INFO L93 Difference]: Finished difference Result 1535 states and 2199 transitions. [2019-11-07 01:06:30,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:30,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-11-07 01:06:30,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:30,860 INFO L225 Difference]: With dead ends: 1535 [2019-11-07 01:06:30,860 INFO L226 Difference]: Without dead ends: 772 [2019-11-07 01:06:30,863 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:30,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2019-11-07 01:06:30,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 772. [2019-11-07 01:06:30,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2019-11-07 01:06:30,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1104 transitions. [2019-11-07 01:06:30,914 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1104 transitions. Word has length 154 [2019-11-07 01:06:30,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:30,915 INFO L462 AbstractCegarLoop]: Abstraction has 772 states and 1104 transitions. [2019-11-07 01:06:30,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:30,915 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1104 transitions. [2019-11-07 01:06:30,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-07 01:06:30,919 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:30,919 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:30,920 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:30,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:30,920 INFO L82 PathProgramCache]: Analyzing trace with hash -674126987, now seen corresponding path program 1 times [2019-11-07 01:06:30,921 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:30,922 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143611785] [2019-11-07 01:06:30,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:30,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:31,145 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:31,146 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143611785] [2019-11-07 01:06:31,146 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:31,146 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:31,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899176403] [2019-11-07 01:06:31,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:31,148 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:31,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:31,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:31,149 INFO L87 Difference]: Start difference. First operand 772 states and 1104 transitions. Second operand 3 states. [2019-11-07 01:06:31,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:31,328 INFO L93 Difference]: Finished difference Result 1732 states and 2480 transitions. [2019-11-07 01:06:31,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:31,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-11-07 01:06:31,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:31,344 INFO L225 Difference]: With dead ends: 1732 [2019-11-07 01:06:31,344 INFO L226 Difference]: Without dead ends: 1156 [2019-11-07 01:06:31,346 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:31,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2019-11-07 01:06:31,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1130. [2019-11-07 01:06:31,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2019-11-07 01:06:31,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1602 transitions. [2019-11-07 01:06:31,447 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1602 transitions. Word has length 154 [2019-11-07 01:06:31,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:31,447 INFO L462 AbstractCegarLoop]: Abstraction has 1130 states and 1602 transitions. [2019-11-07 01:06:31,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:31,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1602 transitions. [2019-11-07 01:06:31,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-07 01:06:31,451 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:31,452 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:31,452 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:31,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:31,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1140766677, now seen corresponding path program 1 times [2019-11-07 01:06:31,453 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:31,453 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499331117] [2019-11-07 01:06:31,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:31,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:31,544 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:31,545 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499331117] [2019-11-07 01:06:31,546 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:31,546 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:31,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421476748] [2019-11-07 01:06:31,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:31,547 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:31,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:31,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:31,547 INFO L87 Difference]: Start difference. First operand 1130 states and 1602 transitions. Second operand 3 states. [2019-11-07 01:06:31,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:31,674 INFO L93 Difference]: Finished difference Result 2442 states and 3547 transitions. [2019-11-07 01:06:31,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:31,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-11-07 01:06:31,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:31,682 INFO L225 Difference]: With dead ends: 2442 [2019-11-07 01:06:31,682 INFO L226 Difference]: Without dead ends: 1501 [2019-11-07 01:06:31,684 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:31,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2019-11-07 01:06:31,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1342. [2019-11-07 01:06:31,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-11-07 01:06:31,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1945 transitions. [2019-11-07 01:06:31,761 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1945 transitions. Word has length 156 [2019-11-07 01:06:31,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:31,762 INFO L462 AbstractCegarLoop]: Abstraction has 1342 states and 1945 transitions. [2019-11-07 01:06:31,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:31,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1945 transitions. [2019-11-07 01:06:31,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-07 01:06:31,770 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:31,770 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:31,770 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:31,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:31,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1542236816, now seen corresponding path program 1 times [2019-11-07 01:06:31,772 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:31,773 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055792257] [2019-11-07 01:06:31,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:31,894 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:31,895 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055792257] [2019-11-07 01:06:31,895 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:31,895 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:31,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897468821] [2019-11-07 01:06:31,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:31,896 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:31,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:31,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:31,897 INFO L87 Difference]: Start difference. First operand 1342 states and 1945 transitions. Second operand 3 states. [2019-11-07 01:06:32,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:32,078 INFO L93 Difference]: Finished difference Result 2987 states and 4450 transitions. [2019-11-07 01:06:32,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:32,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-07 01:06:32,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:32,090 INFO L225 Difference]: With dead ends: 2987 [2019-11-07 01:06:32,090 INFO L226 Difference]: Without dead ends: 1918 [2019-11-07 01:06:32,094 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:32,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1918 states. [2019-11-07 01:06:32,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1918 to 1719. [2019-11-07 01:06:32,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2019-11-07 01:06:32,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2553 transitions. [2019-11-07 01:06:32,229 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2553 transitions. Word has length 158 [2019-11-07 01:06:32,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:32,230 INFO L462 AbstractCegarLoop]: Abstraction has 1719 states and 2553 transitions. [2019-11-07 01:06:32,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:32,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2553 transitions. [2019-11-07 01:06:32,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-07 01:06:32,236 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:32,236 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] [2019-11-07 01:06:32,236 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:32,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:32,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1399172685, now seen corresponding path program 1 times [2019-11-07 01:06:32,238 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:32,238 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549231385] [2019-11-07 01:06:32,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:32,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:32,545 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:32,546 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549231385] [2019-11-07 01:06:32,546 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:32,546 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:06:32,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265603427] [2019-11-07 01:06:32,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:06:32,547 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:32,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:06:32,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:06:32,548 INFO L87 Difference]: Start difference. First operand 1719 states and 2553 transitions. Second operand 5 states. [2019-11-07 01:06:33,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:33,356 INFO L93 Difference]: Finished difference Result 4371 states and 6633 transitions. [2019-11-07 01:06:33,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:06:33,358 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2019-11-07 01:06:33,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:33,374 INFO L225 Difference]: With dead ends: 4371 [2019-11-07 01:06:33,375 INFO L226 Difference]: Without dead ends: 2835 [2019-11-07 01:06:33,381 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-07 01:06:33,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2835 states. [2019-11-07 01:06:33,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2835 to 2833. [2019-11-07 01:06:33,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2833 states. [2019-11-07 01:06:33,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2833 states to 2833 states and 4278 transitions. [2019-11-07 01:06:33,625 INFO L78 Accepts]: Start accepts. Automaton has 2833 states and 4278 transitions. Word has length 159 [2019-11-07 01:06:33,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:33,626 INFO L462 AbstractCegarLoop]: Abstraction has 2833 states and 4278 transitions. [2019-11-07 01:06:33,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:06:33,627 INFO L276 IsEmpty]: Start isEmpty. Operand 2833 states and 4278 transitions. [2019-11-07 01:06:33,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-07 01:06:33,631 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:33,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] [2019-11-07 01:06:33,632 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:33,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:33,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1519156504, now seen corresponding path program 1 times [2019-11-07 01:06:33,632 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:33,633 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945435993] [2019-11-07 01:06:33,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:33,867 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:33,867 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945435993] [2019-11-07 01:06:33,867 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:33,867 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:33,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212062210] [2019-11-07 01:06:33,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:33,868 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:33,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:33,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:33,869 INFO L87 Difference]: Start difference. First operand 2833 states and 4278 transitions. Second operand 4 states. [2019-11-07 01:06:34,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:34,373 INFO L93 Difference]: Finished difference Result 7338 states and 11090 transitions. [2019-11-07 01:06:34,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:34,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-11-07 01:06:34,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:34,402 INFO L225 Difference]: With dead ends: 7338 [2019-11-07 01:06:34,402 INFO L226 Difference]: Without dead ends: 4536 [2019-11-07 01:06:34,413 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:34,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4536 states. [2019-11-07 01:06:34,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4536 to 4513. [2019-11-07 01:06:34,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4513 states. [2019-11-07 01:06:34,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4513 states to 4513 states and 6769 transitions. [2019-11-07 01:06:34,759 INFO L78 Accepts]: Start accepts. Automaton has 4513 states and 6769 transitions. Word has length 159 [2019-11-07 01:06:34,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:34,759 INFO L462 AbstractCegarLoop]: Abstraction has 4513 states and 6769 transitions. [2019-11-07 01:06:34,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:34,761 INFO L276 IsEmpty]: Start isEmpty. Operand 4513 states and 6769 transitions. [2019-11-07 01:06:34,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-07 01:06:34,768 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:34,769 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:34,769 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:34,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:34,770 INFO L82 PathProgramCache]: Analyzing trace with hash 779025742, now seen corresponding path program 1 times [2019-11-07 01:06:34,770 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:34,770 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061858137] [2019-11-07 01:06:34,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:34,882 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:34,882 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061858137] [2019-11-07 01:06:34,883 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:34,883 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:34,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168957999] [2019-11-07 01:06:34,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:34,885 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:34,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:34,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:34,885 INFO L87 Difference]: Start difference. First operand 4513 states and 6769 transitions. Second operand 3 states. [2019-11-07 01:06:35,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:35,494 INFO L93 Difference]: Finished difference Result 11128 states and 16749 transitions. [2019-11-07 01:06:35,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:35,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-11-07 01:06:35,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:35,541 INFO L225 Difference]: With dead ends: 11128 [2019-11-07 01:06:35,542 INFO L226 Difference]: Without dead ends: 6987 [2019-11-07 01:06:35,560 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:35,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6987 states. [2019-11-07 01:06:36,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6987 to 6966. [2019-11-07 01:06:36,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6966 states. [2019-11-07 01:06:36,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6966 states to 6966 states and 10335 transitions. [2019-11-07 01:06:36,042 INFO L78 Accepts]: Start accepts. Automaton has 6966 states and 10335 transitions. Word has length 161 [2019-11-07 01:06:36,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:36,043 INFO L462 AbstractCegarLoop]: Abstraction has 6966 states and 10335 transitions. [2019-11-07 01:06:36,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:36,043 INFO L276 IsEmpty]: Start isEmpty. Operand 6966 states and 10335 transitions. [2019-11-07 01:06:36,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-07 01:06:36,050 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:36,050 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] [2019-11-07 01:06:36,050 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:36,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:36,051 INFO L82 PathProgramCache]: Analyzing trace with hash -169339511, now seen corresponding path program 1 times [2019-11-07 01:06:36,051 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:36,051 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335350175] [2019-11-07 01:06:36,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:36,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:36,209 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335350175] [2019-11-07 01:06:36,209 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:36,210 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:36,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310780482] [2019-11-07 01:06:36,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:36,210 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:36,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:36,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:36,211 INFO L87 Difference]: Start difference. First operand 6966 states and 10335 transitions. Second operand 3 states. [2019-11-07 01:06:37,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:37,056 INFO L93 Difference]: Finished difference Result 17929 states and 27059 transitions. [2019-11-07 01:06:37,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:37,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-11-07 01:06:37,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:37,114 INFO L225 Difference]: With dead ends: 17929 [2019-11-07 01:06:37,115 INFO L226 Difference]: Without dead ends: 11304 [2019-11-07 01:06:37,130 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:37,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11304 states. [2019-11-07 01:06:37,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11304 to 10364. [2019-11-07 01:06:37,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10364 states. [2019-11-07 01:06:37,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10364 states to 10364 states and 15734 transitions. [2019-11-07 01:06:37,851 INFO L78 Accepts]: Start accepts. Automaton has 10364 states and 15734 transitions. Word has length 165 [2019-11-07 01:06:37,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:37,852 INFO L462 AbstractCegarLoop]: Abstraction has 10364 states and 15734 transitions. [2019-11-07 01:06:37,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:37,852 INFO L276 IsEmpty]: Start isEmpty. Operand 10364 states and 15734 transitions. [2019-11-07 01:06:37,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-07 01:06:37,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:37,859 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] [2019-11-07 01:06:37,860 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:37,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:37,860 INFO L82 PathProgramCache]: Analyzing trace with hash 628802590, now seen corresponding path program 1 times [2019-11-07 01:06:37,860 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:37,861 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415317239] [2019-11-07 01:06:37,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:37,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:38,085 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:38,086 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415317239] [2019-11-07 01:06:38,086 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:38,086 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 01:06:38,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228670674] [2019-11-07 01:06:38,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 01:06:38,087 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:38,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 01:06:38,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-07 01:06:38,088 INFO L87 Difference]: Start difference. First operand 10364 states and 15734 transitions. Second operand 8 states. [2019-11-07 01:06:41,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:41,306 INFO L93 Difference]: Finished difference Result 41170 states and 63107 transitions. [2019-11-07 01:06:41,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-07 01:06:41,306 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 166 [2019-11-07 01:06:41,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:41,392 INFO L225 Difference]: With dead ends: 41170 [2019-11-07 01:06:41,393 INFO L226 Difference]: Without dead ends: 31221 [2019-11-07 01:06:41,420 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-11-07 01:06:41,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31221 states. [2019-11-07 01:06:42,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31221 to 16912. [2019-11-07 01:06:42,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16912 states. [2019-11-07 01:06:43,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16912 states to 16912 states and 25456 transitions. [2019-11-07 01:06:43,790 INFO L78 Accepts]: Start accepts. Automaton has 16912 states and 25456 transitions. Word has length 166 [2019-11-07 01:06:43,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:43,791 INFO L462 AbstractCegarLoop]: Abstraction has 16912 states and 25456 transitions. [2019-11-07 01:06:43,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 01:06:43,791 INFO L276 IsEmpty]: Start isEmpty. Operand 16912 states and 25456 transitions. [2019-11-07 01:06:43,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-07 01:06:43,802 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:43,802 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] [2019-11-07 01:06:43,803 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:43,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:43,804 INFO L82 PathProgramCache]: Analyzing trace with hash -961444745, now seen corresponding path program 1 times [2019-11-07 01:06:43,804 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:43,804 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332275976] [2019-11-07 01:06:43,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:43,986 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,987 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332275976] [2019-11-07 01:06:43,987 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:43,987 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:43,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386418109] [2019-11-07 01:06:43,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:43,989 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:43,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:43,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:43,990 INFO L87 Difference]: Start difference. First operand 16912 states and 25456 transitions. Second operand 4 states. [2019-11-07 01:06:45,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:45,448 INFO L93 Difference]: Finished difference Result 47014 states and 70541 transitions. [2019-11-07 01:06:45,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:45,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-11-07 01:06:45,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:45,519 INFO L225 Difference]: With dead ends: 47014 [2019-11-07 01:06:45,519 INFO L226 Difference]: Without dead ends: 30145 [2019-11-07 01:06:45,559 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:45,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30145 states. [2019-11-07 01:06:47,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30145 to 30107. [2019-11-07 01:06:47,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30107 states. [2019-11-07 01:06:47,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30107 states to 30107 states and 44602 transitions. [2019-11-07 01:06:47,694 INFO L78 Accepts]: Start accepts. Automaton has 30107 states and 44602 transitions. Word has length 166 [2019-11-07 01:06:47,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:47,694 INFO L462 AbstractCegarLoop]: Abstraction has 30107 states and 44602 transitions. [2019-11-07 01:06:47,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:47,695 INFO L276 IsEmpty]: Start isEmpty. Operand 30107 states and 44602 transitions. [2019-11-07 01:06:47,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-07 01:06:47,709 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:47,710 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,710 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:47,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:47,710 INFO L82 PathProgramCache]: Analyzing trace with hash 155010953, now seen corresponding path program 1 times [2019-11-07 01:06:47,711 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:47,711 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621111659] [2019-11-07 01:06:47,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:47,783 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:47,784 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621111659] [2019-11-07 01:06:47,784 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:47,784 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:47,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39439484] [2019-11-07 01:06:47,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:47,786 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:47,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:47,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:47,786 INFO L87 Difference]: Start difference. First operand 30107 states and 44602 transitions. Second operand 3 states. [2019-11-07 01:06:51,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:51,065 INFO L93 Difference]: Finished difference Result 90119 states and 133549 transitions. [2019-11-07 01:06:51,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:51,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-11-07 01:06:51,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:51,160 INFO L225 Difference]: With dead ends: 90119 [2019-11-07 01:06:51,160 INFO L226 Difference]: Without dead ends: 60122 [2019-11-07 01:06:51,216 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:51,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60122 states. [2019-11-07 01:06:53,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60122 to 30113. [2019-11-07 01:06:53,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30113 states. [2019-11-07 01:06:53,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30113 states to 30113 states and 44608 transitions. [2019-11-07 01:06:53,353 INFO L78 Accepts]: Start accepts. Automaton has 30113 states and 44608 transitions. Word has length 167 [2019-11-07 01:06:53,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:53,354 INFO L462 AbstractCegarLoop]: Abstraction has 30113 states and 44608 transitions. [2019-11-07 01:06:53,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:53,354 INFO L276 IsEmpty]: Start isEmpty. Operand 30113 states and 44608 transitions. [2019-11-07 01:06:53,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-07 01:06:53,366 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:53,366 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:06:53,366 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:53,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:53,367 INFO L82 PathProgramCache]: Analyzing trace with hash -899511549, now seen corresponding path program 1 times [2019-11-07 01:06:53,367 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:53,367 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029483680] [2019-11-07 01:06:53,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:53,476 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:53,476 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029483680] [2019-11-07 01:06:53,476 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:53,476 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:53,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611432139] [2019-11-07 01:06:53,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:53,477 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:53,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:53,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:53,478 INFO L87 Difference]: Start difference. First operand 30113 states and 44608 transitions. Second operand 3 states. [2019-11-07 01:06:55,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:55,945 INFO L93 Difference]: Finished difference Result 79104 states and 117010 transitions. [2019-11-07 01:06:55,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:55,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-11-07 01:06:55,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:56,029 INFO L225 Difference]: With dead ends: 79104 [2019-11-07 01:06:56,029 INFO L226 Difference]: Without dead ends: 49750 [2019-11-07 01:06:56,070 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:56,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49750 states.