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.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:24:48,094 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:24:48,096 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:24:48,108 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:24:48,108 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:24:48,109 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:24:48,111 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:24:48,113 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:24:48,115 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:24:48,116 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:24:48,117 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:24:48,118 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:24:48,118 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:24:48,119 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:24:48,120 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:24:48,122 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:24:48,123 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:24:48,124 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:24:48,126 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:24:48,128 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:24:48,130 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:24:48,131 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:24:48,133 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:24:48,134 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:24:48,137 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:24:48,137 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:24:48,137 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:24:48,138 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:24:48,139 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:24:48,140 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:24:48,140 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:24:48,141 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:24:48,142 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:24:48,143 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:24:48,148 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:24:48,148 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:24:48,149 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:24:48,149 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:24:48,149 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:24:48,150 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:24:48,151 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:24:48,152 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:24:48,184 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:24:48,185 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:24:48,186 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:24:48,186 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:24:48,187 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:24:48,187 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:24:48,187 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:24:48,187 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:24:48,188 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:24:48,188 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:24:48,189 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:24:48,189 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:24:48,190 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:24:48,190 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:24:48,190 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:24:48,191 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:24:48,191 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:24:48,191 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:24:48,191 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:24:48,191 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:24:48,192 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:24:48,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:24:48,192 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:24:48,193 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:24:48,193 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:24:48,193 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:24:48,193 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:24:48,193 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:24:48,194 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 21:24:48,505 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:24:48,519 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:24:48,522 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:24:48,524 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:24:48,524 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:24:48,525 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.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-13 21:24:48,586 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e9426e7b/4f6cd117bf7643e08c0cea00ece5407d/FLAGe5b2fe534 [2019-10-13 21:24:49,143 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:24:49,144 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-13 21:24:49,160 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e9426e7b/4f6cd117bf7643e08c0cea00ece5407d/FLAGe5b2fe534 [2019-10-13 21:24:49,386 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e9426e7b/4f6cd117bf7643e08c0cea00ece5407d [2019-10-13 21:24:49,397 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:24:49,399 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:24:49,400 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:24:49,400 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:24:49,403 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:24:49,405 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:24:49" (1/1) ... [2019-10-13 21:24:49,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@169dc683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:49, skipping insertion in model container [2019-10-13 21:24:49,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:24:49" (1/1) ... [2019-10-13 21:24:49,416 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:24:49,506 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:24:50,182 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:24:50,212 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:24:50,660 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:24:50,682 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:24:50,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:50 WrapperNode [2019-10-13 21:24:50,683 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:24:50,684 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:24:50,684 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:24:50,684 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:24:50,701 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:50" (1/1) ... [2019-10-13 21:24:50,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:50" (1/1) ... [2019-10-13 21:24:50,736 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:50" (1/1) ... [2019-10-13 21:24:50,736 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:50" (1/1) ... [2019-10-13 21:24:50,794 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:50" (1/1) ... [2019-10-13 21:24:50,826 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:50" (1/1) ... [2019-10-13 21:24:50,837 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:50" (1/1) ... [2019-10-13 21:24:50,851 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:24:50,852 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:24:50,852 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:24:50,852 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:24:50,853 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:24:50,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:24:50,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:24:50,945 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:24:50,945 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:24:50,946 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 21:24:50,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-13 21:24:50,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 21:24:50,947 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 21:24:50,948 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:24:50,948 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 21:24:50,948 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 21:24:50,949 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 21:24:50,949 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 21:24:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 21:24:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 21:24:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 21:24:50,953 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:24:50,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:24:50,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:24:52,857 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:24:52,858 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 21:24:52,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:24:52 BoogieIcfgContainer [2019-10-13 21:24:52,862 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:24:52,864 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:24:52,864 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:24:52,868 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:24:52,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:24:49" (1/3) ... [2019-10-13 21:24:52,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6361559d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:24:52, skipping insertion in model container [2019-10-13 21:24:52,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:50" (2/3) ... [2019-10-13 21:24:52,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6361559d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:24:52, skipping insertion in model container [2019-10-13 21:24:52,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:24:52" (3/3) ... [2019-10-13 21:24:52,880 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-13 21:24:52,894 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:24:52,920 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-10-13 21:24:52,932 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-10-13 21:24:52,964 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:24:52,965 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:24:52,965 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:24:52,965 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:24:52,965 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:24:52,966 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:24:52,966 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:24:52,966 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:24:52,997 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states. [2019-10-13 21:24:53,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-13 21:24:53,015 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:53,016 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:53,019 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:53,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:53,027 INFO L82 PathProgramCache]: Analyzing trace with hash 257827157, now seen corresponding path program 1 times [2019-10-13 21:24:53,039 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:53,039 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379235063] [2019-10-13 21:24:53,039 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:53,040 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:53,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:53,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:53,819 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379235063] [2019-10-13 21:24:53,820 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:53,820 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:53,821 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208216177] [2019-10-13 21:24:53,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:53,828 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:53,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:53,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:53,846 INFO L87 Difference]: Start difference. First operand 416 states. Second operand 3 states. [2019-10-13 21:24:54,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:54,066 INFO L93 Difference]: Finished difference Result 759 states and 1331 transitions. [2019-10-13 21:24:54,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:54,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-10-13 21:24:54,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:54,101 INFO L225 Difference]: With dead ends: 759 [2019-10-13 21:24:54,102 INFO L226 Difference]: Without dead ends: 590 [2019-10-13 21:24:54,110 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:54,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-13 21:24:54,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 588. [2019-10-13 21:24:54,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-10-13 21:24:54,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 857 transitions. [2019-10-13 21:24:54,236 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 857 transitions. Word has length 151 [2019-10-13 21:24:54,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:54,237 INFO L462 AbstractCegarLoop]: Abstraction has 588 states and 857 transitions. [2019-10-13 21:24:54,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:54,237 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 857 transitions. [2019-10-13 21:24:54,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-13 21:24:54,241 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:54,241 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:54,242 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:54,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:54,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1201169525, now seen corresponding path program 1 times [2019-10-13 21:24:54,243 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:54,243 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545474383] [2019-10-13 21:24:54,243 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:54,243 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:54,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:54,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:54,429 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545474383] [2019-10-13 21:24:54,429 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:54,430 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:54,430 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690750314] [2019-10-13 21:24:54,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:54,432 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:54,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:54,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:54,433 INFO L87 Difference]: Start difference. First operand 588 states and 857 transitions. Second operand 3 states. [2019-10-13 21:24:54,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:54,685 INFO L93 Difference]: Finished difference Result 1187 states and 1790 transitions. [2019-10-13 21:24:54,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:54,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-10-13 21:24:54,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:54,697 INFO L225 Difference]: With dead ends: 1187 [2019-10-13 21:24:54,697 INFO L226 Difference]: Without dead ends: 964 [2019-10-13 21:24:54,705 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:54,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2019-10-13 21:24:54,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 962. [2019-10-13 21:24:54,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2019-10-13 21:24:54,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1427 transitions. [2019-10-13 21:24:54,758 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1427 transitions. Word has length 151 [2019-10-13 21:24:54,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:54,761 INFO L462 AbstractCegarLoop]: Abstraction has 962 states and 1427 transitions. [2019-10-13 21:24:54,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:54,762 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1427 transitions. [2019-10-13 21:24:54,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-13 21:24:54,770 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:54,771 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:54,771 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:54,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:54,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1200830901, now seen corresponding path program 1 times [2019-10-13 21:24:54,773 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:54,773 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951118545] [2019-10-13 21:24:54,773 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:54,773 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:54,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:55,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:55,235 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951118545] [2019-10-13 21:24:55,236 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:55,239 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:55,239 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925690672] [2019-10-13 21:24:55,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:55,242 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:55,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:55,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:55,243 INFO L87 Difference]: Start difference. First operand 962 states and 1427 transitions. Second operand 4 states. [2019-10-13 21:24:55,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:55,449 INFO L93 Difference]: Finished difference Result 2828 states and 4188 transitions. [2019-10-13 21:24:55,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:55,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-10-13 21:24:55,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:55,491 INFO L225 Difference]: With dead ends: 2828 [2019-10-13 21:24:55,491 INFO L226 Difference]: Without dead ends: 1879 [2019-10-13 21:24:55,495 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:55,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2019-10-13 21:24:55,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1837. [2019-10-13 21:24:55,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1837 states. [2019-10-13 21:24:55,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2717 transitions. [2019-10-13 21:24:55,602 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2717 transitions. Word has length 151 [2019-10-13 21:24:55,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:55,603 INFO L462 AbstractCegarLoop]: Abstraction has 1837 states and 2717 transitions. [2019-10-13 21:24:55,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:55,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2717 transitions. [2019-10-13 21:24:55,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-13 21:24:55,607 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:55,607 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:55,608 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:55,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:55,608 INFO L82 PathProgramCache]: Analyzing trace with hash -958267271, now seen corresponding path program 1 times [2019-10-13 21:24:55,609 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:55,609 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926915204] [2019-10-13 21:24:55,609 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:55,610 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:55,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:55,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:55,698 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926915204] [2019-10-13 21:24:55,698 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:55,698 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:55,698 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59679572] [2019-10-13 21:24:55,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:55,699 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:55,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:55,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:55,700 INFO L87 Difference]: Start difference. First operand 1837 states and 2717 transitions. Second operand 3 states. [2019-10-13 21:24:55,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:55,906 INFO L93 Difference]: Finished difference Result 5465 states and 8081 transitions. [2019-10-13 21:24:55,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:55,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-10-13 21:24:55,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:55,932 INFO L225 Difference]: With dead ends: 5465 [2019-10-13 21:24:55,933 INFO L226 Difference]: Without dead ends: 3660 [2019-10-13 21:24:55,938 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:55,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3660 states. [2019-10-13 21:24:56,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3660 to 1839. [2019-10-13 21:24:56,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1839 states. [2019-10-13 21:24:56,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1839 states and 2719 transitions. [2019-10-13 21:24:56,113 INFO L78 Accepts]: Start accepts. Automaton has 1839 states and 2719 transitions. Word has length 152 [2019-10-13 21:24:56,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:56,114 INFO L462 AbstractCegarLoop]: Abstraction has 1839 states and 2719 transitions. [2019-10-13 21:24:56,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:56,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2719 transitions. [2019-10-13 21:24:56,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-13 21:24:56,120 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:56,121 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:56,121 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:56,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:56,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1744211523, now seen corresponding path program 1 times [2019-10-13 21:24:56,122 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:56,123 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558042888] [2019-10-13 21:24:56,123 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:56,124 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:56,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:56,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:56,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:56,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558042888] [2019-10-13 21:24:56,374 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:56,374 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:56,374 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872744975] [2019-10-13 21:24:56,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:56,375 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:56,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:56,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:56,376 INFO L87 Difference]: Start difference. First operand 1839 states and 2719 transitions. Second operand 3 states. [2019-10-13 21:24:56,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:56,617 INFO L93 Difference]: Finished difference Result 5196 states and 7684 transitions. [2019-10-13 21:24:56,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:56,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-10-13 21:24:56,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:56,639 INFO L225 Difference]: With dead ends: 5196 [2019-10-13 21:24:56,639 INFO L226 Difference]: Without dead ends: 3554 [2019-10-13 21:24:56,645 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:56,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3554 states. [2019-10-13 21:24:56,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3554 to 3512. [2019-10-13 21:24:56,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3512 states. [2019-10-13 21:24:56,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3512 states to 3512 states and 5152 transitions. [2019-10-13 21:24:56,863 INFO L78 Accepts]: Start accepts. Automaton has 3512 states and 5152 transitions. Word has length 153 [2019-10-13 21:24:56,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:56,864 INFO L462 AbstractCegarLoop]: Abstraction has 3512 states and 5152 transitions. [2019-10-13 21:24:56,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:56,864 INFO L276 IsEmpty]: Start isEmpty. Operand 3512 states and 5152 transitions. [2019-10-13 21:24:56,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-13 21:24:56,870 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:56,870 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:56,871 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:56,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:56,871 INFO L82 PathProgramCache]: Analyzing trace with hash 294713414, now seen corresponding path program 1 times [2019-10-13 21:24:56,871 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:56,872 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643978565] [2019-10-13 21:24:56,872 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:56,872 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:56,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:57,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:57,110 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643978565] [2019-10-13 21:24:57,110 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:57,110 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:57,110 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426825390] [2019-10-13 21:24:57,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:57,111 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:57,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:57,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:57,115 INFO L87 Difference]: Start difference. First operand 3512 states and 5152 transitions. Second operand 4 states. [2019-10-13 21:24:57,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:57,302 INFO L93 Difference]: Finished difference Result 6017 states and 8836 transitions. [2019-10-13 21:24:57,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:57,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-10-13 21:24:57,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:57,320 INFO L225 Difference]: With dead ends: 6017 [2019-10-13 21:24:57,320 INFO L226 Difference]: Without dead ends: 2690 [2019-10-13 21:24:57,328 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:57,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2690 states. [2019-10-13 21:24:57,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2690 to 2690. [2019-10-13 21:24:57,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2690 states. [2019-10-13 21:24:57,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2690 states to 2690 states and 3933 transitions. [2019-10-13 21:24:57,487 INFO L78 Accepts]: Start accepts. Automaton has 2690 states and 3933 transitions. Word has length 153 [2019-10-13 21:24:57,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:57,487 INFO L462 AbstractCegarLoop]: Abstraction has 2690 states and 3933 transitions. [2019-10-13 21:24:57,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:57,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2690 states and 3933 transitions. [2019-10-13 21:24:57,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-13 21:24:57,492 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:57,493 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:57,493 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:57,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:57,494 INFO L82 PathProgramCache]: Analyzing trace with hash -2083946363, now seen corresponding path program 1 times [2019-10-13 21:24:57,494 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:57,494 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243422726] [2019-10-13 21:24:57,494 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:57,494 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:57,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:57,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:57,579 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243422726] [2019-10-13 21:24:57,579 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:57,579 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:57,579 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31495982] [2019-10-13 21:24:57,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:57,580 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:57,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:57,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:57,581 INFO L87 Difference]: Start difference. First operand 2690 states and 3933 transitions. Second operand 3 states. [2019-10-13 21:24:57,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:57,805 INFO L93 Difference]: Finished difference Result 6148 states and 9216 transitions. [2019-10-13 21:24:57,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:57,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-10-13 21:24:57,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:57,825 INFO L225 Difference]: With dead ends: 6148 [2019-10-13 21:24:57,825 INFO L226 Difference]: Without dead ends: 3644 [2019-10-13 21:24:57,832 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:57,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3644 states. [2019-10-13 21:24:58,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3644 to 3558. [2019-10-13 21:24:58,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3558 states. [2019-10-13 21:24:58,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 3558 states and 5350 transitions. [2019-10-13 21:24:58,081 INFO L78 Accepts]: Start accepts. Automaton has 3558 states and 5350 transitions. Word has length 154 [2019-10-13 21:24:58,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:58,081 INFO L462 AbstractCegarLoop]: Abstraction has 3558 states and 5350 transitions. [2019-10-13 21:24:58,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:58,081 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 5350 transitions. [2019-10-13 21:24:58,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-13 21:24:58,086 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:58,086 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:58,087 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:58,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:58,087 INFO L82 PathProgramCache]: Analyzing trace with hash -564593784, now seen corresponding path program 1 times [2019-10-13 21:24:58,087 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:58,088 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466507217] [2019-10-13 21:24:58,088 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:58,088 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:58,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:58,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:58,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466507217] [2019-10-13 21:24:58,462 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:58,462 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-13 21:24:58,462 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727144992] [2019-10-13 21:24:58,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-13 21:24:58,463 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:58,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-13 21:24:58,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:24:58,465 INFO L87 Difference]: Start difference. First operand 3558 states and 5350 transitions. Second operand 13 states. [2019-10-13 21:25:03,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:03,796 INFO L93 Difference]: Finished difference Result 18347 states and 28459 transitions. [2019-10-13 21:25:03,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-13 21:25:03,797 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 157 [2019-10-13 21:25:03,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:03,871 INFO L225 Difference]: With dead ends: 18347 [2019-10-13 21:25:03,871 INFO L226 Difference]: Without dead ends: 15008 [2019-10-13 21:25:03,881 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=358, Invalid=832, Unknown=0, NotChecked=0, Total=1190 [2019-10-13 21:25:03,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15008 states. [2019-10-13 21:25:04,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15008 to 9082. [2019-10-13 21:25:04,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9082 states. [2019-10-13 21:25:04,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9082 states to 9082 states and 13835 transitions. [2019-10-13 21:25:04,580 INFO L78 Accepts]: Start accepts. Automaton has 9082 states and 13835 transitions. Word has length 157 [2019-10-13 21:25:04,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:04,581 INFO L462 AbstractCegarLoop]: Abstraction has 9082 states and 13835 transitions. [2019-10-13 21:25:04,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-13 21:25:04,581 INFO L276 IsEmpty]: Start isEmpty. Operand 9082 states and 13835 transitions. [2019-10-13 21:25:04,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-13 21:25:04,589 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:04,589 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:04,590 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:04,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:04,590 INFO L82 PathProgramCache]: Analyzing trace with hash -253521854, now seen corresponding path program 1 times [2019-10-13 21:25:04,590 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:04,590 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022810930] [2019-10-13 21:25:04,591 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:04,591 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:04,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:04,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:04,880 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022810930] [2019-10-13 21:25:04,883 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:04,883 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:25:04,884 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95346439] [2019-10-13 21:25:04,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:25:04,885 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:04,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:25:04,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:25:04,886 INFO L87 Difference]: Start difference. First operand 9082 states and 13835 transitions. Second operand 9 states. [2019-10-13 21:25:06,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:06,041 INFO L93 Difference]: Finished difference Result 12850 states and 19769 transitions. [2019-10-13 21:25:06,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:25:06,042 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 157 [2019-10-13 21:25:06,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:06,056 INFO L225 Difference]: With dead ends: 12850 [2019-10-13 21:25:06,056 INFO L226 Difference]: Without dead ends: 4668 [2019-10-13 21:25:06,161 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:25:06,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4668 states. [2019-10-13 21:25:06,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4668 to 3558. [2019-10-13 21:25:06,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3558 states. [2019-10-13 21:25:06,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 3558 states and 5335 transitions. [2019-10-13 21:25:06,338 INFO L78 Accepts]: Start accepts. Automaton has 3558 states and 5335 transitions. Word has length 157 [2019-10-13 21:25:06,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:06,339 INFO L462 AbstractCegarLoop]: Abstraction has 3558 states and 5335 transitions. [2019-10-13 21:25:06,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:25:06,339 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 5335 transitions. [2019-10-13 21:25:06,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-13 21:25:06,343 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:06,343 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:06,344 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:06,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:06,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1981028429, now seen corresponding path program 1 times [2019-10-13 21:25:06,347 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:06,347 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065137292] [2019-10-13 21:25:06,347 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:06,347 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:06,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:06,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:06,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:06,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065137292] [2019-10-13 21:25:06,569 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:06,570 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:25:06,570 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215409389] [2019-10-13 21:25:06,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:25:06,571 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:06,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:25:06,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:25:06,572 INFO L87 Difference]: Start difference. First operand 3558 states and 5335 transitions. Second operand 9 states. [2019-10-13 21:25:08,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:08,491 INFO L93 Difference]: Finished difference Result 16721 states and 25805 transitions. [2019-10-13 21:25:08,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 21:25:08,492 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 157 [2019-10-13 21:25:08,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:08,527 INFO L225 Difference]: With dead ends: 16721 [2019-10-13 21:25:08,528 INFO L226 Difference]: Without dead ends: 13382 [2019-10-13 21:25:08,537 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:25:08,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13382 states. [2019-10-13 21:25:09,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13382 to 8886. [2019-10-13 21:25:09,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8886 states. [2019-10-13 21:25:09,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8886 states to 8886 states and 13413 transitions. [2019-10-13 21:25:09,186 INFO L78 Accepts]: Start accepts. Automaton has 8886 states and 13413 transitions. Word has length 157 [2019-10-13 21:25:09,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:09,186 INFO L462 AbstractCegarLoop]: Abstraction has 8886 states and 13413 transitions. [2019-10-13 21:25:09,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:25:09,186 INFO L276 IsEmpty]: Start isEmpty. Operand 8886 states and 13413 transitions. [2019-10-13 21:25:09,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-13 21:25:09,193 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:09,193 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:09,194 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:09,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:09,194 INFO L82 PathProgramCache]: Analyzing trace with hash -2002866937, now seen corresponding path program 1 times [2019-10-13 21:25:09,194 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:09,195 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354919935] [2019-10-13 21:25:09,195 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:09,195 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:09,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:09,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:09,357 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354919935] [2019-10-13 21:25:09,357 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:09,358 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:09,358 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321770148] [2019-10-13 21:25:09,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:09,359 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:09,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:09,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:09,359 INFO L87 Difference]: Start difference. First operand 8886 states and 13413 transitions. Second operand 4 states. [2019-10-13 21:25:09,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:09,875 INFO L93 Difference]: Finished difference Result 16603 states and 25814 transitions. [2019-10-13 21:25:09,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:09,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-10-13 21:25:09,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:09,898 INFO L225 Difference]: With dead ends: 16603 [2019-10-13 21:25:09,898 INFO L226 Difference]: Without dead ends: 10662 [2019-10-13 21:25:09,913 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:09,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10662 states. [2019-10-13 21:25:10,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10662 to 10660. [2019-10-13 21:25:10,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10660 states. [2019-10-13 21:25:10,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10660 states to 10660 states and 16201 transitions. [2019-10-13 21:25:10,611 INFO L78 Accepts]: Start accepts. Automaton has 10660 states and 16201 transitions. Word has length 157 [2019-10-13 21:25:10,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:10,611 INFO L462 AbstractCegarLoop]: Abstraction has 10660 states and 16201 transitions. [2019-10-13 21:25:10,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:10,611 INFO L276 IsEmpty]: Start isEmpty. Operand 10660 states and 16201 transitions. [2019-10-13 21:25:10,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-13 21:25:10,617 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:10,617 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:10,617 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:10,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:10,618 INFO L82 PathProgramCache]: Analyzing trace with hash -286073469, now seen corresponding path program 1 times [2019-10-13 21:25:10,618 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:10,618 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158246507] [2019-10-13 21:25:10,618 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:10,619 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:10,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:10,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:10,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:10,788 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158246507] [2019-10-13 21:25:10,788 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:10,788 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:10,788 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535606296] [2019-10-13 21:25:10,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:10,789 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:10,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:10,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:10,789 INFO L87 Difference]: Start difference. First operand 10660 states and 16201 transitions. Second operand 4 states. [2019-10-13 21:25:12,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:12,001 INFO L93 Difference]: Finished difference Result 28048 states and 42570 transitions. [2019-10-13 21:25:12,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:12,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-10-13 21:25:12,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:12,042 INFO L225 Difference]: With dead ends: 28048 [2019-10-13 21:25:12,042 INFO L226 Difference]: Without dead ends: 17411 [2019-10-13 21:25:12,064 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:12,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17411 states. [2019-10-13 21:25:12,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17411 to 17377. [2019-10-13 21:25:12,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17377 states. [2019-10-13 21:25:12,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17377 states to 17377 states and 26114 transitions. [2019-10-13 21:25:12,974 INFO L78 Accepts]: Start accepts. Automaton has 17377 states and 26114 transitions. Word has length 157 [2019-10-13 21:25:12,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:12,974 INFO L462 AbstractCegarLoop]: Abstraction has 17377 states and 26114 transitions. [2019-10-13 21:25:12,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:12,974 INFO L276 IsEmpty]: Start isEmpty. Operand 17377 states and 26114 transitions. [2019-10-13 21:25:12,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-13 21:25:12,980 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:12,981 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:12,981 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:12,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:12,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1553675807, now seen corresponding path program 1 times [2019-10-13 21:25:12,982 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:12,982 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101918831] [2019-10-13 21:25:12,982 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:12,982 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:12,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:13,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:13,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:13,076 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101918831] [2019-10-13 21:25:13,076 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:13,077 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:25:13,077 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527613109] [2019-10-13 21:25:13,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:25:13,078 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:13,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:25:13,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:25:13,078 INFO L87 Difference]: Start difference. First operand 17377 states and 26114 transitions. Second operand 3 states. [2019-10-13 21:25:14,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:14,936 INFO L93 Difference]: Finished difference Result 46780 states and 70277 transitions. [2019-10-13 21:25:14,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:25:14,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-10-13 21:25:14,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:14,978 INFO L225 Difference]: With dead ends: 46780 [2019-10-13 21:25:14,978 INFO L226 Difference]: Without dead ends: 29799 [2019-10-13 21:25:15,002 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:25:15,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29799 states. [2019-10-13 21:25:16,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29799 to 29769. [2019-10-13 21:25:16,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29769 states. [2019-10-13 21:25:16,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29769 states to 29769 states and 44199 transitions. [2019-10-13 21:25:16,764 INFO L78 Accepts]: Start accepts. Automaton has 29769 states and 44199 transitions. Word has length 159 [2019-10-13 21:25:16,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:16,764 INFO L462 AbstractCegarLoop]: Abstraction has 29769 states and 44199 transitions. [2019-10-13 21:25:16,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:25:16,765 INFO L276 IsEmpty]: Start isEmpty. Operand 29769 states and 44199 transitions. [2019-10-13 21:25:16,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-13 21:25:16,773 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:16,774 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:16,774 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:16,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:16,774 INFO L82 PathProgramCache]: Analyzing trace with hash 2132469410, now seen corresponding path program 1 times [2019-10-13 21:25:16,775 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:16,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642805628] [2019-10-13 21:25:16,775 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:16,775 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:16,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:16,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:16,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:16,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642805628] [2019-10-13 21:25:16,938 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:16,938 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:16,939 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924790448] [2019-10-13 21:25:16,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:16,939 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:16,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:16,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:16,940 INFO L87 Difference]: Start difference. First operand 29769 states and 44199 transitions. Second operand 4 states. [2019-10-13 21:25:19,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:19,002 INFO L93 Difference]: Finished difference Result 50148 states and 74433 transitions. [2019-10-13 21:25:19,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:19,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-10-13 21:25:19,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:19,032 INFO L225 Difference]: With dead ends: 50148 [2019-10-13 21:25:19,033 INFO L226 Difference]: Without dead ends: 27144 [2019-10-13 21:25:19,055 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:19,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27144 states. [2019-10-13 21:25:20,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27144 to 27144. [2019-10-13 21:25:20,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27144 states. [2019-10-13 21:25:20,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27144 states to 27144 states and 40307 transitions. [2019-10-13 21:25:20,412 INFO L78 Accepts]: Start accepts. Automaton has 27144 states and 40307 transitions. Word has length 159 [2019-10-13 21:25:20,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:20,412 INFO L462 AbstractCegarLoop]: Abstraction has 27144 states and 40307 transitions. [2019-10-13 21:25:20,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:20,412 INFO L276 IsEmpty]: Start isEmpty. Operand 27144 states and 40307 transitions. [2019-10-13 21:25:20,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-13 21:25:20,420 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:20,420 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:20,421 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:20,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:20,421 INFO L82 PathProgramCache]: Analyzing trace with hash 642084846, now seen corresponding path program 1 times [2019-10-13 21:25:20,421 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:20,421 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689249273] [2019-10-13 21:25:20,422 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:20,422 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:20,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:20,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat