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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:52:01,145 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:52:01,147 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:52:01,159 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:52:01,159 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:52:01,160 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:52:01,163 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:52:01,173 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:52:01,177 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:52:01,178 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:52:01,179 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:52:01,182 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:52:01,182 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:52:01,183 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:52:01,187 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:52:01,189 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:52:01,190 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:52:01,193 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:52:01,196 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:52:01,200 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:52:01,203 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:52:01,204 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:52:01,209 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:52:01,210 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:52:01,212 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:52:01,212 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:52:01,213 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:52:01,215 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:52:01,217 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:52:01,218 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:52:01,219 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:52:01,221 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:52:01,221 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:52:01,222 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:52:01,224 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:52:01,225 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:52:01,225 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:52:01,226 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:52:01,226 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:52:01,228 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:52:01,229 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:52:01,230 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 07:52:01,247 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:52:01,247 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:52:01,248 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:52:01,248 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:52:01,248 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:52:01,249 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:52:01,249 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:52:01,249 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:52:01,249 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:52:01,250 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:52:01,250 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:52:01,250 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:52:01,251 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:52:01,251 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:52:01,251 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:52:01,251 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:52:01,252 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:52:01,252 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:52:01,252 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:52:01,252 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:52:01,252 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:52:01,253 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:52:01,253 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:52:01,253 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:52:01,253 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:52:01,253 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:52:01,254 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:52:01,254 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:52:01,254 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:52:01,254 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:52:01,282 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:52:01,293 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:52:01,297 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:52:01,298 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:52:01,299 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:52:01,299 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 07:52:01,359 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c4204379/4798ed8050e04aef9dbc43c2b6252af1/FLAG929652737 [2019-09-10 07:52:02,008 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:52:02,010 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 07:52:02,031 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c4204379/4798ed8050e04aef9dbc43c2b6252af1/FLAG929652737 [2019-09-10 07:52:02,189 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c4204379/4798ed8050e04aef9dbc43c2b6252af1 [2019-09-10 07:52:02,198 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:52:02,200 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:52:02,200 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:52:02,201 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:52:02,204 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:52:02,205 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:52:02" (1/1) ... [2019-09-10 07:52:02,208 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3708097c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:02, skipping insertion in model container [2019-09-10 07:52:02,209 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:52:02" (1/1) ... [2019-09-10 07:52:02,216 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:52:02,303 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:52:03,148 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:52:03,168 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:52:03,488 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:52:03,521 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:52:03,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:03 WrapperNode [2019-09-10 07:52:03,523 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:52:03,524 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:52:03,525 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:52:03,525 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:52:03,536 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:03" (1/1) ... [2019-09-10 07:52:03,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:03" (1/1) ... [2019-09-10 07:52:03,563 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:03" (1/1) ... [2019-09-10 07:52:03,564 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:03" (1/1) ... [2019-09-10 07:52:03,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:03" (1/1) ... [2019-09-10 07:52:03,650 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:03" (1/1) ... [2019-09-10 07:52:03,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:03" (1/1) ... [2019-09-10 07:52:03,677 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:52:03,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:52:03,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:52:03,678 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:52:03,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:03" (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-09-10 07:52:03,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:52:03,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:52:03,749 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:52:03,749 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:52:03,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:52:03,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:52:03,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 07:52:03,750 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:52:03,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:52:03,751 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:52:03,751 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:52:03,752 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:52:03,752 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:52:03,753 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:52:03,753 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:52:03,754 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:52:03,754 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:52:03,755 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:52:03,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:52:03,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:52:05,920 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:52:05,921 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:52:05,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:52:05 BoogieIcfgContainer [2019-09-10 07:52:05,922 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:52:05,924 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:52:05,924 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:52:05,927 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:52:05,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:52:02" (1/3) ... [2019-09-10 07:52:05,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a6a24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:52:05, skipping insertion in model container [2019-09-10 07:52:05,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:03" (2/3) ... [2019-09-10 07:52:05,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a6a24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:52:05, skipping insertion in model container [2019-09-10 07:52:05,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:52:05" (3/3) ... [2019-09-10 07:52:05,931 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 07:52:05,942 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:52:05,952 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2019-09-10 07:52:05,973 INFO L252 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2019-09-10 07:52:06,005 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:52:06,005 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:52:06,006 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:52:06,006 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:52:06,006 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:52:06,007 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:52:06,007 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:52:06,007 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:52:06,036 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states. [2019-09-10 07:52:06,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-10 07:52:06,059 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:06,060 INFO L399 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] [2019-09-10 07:52:06,063 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:06,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:06,069 INFO L82 PathProgramCache]: Analyzing trace with hash -221233155, now seen corresponding path program 1 times [2019-09-10 07:52:06,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:06,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:06,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:06,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:06,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:06,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:06,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:06,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:52:06,668 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:06,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:52:06,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:52:06,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:52:06,694 INFO L87 Difference]: Start difference. First operand 542 states. Second operand 5 states. [2019-09-10 07:52:07,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:07,275 INFO L93 Difference]: Finished difference Result 433 states and 733 transitions. [2019-09-10 07:52:07,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:52:07,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-09-10 07:52:07,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:07,293 INFO L225 Difference]: With dead ends: 433 [2019-09-10 07:52:07,294 INFO L226 Difference]: Without dead ends: 421 [2019-09-10 07:52:07,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:52:07,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-09-10 07:52:07,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2019-09-10 07:52:07,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-10 07:52:07,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 534 transitions. [2019-09-10 07:52:07,369 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 534 transitions. Word has length 63 [2019-09-10 07:52:07,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:07,370 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 534 transitions. [2019-09-10 07:52:07,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:52:07,370 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 534 transitions. [2019-09-10 07:52:07,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-10 07:52:07,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:07,376 INFO L399 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] [2019-09-10 07:52:07,376 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:07,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:07,377 INFO L82 PathProgramCache]: Analyzing trace with hash -490750818, now seen corresponding path program 1 times [2019-09-10 07:52:07,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:07,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:07,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:07,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:07,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:07,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:07,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:07,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:07,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:52:07,521 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:07,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:52:07,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:52:07,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:52:07,523 INFO L87 Difference]: Start difference. First operand 421 states and 534 transitions. Second operand 5 states. [2019-09-10 07:52:07,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:07,804 INFO L93 Difference]: Finished difference Result 303 states and 381 transitions. [2019-09-10 07:52:07,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:52:07,804 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-09-10 07:52:07,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:07,807 INFO L225 Difference]: With dead ends: 303 [2019-09-10 07:52:07,807 INFO L226 Difference]: Without dead ends: 303 [2019-09-10 07:52:07,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:52:07,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-09-10 07:52:07,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2019-09-10 07:52:07,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-09-10 07:52:07,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 381 transitions. [2019-09-10 07:52:07,827 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 381 transitions. Word has length 63 [2019-09-10 07:52:07,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:07,828 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 381 transitions. [2019-09-10 07:52:07,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:52:07,828 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 381 transitions. [2019-09-10 07:52:07,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-10 07:52:07,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:07,834 INFO L399 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] [2019-09-10 07:52:07,835 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:07,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:07,835 INFO L82 PathProgramCache]: Analyzing trace with hash 556502945, now seen corresponding path program 1 times [2019-09-10 07:52:07,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:07,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:07,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:07,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:07,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:07,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:08,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:08,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:08,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:52:08,012 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:08,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:52:08,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:52:08,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:52:08,013 INFO L87 Difference]: Start difference. First operand 303 states and 381 transitions. Second operand 6 states. [2019-09-10 07:52:08,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:08,351 INFO L93 Difference]: Finished difference Result 392 states and 489 transitions. [2019-09-10 07:52:08,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:52:08,352 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-09-10 07:52:08,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:08,355 INFO L225 Difference]: With dead ends: 392 [2019-09-10 07:52:08,355 INFO L226 Difference]: Without dead ends: 392 [2019-09-10 07:52:08,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:52:08,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-09-10 07:52:08,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 352. [2019-09-10 07:52:08,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-10 07:52:08,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 456 transitions. [2019-09-10 07:52:08,369 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 456 transitions. Word has length 63 [2019-09-10 07:52:08,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:08,369 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 456 transitions. [2019-09-10 07:52:08,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:52:08,369 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 456 transitions. [2019-09-10 07:52:08,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 07:52:08,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:08,372 INFO L399 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] [2019-09-10 07:52:08,372 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:08,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:08,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1040476392, now seen corresponding path program 1 times [2019-09-10 07:52:08,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:08,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:08,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:08,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:08,375 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:08,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:08,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:08,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:52:08,477 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:08,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:52:08,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:52:08,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:52:08,478 INFO L87 Difference]: Start difference. First operand 352 states and 456 transitions. Second operand 5 states. [2019-09-10 07:52:08,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:08,695 INFO L93 Difference]: Finished difference Result 314 states and 406 transitions. [2019-09-10 07:52:08,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:52:08,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-09-10 07:52:08,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:08,697 INFO L225 Difference]: With dead ends: 314 [2019-09-10 07:52:08,698 INFO L226 Difference]: Without dead ends: 314 [2019-09-10 07:52:08,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:52:08,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-10 07:52:08,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2019-09-10 07:52:08,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-09-10 07:52:08,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 406 transitions. [2019-09-10 07:52:08,707 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 406 transitions. Word has length 64 [2019-09-10 07:52:08,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:08,708 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 406 transitions. [2019-09-10 07:52:08,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:52:08,708 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 406 transitions. [2019-09-10 07:52:08,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 07:52:08,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:08,710 INFO L399 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] [2019-09-10 07:52:08,710 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:08,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:08,710 INFO L82 PathProgramCache]: Analyzing trace with hash 811942748, now seen corresponding path program 1 times [2019-09-10 07:52:08,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:08,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:08,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:08,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:08,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:08,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:08,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:08,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:52:08,932 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:08,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:52:08,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:52:08,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:52:08,935 INFO L87 Difference]: Start difference. First operand 314 states and 406 transitions. Second operand 9 states. [2019-09-10 07:52:09,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:09,809 INFO L93 Difference]: Finished difference Result 724 states and 990 transitions. [2019-09-10 07:52:09,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:52:09,809 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-09-10 07:52:09,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:09,814 INFO L225 Difference]: With dead ends: 724 [2019-09-10 07:52:09,814 INFO L226 Difference]: Without dead ends: 724 [2019-09-10 07:52:09,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:52:09,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-09-10 07:52:09,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 314. [2019-09-10 07:52:09,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-09-10 07:52:09,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 405 transitions. [2019-09-10 07:52:09,829 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 405 transitions. Word has length 65 [2019-09-10 07:52:09,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:09,829 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 405 transitions. [2019-09-10 07:52:09,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:52:09,830 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 405 transitions. [2019-09-10 07:52:09,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 07:52:09,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:09,831 INFO L399 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] [2019-09-10 07:52:09,831 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:09,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:09,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1192590481, now seen corresponding path program 1 times [2019-09-10 07:52:09,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:09,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:09,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:09,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:09,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:09,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:09,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:09,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:52:09,985 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:09,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:52:09,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:52:09,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:52:09,987 INFO L87 Difference]: Start difference. First operand 314 states and 405 transitions. Second operand 9 states. [2019-09-10 07:52:10,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:10,912 INFO L93 Difference]: Finished difference Result 712 states and 967 transitions. [2019-09-10 07:52:10,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:52:10,913 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-09-10 07:52:10,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:10,918 INFO L225 Difference]: With dead ends: 712 [2019-09-10 07:52:10,918 INFO L226 Difference]: Without dead ends: 712 [2019-09-10 07:52:10,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:52:10,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2019-09-10 07:52:10,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 314. [2019-09-10 07:52:10,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-09-10 07:52:10,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 404 transitions. [2019-09-10 07:52:10,931 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 404 transitions. Word has length 65 [2019-09-10 07:52:10,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:10,932 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 404 transitions. [2019-09-10 07:52:10,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:52:10,932 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 404 transitions. [2019-09-10 07:52:10,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 07:52:10,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:10,933 INFO L399 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] [2019-09-10 07:52:10,934 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:10,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:10,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1959558393, now seen corresponding path program 1 times [2019-09-10 07:52:10,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:10,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:10,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:10,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:10,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:11,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-09-10 07:52:11,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:11,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:52:11,077 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:11,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:52:11,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:52:11,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:52:11,078 INFO L87 Difference]: Start difference. First operand 314 states and 404 transitions. Second operand 8 states. [2019-09-10 07:52:11,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:11,558 INFO L93 Difference]: Finished difference Result 406 states and 515 transitions. [2019-09-10 07:52:11,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 07:52:11,558 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-09-10 07:52:11,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:11,561 INFO L225 Difference]: With dead ends: 406 [2019-09-10 07:52:11,561 INFO L226 Difference]: Without dead ends: 406 [2019-09-10 07:52:11,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:52:11,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-09-10 07:52:11,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 314. [2019-09-10 07:52:11,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-09-10 07:52:11,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 403 transitions. [2019-09-10 07:52:11,572 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 403 transitions. Word has length 65 [2019-09-10 07:52:11,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:11,572 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 403 transitions. [2019-09-10 07:52:11,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:52:11,573 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 403 transitions. [2019-09-10 07:52:11,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 07:52:11,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:11,574 INFO L399 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] [2019-09-10 07:52:11,575 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:11,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:11,575 INFO L82 PathProgramCache]: Analyzing trace with hash 297751041, now seen corresponding path program 1 times [2019-09-10 07:52:11,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:11,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:11,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:11,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:11,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:11,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:11,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:11,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:52:11,738 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:11,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:52:11,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:52:11,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:52:11,739 INFO L87 Difference]: Start difference. First operand 314 states and 403 transitions. Second operand 9 states. [2019-09-10 07:52:12,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:12,861 INFO L93 Difference]: Finished difference Result 712 states and 965 transitions. [2019-09-10 07:52:12,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:52:12,861 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-09-10 07:52:12,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:12,865 INFO L225 Difference]: With dead ends: 712 [2019-09-10 07:52:12,865 INFO L226 Difference]: Without dead ends: 712 [2019-09-10 07:52:12,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:52:12,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2019-09-10 07:52:12,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 314. [2019-09-10 07:52:12,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-09-10 07:52:12,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 402 transitions. [2019-09-10 07:52:12,876 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 402 transitions. Word has length 67 [2019-09-10 07:52:12,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:12,876 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 402 transitions. [2019-09-10 07:52:12,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:52:12,877 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 402 transitions. [2019-09-10 07:52:12,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 07:52:12,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:12,878 INFO L399 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] [2019-09-10 07:52:12,878 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:12,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:12,879 INFO L82 PathProgramCache]: Analyzing trace with hash -101064039, now seen corresponding path program 1 times [2019-09-10 07:52:12,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:12,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:12,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:12,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:12,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:12,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:13,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:13,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:52:13,000 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:13,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:52:13,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:52:13,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:52:13,001 INFO L87 Difference]: Start difference. First operand 314 states and 402 transitions. Second operand 9 states. [2019-09-10 07:52:14,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:14,115 INFO L93 Difference]: Finished difference Result 724 states and 984 transitions. [2019-09-10 07:52:14,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:52:14,122 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-09-10 07:52:14,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:14,126 INFO L225 Difference]: With dead ends: 724 [2019-09-10 07:52:14,126 INFO L226 Difference]: Without dead ends: 724 [2019-09-10 07:52:14,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:52:14,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-09-10 07:52:14,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 314. [2019-09-10 07:52:14,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-09-10 07:52:14,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 401 transitions. [2019-09-10 07:52:14,139 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 401 transitions. Word has length 67 [2019-09-10 07:52:14,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:14,139 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 401 transitions. [2019-09-10 07:52:14,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:52:14,139 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 401 transitions. [2019-09-10 07:52:14,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 07:52:14,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:14,141 INFO L399 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] [2019-09-10 07:52:14,141 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:14,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:14,141 INFO L82 PathProgramCache]: Analyzing trace with hash 217206227, now seen corresponding path program 1 times [2019-09-10 07:52:14,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:14,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:14,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:14,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:14,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:14,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:14,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:14,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:52:14,292 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:14,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:52:14,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:52:14,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:52:14,294 INFO L87 Difference]: Start difference. First operand 314 states and 401 transitions. Second operand 9 states. [2019-09-10 07:52:15,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:15,354 INFO L93 Difference]: Finished difference Result 712 states and 963 transitions. [2019-09-10 07:52:15,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:52:15,357 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-09-10 07:52:15,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:15,362 INFO L225 Difference]: With dead ends: 712 [2019-09-10 07:52:15,362 INFO L226 Difference]: Without dead ends: 712 [2019-09-10 07:52:15,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:52:15,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2019-09-10 07:52:15,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 314. [2019-09-10 07:52:15,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-09-10 07:52:15,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 400 transitions. [2019-09-10 07:52:15,379 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 400 transitions. Word has length 67 [2019-09-10 07:52:15,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:15,380 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 400 transitions. [2019-09-10 07:52:15,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:52:15,381 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 400 transitions. [2019-09-10 07:52:15,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 07:52:15,382 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:15,383 INFO L399 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] [2019-09-10 07:52:15,383 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:15,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:15,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1537942501, now seen corresponding path program 1 times [2019-09-10 07:52:15,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:15,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:15,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:15,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:15,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:15,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:15,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:15,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:52:15,582 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:15,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:52:15,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:52:15,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:52:15,584 INFO L87 Difference]: Start difference. First operand 314 states and 400 transitions. Second operand 9 states. [2019-09-10 07:52:16,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:16,649 INFO L93 Difference]: Finished difference Result 724 states and 982 transitions. [2019-09-10 07:52:16,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:52:16,650 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-09-10 07:52:16,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:16,653 INFO L225 Difference]: With dead ends: 724 [2019-09-10 07:52:16,654 INFO L226 Difference]: Without dead ends: 724 [2019-09-10 07:52:16,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:52:16,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-09-10 07:52:16,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 314. [2019-09-10 07:52:16,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-09-10 07:52:16,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 399 transitions. [2019-09-10 07:52:16,670 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 399 transitions. Word has length 67 [2019-09-10 07:52:16,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:16,671 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 399 transitions. [2019-09-10 07:52:16,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:52:16,671 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 399 transitions. [2019-09-10 07:52:16,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 07:52:16,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:16,672 INFO L399 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] [2019-09-10 07:52:16,672 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:16,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:16,673 INFO L82 PathProgramCache]: Analyzing trace with hash -149286562, now seen corresponding path program 1 times [2019-09-10 07:52:16,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:16,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:16,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:16,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:16,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:16,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:16,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:16,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:52:16,814 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:16,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:52:16,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:52:16,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:52:16,815 INFO L87 Difference]: Start difference. First operand 314 states and 399 transitions. Second operand 9 states. [2019-09-10 07:52:17,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:17,790 INFO L93 Difference]: Finished difference Result 724 states and 982 transitions. [2019-09-10 07:52:17,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:52:17,790 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-09-10 07:52:17,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:17,796 INFO L225 Difference]: With dead ends: 724 [2019-09-10 07:52:17,796 INFO L226 Difference]: Without dead ends: 724 [2019-09-10 07:52:17,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:52:17,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-09-10 07:52:17,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 314. [2019-09-10 07:52:17,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-09-10 07:52:17,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 398 transitions. [2019-09-10 07:52:17,808 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 398 transitions. Word has length 67 [2019-09-10 07:52:17,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:17,809 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 398 transitions. [2019-09-10 07:52:17,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:52:17,809 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 398 transitions. [2019-09-10 07:52:17,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 07:52:17,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:17,810 INFO L399 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] [2019-09-10 07:52:17,810 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:17,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:17,811 INFO L82 PathProgramCache]: Analyzing trace with hash 415538350, now seen corresponding path program 1 times [2019-09-10 07:52:17,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:17,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:17,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:17,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:17,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:17,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:17,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:17,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:52:17,946 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:17,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:52:17,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:52:17,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:52:17,947 INFO L87 Difference]: Start difference. First operand 314 states and 398 transitions. Second operand 9 states. [2019-09-10 07:52:18,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:18,945 INFO L93 Difference]: Finished difference Result 712 states and 960 transitions. [2019-09-10 07:52:18,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:52:18,945 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-09-10 07:52:18,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:18,949 INFO L225 Difference]: With dead ends: 712 [2019-09-10 07:52:18,949 INFO L226 Difference]: Without dead ends: 712 [2019-09-10 07:52:18,950 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:52:18,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2019-09-10 07:52:18,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 314. [2019-09-10 07:52:18,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-09-10 07:52:18,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 397 transitions. [2019-09-10 07:52:18,961 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 397 transitions. Word has length 67 [2019-09-10 07:52:18,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:18,964 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 397 transitions. [2019-09-10 07:52:18,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:52:18,964 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 397 transitions. [2019-09-10 07:52:18,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 07:52:18,967 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:18,967 INFO L399 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] [2019-09-10 07:52:18,967 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:18,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:18,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1403250118, now seen corresponding path program 1 times [2019-09-10 07:52:18,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:18,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:18,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:18,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:18,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:19,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:19,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:19,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:52:19,097 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:19,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:52:19,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:52:19,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:52:19,098 INFO L87 Difference]: Start difference. First operand 314 states and 397 transitions. Second operand 9 states. [2019-09-10 07:52:20,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:20,213 INFO L93 Difference]: Finished difference Result 724 states and 979 transitions. [2019-09-10 07:52:20,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:52:20,214 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-09-10 07:52:20,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:20,219 INFO L225 Difference]: With dead ends: 724 [2019-09-10 07:52:20,220 INFO L226 Difference]: Without dead ends: 724 [2019-09-10 07:52:20,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:52:20,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-09-10 07:52:20,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 314. [2019-09-10 07:52:20,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-09-10 07:52:20,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 396 transitions. [2019-09-10 07:52:20,232 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 396 transitions. Word has length 67 [2019-09-10 07:52:20,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:20,232 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 396 transitions. [2019-09-10 07:52:20,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:52:20,232 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 396 transitions. [2019-09-10 07:52:20,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:52:20,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:20,233 INFO L399 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] [2019-09-10 07:52:20,234 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:20,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:20,234 INFO L82 PathProgramCache]: Analyzing trace with hash 819188212, now seen corresponding path program 1 times [2019-09-10 07:52:20,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:20,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:20,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:20,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:20,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:21,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:21,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:21,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 07:52:21,252 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:21,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 07:52:21,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 07:52:21,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:52:21,253 INFO L87 Difference]: Start difference. First operand 314 states and 396 transitions. Second operand 19 states. [2019-09-10 07:52:22,102 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-10 07:52:22,238 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-10 07:52:22,368 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 07:52:22,573 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 07:52:22,704 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 07:52:25,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:25,015 INFO L93 Difference]: Finished difference Result 830 states and 1097 transitions. [2019-09-10 07:52:25,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:52:25,015 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 69 [2019-09-10 07:52:25,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:25,019 INFO L225 Difference]: With dead ends: 830 [2019-09-10 07:52:25,019 INFO L226 Difference]: Without dead ends: 830 [2019-09-10 07:52:25,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=281, Invalid=909, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 07:52:25,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2019-09-10 07:52:25,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 320. [2019-09-10 07:52:25,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-09-10 07:52:25,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 402 transitions. [2019-09-10 07:52:25,033 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 402 transitions. Word has length 69 [2019-09-10 07:52:25,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:25,033 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 402 transitions. [2019-09-10 07:52:25,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 07:52:25,034 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 402 transitions. [2019-09-10 07:52:25,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:52:25,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:25,035 INFO L399 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] [2019-09-10 07:52:25,035 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:25,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:25,036 INFO L82 PathProgramCache]: Analyzing trace with hash 2009849792, now seen corresponding path program 1 times [2019-09-10 07:52:25,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:25,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:25,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:25,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:25,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:25,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:25,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:25,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 07:52:25,786 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:25,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:52:25,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:52:25,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:52:25,788 INFO L87 Difference]: Start difference. First operand 320 states and 402 transitions. Second operand 17 states. [2019-09-10 07:52:26,346 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-10 07:52:27,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:27,720 INFO L93 Difference]: Finished difference Result 730 states and 982 transitions. [2019-09-10 07:52:27,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:52:27,721 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 69 [2019-09-10 07:52:27,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:27,724 INFO L225 Difference]: With dead ends: 730 [2019-09-10 07:52:27,724 INFO L226 Difference]: Without dead ends: 730 [2019-09-10 07:52:27,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:52:27,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-09-10 07:52:27,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 310. [2019-09-10 07:52:27,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-09-10 07:52:27,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 388 transitions. [2019-09-10 07:52:27,734 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 388 transitions. Word has length 69 [2019-09-10 07:52:27,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:27,735 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 388 transitions. [2019-09-10 07:52:27,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:52:27,735 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 388 transitions. [2019-09-10 07:52:27,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:52:27,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:27,736 INFO L399 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] [2019-09-10 07:52:27,736 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:27,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:27,737 INFO L82 PathProgramCache]: Analyzing trace with hash -628951207, now seen corresponding path program 1 times [2019-09-10 07:52:27,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:27,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:27,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:27,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:27,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:28,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:28,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:28,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 07:52:28,975 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:28,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:52:28,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:52:28,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:52:28,976 INFO L87 Difference]: Start difference. First operand 310 states and 388 transitions. Second operand 21 states. [2019-09-10 07:52:29,108 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 07:52:29,864 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 07:52:30,101 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-09-10 07:52:30,373 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-09-10 07:52:30,568 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 07:52:30,747 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 07:52:30,929 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:52:31,984 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-10 07:52:32,252 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 07:52:32,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:32,972 INFO L93 Difference]: Finished difference Result 788 states and 1005 transitions. [2019-09-10 07:52:32,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 07:52:32,972 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2019-09-10 07:52:32,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:32,977 INFO L225 Difference]: With dead ends: 788 [2019-09-10 07:52:32,977 INFO L226 Difference]: Without dead ends: 788 [2019-09-10 07:52:32,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=282, Invalid=978, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 07:52:32,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2019-09-10 07:52:32,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 325. [2019-09-10 07:52:32,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-09-10 07:52:32,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 409 transitions. [2019-09-10 07:52:32,989 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 409 transitions. Word has length 69 [2019-09-10 07:52:32,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:32,989 INFO L475 AbstractCegarLoop]: Abstraction has 325 states and 409 transitions. [2019-09-10 07:52:32,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:52:32,989 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 409 transitions. [2019-09-10 07:52:32,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:52:32,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:32,990 INFO L399 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] [2019-09-10 07:52:32,991 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:32,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:32,991 INFO L82 PathProgramCache]: Analyzing trace with hash -2003011199, now seen corresponding path program 1 times [2019-09-10 07:52:32,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:32,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:32,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:32,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:32,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:33,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:33,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:33,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:33,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 07:52:33,775 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:33,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:52:33,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:52:33,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:52:33,775 INFO L87 Difference]: Start difference. First operand 325 states and 409 transitions. Second operand 17 states. [2019-09-10 07:52:34,324 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-10 07:52:35,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:35,547 INFO L93 Difference]: Finished difference Result 511 states and 656 transitions. [2019-09-10 07:52:35,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 07:52:35,547 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 69 [2019-09-10 07:52:35,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:35,550 INFO L225 Difference]: With dead ends: 511 [2019-09-10 07:52:35,551 INFO L226 Difference]: Without dead ends: 511 [2019-09-10 07:52:35,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:52:35,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-09-10 07:52:35,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 314. [2019-09-10 07:52:35,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-09-10 07:52:35,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 395 transitions. [2019-09-10 07:52:35,559 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 395 transitions. Word has length 69 [2019-09-10 07:52:35,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:35,559 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 395 transitions. [2019-09-10 07:52:35,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:52:35,560 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 395 transitions. [2019-09-10 07:52:35,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:52:35,560 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:35,561 INFO L399 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] [2019-09-10 07:52:35,561 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:35,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:35,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1595609728, now seen corresponding path program 1 times [2019-09-10 07:52:35,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:35,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:35,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:35,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:35,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:35,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:35,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:35,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 07:52:35,859 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:35,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 07:52:35,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 07:52:35,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:52:35,860 INFO L87 Difference]: Start difference. First operand 314 states and 395 transitions. Second operand 11 states. [2019-09-10 07:52:36,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:36,514 INFO L93 Difference]: Finished difference Result 576 states and 763 transitions. [2019-09-10 07:52:36,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 07:52:36,515 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2019-09-10 07:52:36,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:36,518 INFO L225 Difference]: With dead ends: 576 [2019-09-10 07:52:36,518 INFO L226 Difference]: Without dead ends: 576 [2019-09-10 07:52:36,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:52:36,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-09-10 07:52:36,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 310. [2019-09-10 07:52:36,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-09-10 07:52:36,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 390 transitions. [2019-09-10 07:52:36,526 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 390 transitions. Word has length 70 [2019-09-10 07:52:36,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:36,527 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 390 transitions. [2019-09-10 07:52:36,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 07:52:36,527 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 390 transitions. [2019-09-10 07:52:36,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:52:36,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:36,528 INFO L399 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] [2019-09-10 07:52:36,529 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:36,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:36,529 INFO L82 PathProgramCache]: Analyzing trace with hash -110122555, now seen corresponding path program 1 times [2019-09-10 07:52:36,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:36,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:36,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:36,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:36,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:36,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:36,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:36,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 07:52:36,861 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:36,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 07:52:36,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 07:52:36,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:52:36,862 INFO L87 Difference]: Start difference. First operand 310 states and 390 transitions. Second operand 11 states. [2019-09-10 07:52:37,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:37,439 INFO L93 Difference]: Finished difference Result 565 states and 752 transitions. [2019-09-10 07:52:37,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:52:37,440 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2019-09-10 07:52:37,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:37,442 INFO L225 Difference]: With dead ends: 565 [2019-09-10 07:52:37,443 INFO L226 Difference]: Without dead ends: 565 [2019-09-10 07:52:37,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:52:37,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2019-09-10 07:52:37,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 309. [2019-09-10 07:52:37,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-09-10 07:52:37,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 388 transitions. [2019-09-10 07:52:37,452 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 388 transitions. Word has length 70 [2019-09-10 07:52:37,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:37,452 INFO L475 AbstractCegarLoop]: Abstraction has 309 states and 388 transitions. [2019-09-10 07:52:37,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 07:52:37,452 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 388 transitions. [2019-09-10 07:52:37,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:52:37,453 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:37,454 INFO L399 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] [2019-09-10 07:52:37,454 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:37,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:37,454 INFO L82 PathProgramCache]: Analyzing trace with hash -154027530, now seen corresponding path program 1 times [2019-09-10 07:52:37,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:37,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:37,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:37,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:37,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:37,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:37,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:37,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:37,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:52:37,963 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:37,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:52:37,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:52:37,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:52:37,965 INFO L87 Difference]: Start difference. First operand 309 states and 388 transitions. Second operand 13 states. [2019-09-10 07:52:39,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:39,278 INFO L93 Difference]: Finished difference Result 1195 states and 1662 transitions. [2019-09-10 07:52:39,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:52:39,279 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 70 [2019-09-10 07:52:39,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:39,285 INFO L225 Difference]: With dead ends: 1195 [2019-09-10 07:52:39,285 INFO L226 Difference]: Without dead ends: 1195 [2019-09-10 07:52:39,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=156, Invalid=494, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:52:39,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2019-09-10 07:52:39,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 293. [2019-09-10 07:52:39,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-09-10 07:52:39,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 371 transitions. [2019-09-10 07:52:39,296 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 371 transitions. Word has length 70 [2019-09-10 07:52:39,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:39,296 INFO L475 AbstractCegarLoop]: Abstraction has 293 states and 371 transitions. [2019-09-10 07:52:39,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:52:39,297 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 371 transitions. [2019-09-10 07:52:39,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:52:39,298 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:39,298 INFO L399 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] [2019-09-10 07:52:39,298 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:39,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:39,299 INFO L82 PathProgramCache]: Analyzing trace with hash 918653497, now seen corresponding path program 1 times [2019-09-10 07:52:39,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:39,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:39,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:39,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:39,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:39,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:39,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:39,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:52:39,837 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:39,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:52:39,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:52:39,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:52:39,838 INFO L87 Difference]: Start difference. First operand 293 states and 371 transitions. Second operand 12 states. [2019-09-10 07:52:40,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:40,761 INFO L93 Difference]: Finished difference Result 564 states and 753 transitions. [2019-09-10 07:52:40,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:52:40,766 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2019-09-10 07:52:40,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:40,768 INFO L225 Difference]: With dead ends: 564 [2019-09-10 07:52:40,768 INFO L226 Difference]: Without dead ends: 564 [2019-09-10 07:52:40,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:52:40,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-09-10 07:52:40,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 277. [2019-09-10 07:52:40,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-09-10 07:52:40,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 351 transitions. [2019-09-10 07:52:40,777 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 351 transitions. Word has length 70 [2019-09-10 07:52:40,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:40,778 INFO L475 AbstractCegarLoop]: Abstraction has 277 states and 351 transitions. [2019-09-10 07:52:40,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:52:40,778 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 351 transitions. [2019-09-10 07:52:40,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:52:40,779 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:40,779 INFO L399 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] [2019-09-10 07:52:40,780 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:40,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:40,780 INFO L82 PathProgramCache]: Analyzing trace with hash -2033083250, now seen corresponding path program 1 times [2019-09-10 07:52:40,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:40,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:40,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:40,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:40,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:41,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:41,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:41,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:52:41,165 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:41,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:52:41,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:52:41,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:52:41,166 INFO L87 Difference]: Start difference. First operand 277 states and 351 transitions. Second operand 12 states. [2019-09-10 07:52:42,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:42,405 INFO L93 Difference]: Finished difference Result 671 states and 907 transitions. [2019-09-10 07:52:42,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:52:42,406 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2019-09-10 07:52:42,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:42,409 INFO L225 Difference]: With dead ends: 671 [2019-09-10 07:52:42,409 INFO L226 Difference]: Without dead ends: 671 [2019-09-10 07:52:42,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:52:42,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-09-10 07:52:42,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 246. [2019-09-10 07:52:42,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-09-10 07:52:42,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 311 transitions. [2019-09-10 07:52:42,416 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 311 transitions. Word has length 70 [2019-09-10 07:52:42,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:42,416 INFO L475 AbstractCegarLoop]: Abstraction has 246 states and 311 transitions. [2019-09-10 07:52:42,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:52:42,417 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 311 transitions. [2019-09-10 07:52:42,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:52:42,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:42,418 INFO L399 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] [2019-09-10 07:52:42,418 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:42,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:42,419 INFO L82 PathProgramCache]: Analyzing trace with hash -33038995, now seen corresponding path program 1 times [2019-09-10 07:52:42,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:42,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:42,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:42,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:42,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:42,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:42,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:42,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:42,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:52:42,537 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:42,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:52:42,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:52:42,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:52:42,538 INFO L87 Difference]: Start difference. First operand 246 states and 311 transitions. Second operand 9 states. [2019-09-10 07:52:43,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:43,242 INFO L93 Difference]: Finished difference Result 402 states and 523 transitions. [2019-09-10 07:52:43,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:52:43,242 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-09-10 07:52:43,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:43,244 INFO L225 Difference]: With dead ends: 402 [2019-09-10 07:52:43,244 INFO L226 Difference]: Without dead ends: 402 [2019-09-10 07:52:43,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:52:43,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-09-10 07:52:43,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 246. [2019-09-10 07:52:43,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-09-10 07:52:43,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 310 transitions. [2019-09-10 07:52:43,249 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 310 transitions. Word has length 70 [2019-09-10 07:52:43,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:43,250 INFO L475 AbstractCegarLoop]: Abstraction has 246 states and 310 transitions. [2019-09-10 07:52:43,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:52:43,250 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 310 transitions. [2019-09-10 07:52:43,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:52:43,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:43,251 INFO L399 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] [2019-09-10 07:52:43,251 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:43,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:43,252 INFO L82 PathProgramCache]: Analyzing trace with hash -34978696, now seen corresponding path program 1 times [2019-09-10 07:52:43,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:43,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:43,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:43,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:43,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:43,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:43,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:43,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:43,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 07:52:43,585 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:43,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 07:52:43,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 07:52:43,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:52:43,588 INFO L87 Difference]: Start difference. First operand 246 states and 310 transitions. Second operand 11 states. [2019-09-10 07:52:44,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:44,101 INFO L93 Difference]: Finished difference Result 500 states and 672 transitions. [2019-09-10 07:52:44,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:52:44,101 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2019-09-10 07:52:44,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:44,104 INFO L225 Difference]: With dead ends: 500 [2019-09-10 07:52:44,104 INFO L226 Difference]: Without dead ends: 500 [2019-09-10 07:52:44,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:52:44,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-09-10 07:52:44,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 242. [2019-09-10 07:52:44,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-09-10 07:52:44,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 306 transitions. [2019-09-10 07:52:44,111 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 306 transitions. Word has length 70 [2019-09-10 07:52:44,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:44,112 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 306 transitions. [2019-09-10 07:52:44,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 07:52:44,112 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 306 transitions. [2019-09-10 07:52:44,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:52:44,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:44,113 INFO L399 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] [2019-09-10 07:52:44,113 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:44,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:44,113 INFO L82 PathProgramCache]: Analyzing trace with hash 292721495, now seen corresponding path program 1 times [2019-09-10 07:52:44,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:44,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:44,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:44,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:44,115 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:44,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:44,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:44,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:52:44,220 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:44,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:52:44,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:52:44,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:52:44,221 INFO L87 Difference]: Start difference. First operand 242 states and 306 transitions. Second operand 9 states. [2019-09-10 07:52:44,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:44,805 INFO L93 Difference]: Finished difference Result 391 states and 509 transitions. [2019-09-10 07:52:44,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 07:52:44,805 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2019-09-10 07:52:44,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:44,808 INFO L225 Difference]: With dead ends: 391 [2019-09-10 07:52:44,808 INFO L226 Difference]: Without dead ends: 391 [2019-09-10 07:52:44,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:52:44,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-09-10 07:52:44,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 242. [2019-09-10 07:52:44,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-09-10 07:52:44,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 305 transitions. [2019-09-10 07:52:44,814 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 305 transitions. Word has length 71 [2019-09-10 07:52:44,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:44,815 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 305 transitions. [2019-09-10 07:52:44,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:52:44,815 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 305 transitions. [2019-09-10 07:52:44,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:52:44,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:44,816 INFO L399 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] [2019-09-10 07:52:44,816 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:44,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:44,817 INFO L82 PathProgramCache]: Analyzing trace with hash -288197998, now seen corresponding path program 1 times [2019-09-10 07:52:44,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:44,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:44,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:44,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:44,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:44,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:44,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:44,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:52:44,961 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:44,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:52:44,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:52:44,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:52:44,962 INFO L87 Difference]: Start difference. First operand 242 states and 305 transitions. Second operand 9 states. [2019-09-10 07:52:45,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:45,579 INFO L93 Difference]: Finished difference Result 391 states and 508 transitions. [2019-09-10 07:52:45,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 07:52:45,579 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2019-09-10 07:52:45,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:45,581 INFO L225 Difference]: With dead ends: 391 [2019-09-10 07:52:45,581 INFO L226 Difference]: Without dead ends: 391 [2019-09-10 07:52:45,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:52:45,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-09-10 07:52:45,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 242. [2019-09-10 07:52:45,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-09-10 07:52:45,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 304 transitions. [2019-09-10 07:52:45,586 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 304 transitions. Word has length 71 [2019-09-10 07:52:45,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:45,587 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 304 transitions. [2019-09-10 07:52:45,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:52:45,587 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 304 transitions. [2019-09-10 07:52:45,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:52:45,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:45,588 INFO L399 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] [2019-09-10 07:52:45,588 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:45,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:45,589 INFO L82 PathProgramCache]: Analyzing trace with hash -256536824, now seen corresponding path program 1 times [2019-09-10 07:52:45,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:45,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:45,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:45,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:45,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:45,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:46,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:46,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:46,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-10 07:52:46,426 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:46,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 07:52:46,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 07:52:46,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:52:46,426 INFO L87 Difference]: Start difference. First operand 242 states and 304 transitions. Second operand 23 states. [2019-09-10 07:52:46,716 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 95 [2019-09-10 07:52:47,584 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 07:52:47,782 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-10 07:52:48,031 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2019-09-10 07:52:48,212 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 07:52:48,395 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 07:52:52,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:52,203 INFO L93 Difference]: Finished difference Result 1331 states and 1853 transitions. [2019-09-10 07:52:52,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 07:52:52,204 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2019-09-10 07:52:52,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:52,209 INFO L225 Difference]: With dead ends: 1331 [2019-09-10 07:52:52,209 INFO L226 Difference]: Without dead ends: 1331 [2019-09-10 07:52:52,210 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=308, Invalid=1498, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 07:52:52,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2019-09-10 07:52:52,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 258. [2019-09-10 07:52:52,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-10 07:52:52,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 324 transitions. [2019-09-10 07:52:52,222 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 324 transitions. Word has length 72 [2019-09-10 07:52:52,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:52,223 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 324 transitions. [2019-09-10 07:52:52,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 07:52:52,223 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 324 transitions. [2019-09-10 07:52:52,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:52:52,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:52,224 INFO L399 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] [2019-09-10 07:52:52,225 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:52,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:52,225 INFO L82 PathProgramCache]: Analyzing trace with hash 424447858, now seen corresponding path program 1 times [2019-09-10 07:52:52,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:52,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:52,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:52,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:52,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:52,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:52,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:52,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 07:52:52,778 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:52,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 07:52:52,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 07:52:52,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:52:52,779 INFO L87 Difference]: Start difference. First operand 258 states and 324 transitions. Second operand 14 states. [2019-09-10 07:52:54,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:54,225 INFO L93 Difference]: Finished difference Result 513 states and 674 transitions. [2019-09-10 07:52:54,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:52:54,232 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 73 [2019-09-10 07:52:54,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:54,233 INFO L225 Difference]: With dead ends: 513 [2019-09-10 07:52:54,234 INFO L226 Difference]: Without dead ends: 513 [2019-09-10 07:52:54,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:52:54,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-09-10 07:52:54,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 253. [2019-09-10 07:52:54,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-09-10 07:52:54,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 318 transitions. [2019-09-10 07:52:54,243 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 318 transitions. Word has length 73 [2019-09-10 07:52:54,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:54,243 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 318 transitions. [2019-09-10 07:52:54,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 07:52:54,243 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 318 transitions. [2019-09-10 07:52:54,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:52:54,244 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:54,244 INFO L399 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] [2019-09-10 07:52:54,245 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:54,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:54,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1502313025, now seen corresponding path program 1 times [2019-09-10 07:52:54,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:54,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:54,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:54,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:54,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:55,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:55,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:55,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 07:52:55,184 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:55,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 07:52:55,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 07:52:55,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:52:55,185 INFO L87 Difference]: Start difference. First operand 253 states and 318 transitions. Second operand 19 states. [2019-09-10 07:52:55,799 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 07:52:55,987 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 07:52:56,142 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 07:52:56,283 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 07:52:56,413 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-10 07:52:56,540 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 07:52:58,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:58,537 INFO L93 Difference]: Finished difference Result 725 states and 973 transitions. [2019-09-10 07:52:58,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:52:58,538 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 73 [2019-09-10 07:52:58,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:58,541 INFO L225 Difference]: With dead ends: 725 [2019-09-10 07:52:58,541 INFO L226 Difference]: Without dead ends: 725 [2019-09-10 07:52:58,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=252, Invalid=938, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 07:52:58,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2019-09-10 07:52:58,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 258. [2019-09-10 07:52:58,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-10 07:52:58,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 323 transitions. [2019-09-10 07:52:58,550 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 323 transitions. Word has length 73 [2019-09-10 07:52:58,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:58,550 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 323 transitions. [2019-09-10 07:52:58,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 07:52:58,550 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 323 transitions. [2019-09-10 07:52:58,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:52:58,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:58,551 INFO L399 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] [2019-09-10 07:52:58,552 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:58,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:58,552 INFO L82 PathProgramCache]: Analyzing trace with hash -2067734093, now seen corresponding path program 1 times [2019-09-10 07:52:58,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:58,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:58,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:58,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:58,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:58,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:58,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:58,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:52:58,954 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:58,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:52:58,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:52:58,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:52:58,954 INFO L87 Difference]: Start difference. First operand 258 states and 323 transitions. Second operand 12 states. [2019-09-10 07:52:59,402 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-09-10 07:52:59,553 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-09-10 07:52:59,750 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2019-09-10 07:52:59,933 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2019-09-10 07:53:00,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:00,196 INFO L93 Difference]: Finished difference Result 608 states and 833 transitions. [2019-09-10 07:53:00,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:53:00,197 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2019-09-10 07:53:00,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:00,199 INFO L225 Difference]: With dead ends: 608 [2019-09-10 07:53:00,199 INFO L226 Difference]: Without dead ends: 608 [2019-09-10 07:53:00,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:53:00,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-09-10 07:53:00,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 236. [2019-09-10 07:53:00,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-09-10 07:53:00,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 297 transitions. [2019-09-10 07:53:00,204 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 297 transitions. Word has length 73 [2019-09-10 07:53:00,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:00,204 INFO L475 AbstractCegarLoop]: Abstraction has 236 states and 297 transitions. [2019-09-10 07:53:00,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:53:00,204 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 297 transitions. [2019-09-10 07:53:00,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:53:00,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:00,205 INFO L399 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] [2019-09-10 07:53:00,206 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:00,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:00,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1554071027, now seen corresponding path program 1 times [2019-09-10 07:53:00,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:00,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:00,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:00,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:00,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:00,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:00,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:00,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:53:00,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:53:00,656 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:53:00,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:53:00,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:53:00,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:53:00,658 INFO L87 Difference]: Start difference. First operand 236 states and 297 transitions. Second operand 13 states. [2019-09-10 07:53:01,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:01,990 INFO L93 Difference]: Finished difference Result 827 states and 1162 transitions. [2019-09-10 07:53:01,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:53:01,991 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 73 [2019-09-10 07:53:01,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:01,995 INFO L225 Difference]: With dead ends: 827 [2019-09-10 07:53:01,995 INFO L226 Difference]: Without dead ends: 827 [2019-09-10 07:53:01,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:53:01,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2019-09-10 07:53:02,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 218. [2019-09-10 07:53:02,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-09-10 07:53:02,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 278 transitions. [2019-09-10 07:53:02,002 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 278 transitions. Word has length 73 [2019-09-10 07:53:02,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:02,002 INFO L475 AbstractCegarLoop]: Abstraction has 218 states and 278 transitions. [2019-09-10 07:53:02,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:53:02,003 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 278 transitions. [2019-09-10 07:53:02,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 07:53:02,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:02,004 INFO L399 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] [2019-09-10 07:53:02,005 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:02,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:02,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1379799190, now seen corresponding path program 1 times [2019-09-10 07:53:02,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:02,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:02,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:02,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:02,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:02,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:02,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:53:02,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:53:02,359 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:53:02,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:53:02,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:53:02,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:53:02,360 INFO L87 Difference]: Start difference. First operand 218 states and 278 transitions. Second operand 10 states. [2019-09-10 07:53:02,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:02,707 INFO L93 Difference]: Finished difference Result 434 states and 601 transitions. [2019-09-10 07:53:02,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 07:53:02,712 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 74 [2019-09-10 07:53:02,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:02,713 INFO L225 Difference]: With dead ends: 434 [2019-09-10 07:53:02,713 INFO L226 Difference]: Without dead ends: 434 [2019-09-10 07:53:02,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:53:02,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-09-10 07:53:02,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 189. [2019-09-10 07:53:02,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-10 07:53:02,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 247 transitions. [2019-09-10 07:53:02,717 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 247 transitions. Word has length 74 [2019-09-10 07:53:02,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:02,718 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 247 transitions. [2019-09-10 07:53:02,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:53:02,718 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 247 transitions. [2019-09-10 07:53:02,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 07:53:02,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:02,719 INFO L399 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] [2019-09-10 07:53:02,719 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:02,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:02,719 INFO L82 PathProgramCache]: Analyzing trace with hash 973327812, now seen corresponding path program 1 times [2019-09-10 07:53:02,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:02,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:02,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:02,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:02,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:02,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:02,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:02,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:53:02,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:53:02,786 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:53:02,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:53:02,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:53:02,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:53:02,787 INFO L87 Difference]: Start difference. First operand 189 states and 247 transitions. Second operand 3 states. [2019-09-10 07:53:02,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:02,813 INFO L93 Difference]: Finished difference Result 286 states and 387 transitions. [2019-09-10 07:53:02,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:53:02,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-09-10 07:53:02,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:02,815 INFO L225 Difference]: With dead ends: 286 [2019-09-10 07:53:02,815 INFO L226 Difference]: Without dead ends: 286 [2019-09-10 07:53:02,816 INFO L628 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-09-10 07:53:02,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-09-10 07:53:02,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2019-09-10 07:53:02,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-09-10 07:53:02,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 386 transitions. [2019-09-10 07:53:02,821 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 386 transitions. Word has length 95 [2019-09-10 07:53:02,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:02,821 INFO L475 AbstractCegarLoop]: Abstraction has 284 states and 386 transitions. [2019-09-10 07:53:02,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:53:02,822 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 386 transitions. [2019-09-10 07:53:02,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:53:02,823 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:02,823 INFO L399 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] [2019-09-10 07:53:02,823 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:02,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:02,824 INFO L82 PathProgramCache]: Analyzing trace with hash -338945445, now seen corresponding path program 1 times [2019-09-10 07:53:02,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:02,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:02,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:02,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:02,825 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:02,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:02,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:53:02,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:53:02,907 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:53:02,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:53:02,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:53:02,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:53:02,908 INFO L87 Difference]: Start difference. First operand 284 states and 386 transitions. Second operand 5 states. [2019-09-10 07:53:03,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:03,175 INFO L93 Difference]: Finished difference Result 1032 states and 1465 transitions. [2019-09-10 07:53:03,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:53:03,175 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-10 07:53:03,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:03,180 INFO L225 Difference]: With dead ends: 1032 [2019-09-10 07:53:03,180 INFO L226 Difference]: Without dead ends: 1032 [2019-09-10 07:53:03,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:53:03,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2019-09-10 07:53:03,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 498. [2019-09-10 07:53:03,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2019-09-10 07:53:03,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 698 transitions. [2019-09-10 07:53:03,190 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 698 transitions. Word has length 97 [2019-09-10 07:53:03,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:03,191 INFO L475 AbstractCegarLoop]: Abstraction has 498 states and 698 transitions. [2019-09-10 07:53:03,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:53:03,191 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 698 transitions. [2019-09-10 07:53:03,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:53:03,192 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:03,192 INFO L399 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] [2019-09-10 07:53:03,193 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:03,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:03,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1085518228, now seen corresponding path program 1 times [2019-09-10 07:53:03,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:03,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:03,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:03,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:03,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:03,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:03,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:53:03,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:53:03,253 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:53:03,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:53:03,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:53:03,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:53:03,254 INFO L87 Difference]: Start difference. First operand 498 states and 698 transitions. Second operand 3 states. [2019-09-10 07:53:03,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:03,283 INFO L93 Difference]: Finished difference Result 704 states and 979 transitions. [2019-09-10 07:53:03,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:53:03,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-10 07:53:03,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:03,287 INFO L225 Difference]: With dead ends: 704 [2019-09-10 07:53:03,287 INFO L226 Difference]: Without dead ends: 704 [2019-09-10 07:53:03,287 INFO L628 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-09-10 07:53:03,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-09-10 07:53:03,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 694. [2019-09-10 07:53:03,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2019-09-10 07:53:03,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 970 transitions. [2019-09-10 07:53:03,301 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 970 transitions. Word has length 97 [2019-09-10 07:53:03,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:03,301 INFO L475 AbstractCegarLoop]: Abstraction has 694 states and 970 transitions. [2019-09-10 07:53:03,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:53:03,301 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 970 transitions. [2019-09-10 07:53:03,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:53:03,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:03,303 INFO L399 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] [2019-09-10 07:53:03,304 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:03,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:03,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1152011740, now seen corresponding path program 1 times [2019-09-10 07:53:03,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:03,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:03,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:03,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:03,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:03,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:03,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:03,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:53:03,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:53:03,372 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:53:03,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:53:03,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:53:03,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:53:03,374 INFO L87 Difference]: Start difference. First operand 694 states and 970 transitions. Second operand 3 states. [2019-09-10 07:53:03,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:03,404 INFO L93 Difference]: Finished difference Result 1019 states and 1430 transitions. [2019-09-10 07:53:03,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:53:03,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-10 07:53:03,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:03,409 INFO L225 Difference]: With dead ends: 1019 [2019-09-10 07:53:03,409 INFO L226 Difference]: Without dead ends: 1019 [2019-09-10 07:53:03,410 INFO L628 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-09-10 07:53:03,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2019-09-10 07:53:03,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 1017. [2019-09-10 07:53:03,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1017 states. [2019-09-10 07:53:03,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1429 transitions. [2019-09-10 07:53:03,423 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1429 transitions. Word has length 97 [2019-09-10 07:53:03,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:03,423 INFO L475 AbstractCegarLoop]: Abstraction has 1017 states and 1429 transitions. [2019-09-10 07:53:03,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:53:03,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1429 transitions. [2019-09-10 07:53:03,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:53:03,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:03,425 INFO L399 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] [2019-09-10 07:53:03,425 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:03,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:03,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1716786779, now seen corresponding path program 1 times [2019-09-10 07:53:03,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:03,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:03,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:03,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:03,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:03,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:03,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:53:03,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:53:03,483 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:53:03,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:53:03,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:53:03,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:53:03,484 INFO L87 Difference]: Start difference. First operand 1017 states and 1429 transitions. Second operand 5 states. [2019-09-10 07:53:03,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:03,679 INFO L93 Difference]: Finished difference Result 3780 states and 5233 transitions. [2019-09-10 07:53:03,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:53:03,679 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-10 07:53:03,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:03,693 INFO L225 Difference]: With dead ends: 3780 [2019-09-10 07:53:03,694 INFO L226 Difference]: Without dead ends: 3780 [2019-09-10 07:53:03,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:53:03,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3780 states. [2019-09-10 07:53:03,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3780 to 2020. [2019-09-10 07:53:03,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2020 states. [2019-09-10 07:53:03,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 2840 transitions. [2019-09-10 07:53:03,732 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 2840 transitions. Word has length 97 [2019-09-10 07:53:03,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:03,732 INFO L475 AbstractCegarLoop]: Abstraction has 2020 states and 2840 transitions. [2019-09-10 07:53:03,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:53:03,732 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 2840 transitions. [2019-09-10 07:53:03,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:53:03,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:03,734 INFO L399 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] [2019-09-10 07:53:03,734 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:03,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:03,734 INFO L82 PathProgramCache]: Analyzing trace with hash -703031205, now seen corresponding path program 1 times [2019-09-10 07:53:03,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:03,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:03,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:03,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:03,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:03,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:03,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:03,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:53:03,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:53:03,794 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:53:03,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:53:03,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:53:03,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:53:03,795 INFO L87 Difference]: Start difference. First operand 2020 states and 2840 transitions. Second operand 5 states. [2019-09-10 07:53:04,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:04,010 INFO L93 Difference]: Finished difference Result 6524 states and 9009 transitions. [2019-09-10 07:53:04,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:53:04,011 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-10 07:53:04,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:04,037 INFO L225 Difference]: With dead ends: 6524 [2019-09-10 07:53:04,038 INFO L226 Difference]: Without dead ends: 6524 [2019-09-10 07:53:04,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:53:04,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6524 states. [2019-09-10 07:53:04,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6524 to 4098. [2019-09-10 07:53:04,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2019-09-10 07:53:04,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 5734 transitions. [2019-09-10 07:53:04,112 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 5734 transitions. Word has length 97 [2019-09-10 07:53:04,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:04,112 INFO L475 AbstractCegarLoop]: Abstraction has 4098 states and 5734 transitions. [2019-09-10 07:53:04,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:53:04,112 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 5734 transitions. [2019-09-10 07:53:04,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 07:53:04,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:04,114 INFO L399 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] [2019-09-10 07:53:04,114 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:04,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:04,115 INFO L82 PathProgramCache]: Analyzing trace with hash -71633169, now seen corresponding path program 1 times [2019-09-10 07:53:04,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:04,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:04,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:04,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:04,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:04,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:04,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:04,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:53:04,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:53:04,169 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:53:04,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:53:04,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:53:04,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:53:04,170 INFO L87 Difference]: Start difference. First operand 4098 states and 5734 transitions. Second operand 3 states. [2019-09-10 07:53:04,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:04,219 INFO L93 Difference]: Finished difference Result 4512 states and 6259 transitions. [2019-09-10 07:53:04,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:53:04,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 07:53:04,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:04,229 INFO L225 Difference]: With dead ends: 4512 [2019-09-10 07:53:04,229 INFO L226 Difference]: Without dead ends: 4512 [2019-09-10 07:53:04,229 INFO L628 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-09-10 07:53:04,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4512 states. [2019-09-10 07:53:04,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4512 to 4462. [2019-09-10 07:53:04,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4462 states. [2019-09-10 07:53:04,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4462 states to 4462 states and 6202 transitions. [2019-09-10 07:53:04,282 INFO L78 Accepts]: Start accepts. Automaton has 4462 states and 6202 transitions. Word has length 98 [2019-09-10 07:53:04,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:04,283 INFO L475 AbstractCegarLoop]: Abstraction has 4462 states and 6202 transitions. [2019-09-10 07:53:04,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:53:04,283 INFO L276 IsEmpty]: Start isEmpty. Operand 4462 states and 6202 transitions. [2019-09-10 07:53:04,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 07:53:04,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:04,285 INFO L399 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] [2019-09-10 07:53:04,285 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:04,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:04,285 INFO L82 PathProgramCache]: Analyzing trace with hash -755637834, now seen corresponding path program 1 times [2019-09-10 07:53:04,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:04,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:04,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:04,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:04,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:04,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:04,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:04,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:53:04,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:53:04,340 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:53:04,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:53:04,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:53:04,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:53:04,341 INFO L87 Difference]: Start difference. First operand 4462 states and 6202 transitions. Second operand 5 states. [2019-09-10 07:53:04,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:04,549 INFO L93 Difference]: Finished difference Result 9388 states and 12797 transitions. [2019-09-10 07:53:04,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:53:04,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-09-10 07:53:04,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:04,569 INFO L225 Difference]: With dead ends: 9388 [2019-09-10 07:53:04,569 INFO L226 Difference]: Without dead ends: 9388 [2019-09-10 07:53:04,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:53:04,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9388 states. [2019-09-10 07:53:04,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9388 to 5494. [2019-09-10 07:53:04,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5494 states. [2019-09-10 07:53:04,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5494 states to 5494 states and 7522 transitions. [2019-09-10 07:53:04,699 INFO L78 Accepts]: Start accepts. Automaton has 5494 states and 7522 transitions. Word has length 98 [2019-09-10 07:53:04,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:04,699 INFO L475 AbstractCegarLoop]: Abstraction has 5494 states and 7522 transitions. [2019-09-10 07:53:04,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:53:04,700 INFO L276 IsEmpty]: Start isEmpty. Operand 5494 states and 7522 transitions. [2019-09-10 07:53:04,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 07:53:04,701 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:04,701 INFO L399 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] [2019-09-10 07:53:04,702 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:04,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:04,702 INFO L82 PathProgramCache]: Analyzing trace with hash 911061584, now seen corresponding path program 1 times [2019-09-10 07:53:04,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:04,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:04,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:04,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:04,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:04,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:04,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:53:04,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:53:04,795 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:53:04,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:53:04,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:53:04,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:53:04,796 INFO L87 Difference]: Start difference. First operand 5494 states and 7522 transitions. Second operand 6 states. [2019-09-10 07:53:04,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:04,877 INFO L93 Difference]: Finished difference Result 8764 states and 11714 transitions. [2019-09-10 07:53:04,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:53:04,877 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-09-10 07:53:04,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:04,893 INFO L225 Difference]: With dead ends: 8764 [2019-09-10 07:53:04,894 INFO L226 Difference]: Without dead ends: 8764 [2019-09-10 07:53:04,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:53:04,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8764 states. [2019-09-10 07:53:04,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8764 to 5590. [2019-09-10 07:53:04,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5590 states. [2019-09-10 07:53:04,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5590 states to 5590 states and 7586 transitions. [2019-09-10 07:53:04,983 INFO L78 Accepts]: Start accepts. Automaton has 5590 states and 7586 transitions. Word has length 98 [2019-09-10 07:53:04,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:04,983 INFO L475 AbstractCegarLoop]: Abstraction has 5590 states and 7586 transitions. [2019-09-10 07:53:04,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:53:04,983 INFO L276 IsEmpty]: Start isEmpty. Operand 5590 states and 7586 transitions. [2019-09-10 07:53:04,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:53:04,985 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:04,985 INFO L399 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] [2019-09-10 07:53:04,985 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:04,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:04,986 INFO L82 PathProgramCache]: Analyzing trace with hash 2097306132, now seen corresponding path program 1 times [2019-09-10 07:53:04,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:04,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:04,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:04,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:04,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:05,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:05,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:05,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:53:05,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:53:05,040 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:53:05,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:53:05,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:53:05,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:53:05,041 INFO L87 Difference]: Start difference. First operand 5590 states and 7586 transitions. Second operand 3 states. [2019-09-10 07:53:05,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:05,067 INFO L93 Difference]: Finished difference Result 5280 states and 7043 transitions. [2019-09-10 07:53:05,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:53:05,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 07:53:05,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:05,080 INFO L225 Difference]: With dead ends: 5280 [2019-09-10 07:53:05,080 INFO L226 Difference]: Without dead ends: 5280 [2019-09-10 07:53:05,080 INFO L628 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-09-10 07:53:05,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5280 states. [2019-09-10 07:53:05,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5280 to 4614. [2019-09-10 07:53:05,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4614 states. [2019-09-10 07:53:05,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4614 states to 4614 states and 6164 transitions. [2019-09-10 07:53:05,147 INFO L78 Accepts]: Start accepts. Automaton has 4614 states and 6164 transitions. Word has length 99 [2019-09-10 07:53:05,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:05,147 INFO L475 AbstractCegarLoop]: Abstraction has 4614 states and 6164 transitions. [2019-09-10 07:53:05,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:53:05,148 INFO L276 IsEmpty]: Start isEmpty. Operand 4614 states and 6164 transitions. [2019-09-10 07:53:05,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:53:05,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:05,149 INFO L399 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] [2019-09-10 07:53:05,149 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:05,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:05,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1226521472, now seen corresponding path program 1 times [2019-09-10 07:53:05,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:05,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:05,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:05,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:05,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:05,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:05,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:05,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:53:05,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:53:05,200 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:53:05,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:53:05,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:53:05,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:53:05,204 INFO L87 Difference]: Start difference. First operand 4614 states and 6164 transitions. Second operand 3 states. [2019-09-10 07:53:05,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:05,234 INFO L93 Difference]: Finished difference Result 6852 states and 8963 transitions. [2019-09-10 07:53:05,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:53:05,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-10 07:53:05,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:05,246 INFO L225 Difference]: With dead ends: 6852 [2019-09-10 07:53:05,247 INFO L226 Difference]: Without dead ends: 6852 [2019-09-10 07:53:05,247 INFO L628 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-09-10 07:53:05,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6852 states. [2019-09-10 07:53:05,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6852 to 4968. [2019-09-10 07:53:05,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4968 states. [2019-09-10 07:53:05,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4968 states to 4968 states and 6542 transitions. [2019-09-10 07:53:05,320 INFO L78 Accepts]: Start accepts. Automaton has 4968 states and 6542 transitions. Word has length 100 [2019-09-10 07:53:05,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:05,320 INFO L475 AbstractCegarLoop]: Abstraction has 4968 states and 6542 transitions. [2019-09-10 07:53:05,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:53:05,320 INFO L276 IsEmpty]: Start isEmpty. Operand 4968 states and 6542 transitions. [2019-09-10 07:53:05,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 07:53:05,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:05,321 INFO L399 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] [2019-09-10 07:53:05,322 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:05,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:05,322 INFO L82 PathProgramCache]: Analyzing trace with hash -82823700, now seen corresponding path program 1 times [2019-09-10 07:53:05,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:05,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:05,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:05,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:05,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:05,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:05,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:05,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:53:05,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:53:05,375 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:53:05,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:53:05,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:53:05,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:53:05,376 INFO L87 Difference]: Start difference. First operand 4968 states and 6542 transitions. Second operand 3 states. [2019-09-10 07:53:05,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:05,404 INFO L93 Difference]: Finished difference Result 6014 states and 7705 transitions. [2019-09-10 07:53:05,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:53:05,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-09-10 07:53:05,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:05,414 INFO L225 Difference]: With dead ends: 6014 [2019-09-10 07:53:05,415 INFO L226 Difference]: Without dead ends: 6014 [2019-09-10 07:53:05,415 INFO L628 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-09-10 07:53:05,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6014 states. [2019-09-10 07:53:05,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6014 to 5698. [2019-09-10 07:53:05,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5698 states. [2019-09-10 07:53:05,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5698 states to 5698 states and 7390 transitions. [2019-09-10 07:53:05,484 INFO L78 Accepts]: Start accepts. Automaton has 5698 states and 7390 transitions. Word has length 101 [2019-09-10 07:53:05,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:05,484 INFO L475 AbstractCegarLoop]: Abstraction has 5698 states and 7390 transitions. [2019-09-10 07:53:05,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:53:05,485 INFO L276 IsEmpty]: Start isEmpty. Operand 5698 states and 7390 transitions. [2019-09-10 07:53:05,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:53:05,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:05,486 INFO L399 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] [2019-09-10 07:53:05,486 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:05,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:05,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1734817196, now seen corresponding path program 1 times [2019-09-10 07:53:05,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:05,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:05,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:05,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:05,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:05,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:05,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:53:05,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:53:05,545 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:53:05,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:53:05,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:53:05,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:53:05,545 INFO L87 Difference]: Start difference. First operand 5698 states and 7390 transitions. Second operand 3 states. [2019-09-10 07:53:05,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:05,573 INFO L93 Difference]: Finished difference Result 6064 states and 7755 transitions. [2019-09-10 07:53:05,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:53:05,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-10 07:53:05,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:05,584 INFO L225 Difference]: With dead ends: 6064 [2019-09-10 07:53:05,584 INFO L226 Difference]: Without dead ends: 6064 [2019-09-10 07:53:05,585 INFO L628 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-09-10 07:53:05,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6064 states. [2019-09-10 07:53:05,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6064 to 5942. [2019-09-10 07:53:05,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5942 states. [2019-09-10 07:53:05,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5942 states to 5942 states and 7634 transitions. [2019-09-10 07:53:05,668 INFO L78 Accepts]: Start accepts. Automaton has 5942 states and 7634 transitions. Word has length 102 [2019-09-10 07:53:05,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:05,668 INFO L475 AbstractCegarLoop]: Abstraction has 5942 states and 7634 transitions. [2019-09-10 07:53:05,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:53:05,668 INFO L276 IsEmpty]: Start isEmpty. Operand 5942 states and 7634 transitions. [2019-09-10 07:53:05,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 07:53:05,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:05,671 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:53:05,675 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:05,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:05,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1955395367, now seen corresponding path program 1 times [2019-09-10 07:53:05,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:05,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:05,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:05,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:05,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:05,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:05,800 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 07:53:05,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:53:05,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:53:05,801 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:53:05,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:53:05,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:53:05,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:53:05,802 INFO L87 Difference]: Start difference. First operand 5942 states and 7634 transitions. Second operand 6 states. [2019-09-10 07:53:06,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:06,021 INFO L93 Difference]: Finished difference Result 23714 states and 30362 transitions. [2019-09-10 07:53:06,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:53:06,021 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 126 [2019-09-10 07:53:06,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:06,054 INFO L225 Difference]: With dead ends: 23714 [2019-09-10 07:53:06,054 INFO L226 Difference]: Without dead ends: 23714 [2019-09-10 07:53:06,056 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:53:06,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23714 states. [2019-09-10 07:53:06,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23714 to 9734. [2019-09-10 07:53:06,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9734 states. [2019-09-10 07:53:06,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9734 states to 9734 states and 12442 transitions. [2019-09-10 07:53:06,255 INFO L78 Accepts]: Start accepts. Automaton has 9734 states and 12442 transitions. Word has length 126 [2019-09-10 07:53:06,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:06,255 INFO L475 AbstractCegarLoop]: Abstraction has 9734 states and 12442 transitions. [2019-09-10 07:53:06,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:53:06,255 INFO L276 IsEmpty]: Start isEmpty. Operand 9734 states and 12442 transitions. [2019-09-10 07:53:06,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 07:53:06,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:06,258 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:53:06,259 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:06,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:06,259 INFO L82 PathProgramCache]: Analyzing trace with hash 100336857, now seen corresponding path program 1 times [2019-09-10 07:53:06,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:06,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:06,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:06,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:06,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:06,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:06,386 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 07:53:06,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:53:06,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:53:06,387 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:53:06,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:53:06,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:53:06,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:53:06,388 INFO L87 Difference]: Start difference. First operand 9734 states and 12442 transitions. Second operand 6 states. [2019-09-10 07:53:06,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:06,534 INFO L93 Difference]: Finished difference Result 27206 states and 34762 transitions. [2019-09-10 07:53:06,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:53:06,535 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 126 [2019-09-10 07:53:06,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:06,566 INFO L225 Difference]: With dead ends: 27206 [2019-09-10 07:53:06,566 INFO L226 Difference]: Without dead ends: 27206 [2019-09-10 07:53:06,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:53:06,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27206 states. [2019-09-10 07:53:06,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27206 to 15390. [2019-09-10 07:53:06,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15390 states. [2019-09-10 07:53:06,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15390 states to 15390 states and 19574 transitions. [2019-09-10 07:53:06,800 INFO L78 Accepts]: Start accepts. Automaton has 15390 states and 19574 transitions. Word has length 126 [2019-09-10 07:53:06,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:06,800 INFO L475 AbstractCegarLoop]: Abstraction has 15390 states and 19574 transitions. [2019-09-10 07:53:06,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:53:06,801 INFO L276 IsEmpty]: Start isEmpty. Operand 15390 states and 19574 transitions. [2019-09-10 07:53:06,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 07:53:06,803 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:06,803 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:53:06,804 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:06,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:06,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1975486169, now seen corresponding path program 1 times [2019-09-10 07:53:06,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:06,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:06,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:06,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:06,805 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:06,867 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:06,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:53:06,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:53:06,867 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:53:06,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:53:06,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:53:06,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:53:06,868 INFO L87 Difference]: Start difference. First operand 15390 states and 19574 transitions. Second operand 3 states. [2019-09-10 07:53:06,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:06,904 INFO L93 Difference]: Finished difference Result 13756 states and 16991 transitions. [2019-09-10 07:53:06,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:53:06,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-10 07:53:06,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:06,914 INFO L225 Difference]: With dead ends: 13756 [2019-09-10 07:53:06,915 INFO L226 Difference]: Without dead ends: 13756 [2019-09-10 07:53:06,915 INFO L628 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-09-10 07:53:06,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13756 states. [2019-09-10 07:53:07,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13756 to 13694. [2019-09-10 07:53:07,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13694 states. [2019-09-10 07:53:07,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13694 states to 13694 states and 16918 transitions. [2019-09-10 07:53:07,620 INFO L78 Accepts]: Start accepts. Automaton has 13694 states and 16918 transitions. Word has length 126 [2019-09-10 07:53:07,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:07,621 INFO L475 AbstractCegarLoop]: Abstraction has 13694 states and 16918 transitions. [2019-09-10 07:53:07,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:53:07,621 INFO L276 IsEmpty]: Start isEmpty. Operand 13694 states and 16918 transitions. [2019-09-10 07:53:07,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 07:53:07,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:07,623 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:53:07,623 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:07,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:07,623 INFO L82 PathProgramCache]: Analyzing trace with hash -430522632, now seen corresponding path program 1 times [2019-09-10 07:53:07,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:07,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:07,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:07,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:07,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:07,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:07,747 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 07:53:07,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:53:07,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:53:07,748 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:53:07,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:53:07,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:53:07,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:53:07,749 INFO L87 Difference]: Start difference. First operand 13694 states and 16918 transitions. Second operand 6 states. [2019-09-10 07:53:07,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:07,866 INFO L93 Difference]: Finished difference Result 26954 states and 33444 transitions. [2019-09-10 07:53:07,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:53:07,868 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2019-09-10 07:53:07,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:07,889 INFO L225 Difference]: With dead ends: 26954 [2019-09-10 07:53:07,889 INFO L226 Difference]: Without dead ends: 26954 [2019-09-10 07:53:07,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:53:07,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26954 states. [2019-09-10 07:53:08,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26954 to 17230. [2019-09-10 07:53:08,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17230 states. [2019-09-10 07:53:08,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17230 states to 17230 states and 21278 transitions. [2019-09-10 07:53:08,085 INFO L78 Accepts]: Start accepts. Automaton has 17230 states and 21278 transitions. Word has length 127 [2019-09-10 07:53:08,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:08,085 INFO L475 AbstractCegarLoop]: Abstraction has 17230 states and 21278 transitions. [2019-09-10 07:53:08,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:53:08,085 INFO L276 IsEmpty]: Start isEmpty. Operand 17230 states and 21278 transitions. [2019-09-10 07:53:08,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 07:53:08,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:08,087 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:53:08,087 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:08,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:08,088 INFO L82 PathProgramCache]: Analyzing trace with hash 674022136, now seen corresponding path program 1 times [2019-09-10 07:53:08,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:08,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:08,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:08,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:08,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:08,245 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 07:53:08,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:53:08,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:53:08,246 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:53:08,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:53:08,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:53:08,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:53:08,247 INFO L87 Difference]: Start difference. First operand 17230 states and 21278 transitions. Second operand 6 states. [2019-09-10 07:53:08,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:08,437 INFO L93 Difference]: Finished difference Result 30370 states and 37656 transitions. [2019-09-10 07:53:08,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:53:08,438 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2019-09-10 07:53:08,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:08,462 INFO L225 Difference]: With dead ends: 30370 [2019-09-10 07:53:08,462 INFO L226 Difference]: Without dead ends: 30370 [2019-09-10 07:53:08,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:53:08,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30370 states. [2019-09-10 07:53:08,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30370 to 20766. [2019-09-10 07:53:08,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20766 states. [2019-09-10 07:53:08,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20766 states to 20766 states and 25638 transitions. [2019-09-10 07:53:08,775 INFO L78 Accepts]: Start accepts. Automaton has 20766 states and 25638 transitions. Word has length 127 [2019-09-10 07:53:08,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:08,776 INFO L475 AbstractCegarLoop]: Abstraction has 20766 states and 25638 transitions. [2019-09-10 07:53:08,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:53:08,776 INFO L276 IsEmpty]: Start isEmpty. Operand 20766 states and 25638 transitions. [2019-09-10 07:53:08,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 07:53:08,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:08,778 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:53:08,779 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:08,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:08,779 INFO L82 PathProgramCache]: Analyzing trace with hash -827875054, now seen corresponding path program 1 times [2019-09-10 07:53:08,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:08,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:08,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:08,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:08,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:08,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:08,922 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 07:53:08,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:53:08,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:53:08,923 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:53:08,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:53:08,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:53:08,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:53:08,925 INFO L87 Difference]: Start difference. First operand 20766 states and 25638 transitions. Second operand 9 states. [2019-09-10 07:53:09,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:09,394 INFO L93 Difference]: Finished difference Result 41468 states and 51207 transitions. [2019-09-10 07:53:09,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:53:09,394 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2019-09-10 07:53:09,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:09,428 INFO L225 Difference]: With dead ends: 41468 [2019-09-10 07:53:09,428 INFO L226 Difference]: Without dead ends: 41468 [2019-09-10 07:53:09,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:53:09,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41468 states. [2019-09-10 07:53:09,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41468 to 20766. [2019-09-10 07:53:09,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20766 states. [2019-09-10 07:53:09,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20766 states to 20766 states and 25637 transitions. [2019-09-10 07:53:09,670 INFO L78 Accepts]: Start accepts. Automaton has 20766 states and 25637 transitions. Word has length 128 [2019-09-10 07:53:09,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:09,671 INFO L475 AbstractCegarLoop]: Abstraction has 20766 states and 25637 transitions. [2019-09-10 07:53:09,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:53:09,671 INFO L276 IsEmpty]: Start isEmpty. Operand 20766 states and 25637 transitions. [2019-09-10 07:53:09,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 07:53:09,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:09,673 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:53:09,673 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:09,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:09,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1614558263, now seen corresponding path program 1 times [2019-09-10 07:53:09,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:09,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:09,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:09,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:09,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:09,936 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:09,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:53:09,937 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:53:09,938 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 131 with the following transitions: [2019-09-10 07:53:09,939 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [76], [79], [82], [86], [89], [92], [96], [99], [102], [106], [109], [112], [115], [119], [122], [125], [129], [132], [136], [139], [142], [191], [194], [197], [199], [202], [206], [208], [213], [221], [249], [289], [292], [295], [298], [355], [1124], [1127], [1128], [1130], [1200], [1203], [1206], [1209], [1250], [1639], [1642], [1645], [1648], [1674], [1850], [1853], [1857], [1860], [1863], [1867], [1869], [1872], [1877], [1879], [1894], [1896], [1898], [1901], [1916], [1918], [1920], [1923], [1938], [1940], [1942], [1945], [1960], [1962], [1964], [1966], [1969], [1972], [1980], [1982], [1985], [1988], [1996], [1998], [2001], [2004], [2012], [2014], [2017], [2020], [2028], [2065], [2066], [2070], [2071], [2072] [2019-09-10 07:53:09,983 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:53:09,983 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:53:10,202 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:53:11,244 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:53:11,249 INFO L272 AbstractInterpreter]: Visited 121 different actions 654 times. Merged at 47 different actions 463 times. Widened at 20 different actions 71 times. Performed 2221 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2221 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 75 fixpoints after 16 different actions. Largest state had 189 variables. [2019-09-10 07:53:11,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:11,255 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:53:11,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:53:11,256 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:53:11,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:11,271 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:53:11,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:11,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 1084 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 07:53:11,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:53:11,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:11,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:12,235 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:12,235 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:53:12,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:12,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:12,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:12,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:12,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:12,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:12,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:12,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:12,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:12,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:12,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:12,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:12,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:12,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:12,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:12,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:12,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:12,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:12,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:12,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:12,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:12,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:12,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:12,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:13,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:13,919 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:13,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:53:13,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 30 [2019-09-10 07:53:13,934 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:53:13,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:53:13,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:53:13,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=777, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:53:13,938 INFO L87 Difference]: Start difference. First operand 20766 states and 25637 transitions. Second operand 20 states. [2019-09-10 07:53:14,386 WARN L188 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 07:53:15,138 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 07:53:15,698 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 07:53:16,036 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 07:53:16,603 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-09-10 07:53:17,138 WARN L188 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 07:53:17,603 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-09-10 07:53:17,948 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 07:53:18,224 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-10 07:53:18,621 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-10 07:53:18,848 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-10 07:53:19,161 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 07:53:19,578 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2019-09-10 07:53:19,924 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-10 07:53:20,364 WARN L188 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-09-10 07:53:20,812 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-10 07:53:21,524 WARN L188 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-09-10 07:53:21,798 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-10 07:53:22,151 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 84 [2019-09-10 07:53:22,438 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-10 07:53:23,030 WARN L188 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 07:53:23,379 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-09-10 07:53:24,047 WARN L188 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-10 07:53:24,572 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 89 [2019-09-10 07:53:24,911 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-09-10 07:53:25,313 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2019-09-10 07:53:25,710 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2019-09-10 07:53:26,116 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-09-10 07:53:26,670 WARN L188 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 89 [2019-09-10 07:53:27,250 WARN L188 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2019-09-10 07:53:27,663 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-09-10 07:53:28,133 WARN L188 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2019-09-10 07:53:28,495 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-10 07:53:28,888 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-09-10 07:53:29,865 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-09-10 07:53:30,270 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-10 07:53:30,949 WARN L188 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-10 07:53:31,311 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-09-10 07:53:31,745 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-10 07:53:32,329 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-09-10 07:53:32,726 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-10 07:53:33,152 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-10 07:53:33,640 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-10 07:53:34,031 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-09-10 07:53:34,343 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-09-10 07:53:34,809 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 84 [2019-09-10 07:53:35,098 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-10 07:53:35,483 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 84 [2019-09-10 07:53:35,946 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 93 [2019-09-10 07:53:36,324 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2019-09-10 07:53:36,752 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 93 [2019-09-10 07:53:37,008 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-10 07:53:37,382 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2019-09-10 07:53:37,760 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 87 [2019-09-10 07:53:38,026 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-10 07:53:38,381 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-09-10 07:53:38,691 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-10 07:53:38,973 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-10 07:53:39,287 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2019-09-10 07:53:39,684 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-10 07:53:40,112 WARN L188 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-09-10 07:53:40,598 WARN L188 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 88 [2019-09-10 07:53:40,933 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-09-10 07:53:41,560 WARN L188 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 85 [2019-09-10 07:53:41,885 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-09-10 07:53:42,315 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-10 07:53:42,718 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-10 07:53:43,056 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2019-09-10 07:53:43,391 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-09-10 07:53:43,776 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2019-09-10 07:53:44,140 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-10 07:53:44,538 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-10 07:53:44,839 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-10 07:53:45,179 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-09-10 07:53:45,640 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-09-10 07:53:46,002 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-10 07:53:46,307 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-10 07:53:46,824 WARN L188 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-09-10 07:53:47,139 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-10 07:53:47,456 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-10 07:53:47,860 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 07:53:48,149 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-10 07:53:48,463 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 07:53:48,747 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-09-10 07:53:49,044 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-09-10 07:53:49,317 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-10 07:53:49,629 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2019-09-10 07:53:50,125 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 81 [2019-09-10 07:53:50,544 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-10 07:53:50,892 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 07:53:51,142 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 07:53:51,565 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 82 [2019-09-10 07:53:52,023 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-09-10 07:53:52,561 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 87 [2019-09-10 07:53:53,000 WARN L188 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-09-10 07:53:53,525 WARN L188 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-10 07:53:54,104 WARN L188 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 07:53:56,750 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 79 [2019-09-10 07:53:57,020 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-10 07:53:57,613 WARN L188 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 79 [2019-09-10 07:53:58,008 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-10 07:53:58,356 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-09-10 07:53:58,764 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 88 [2019-09-10 07:53:59,239 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-10 07:53:59,777 WARN L188 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-10 07:54:00,231 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-10 07:54:00,512 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-10 07:54:00,877 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-10 07:54:01,182 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 07:54:01,698 WARN L188 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-10 07:54:02,051 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-10 07:54:02,496 WARN L188 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-10 07:54:02,903 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-10 07:54:03,545 WARN L188 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-10 07:54:03,873 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-10 07:54:04,144 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-10 07:54:04,556 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-09-10 07:54:04,980 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 89 [2019-09-10 07:54:05,387 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 89 [2019-09-10 07:54:05,861 WARN L188 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-09-10 07:54:05,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:54:05,927 INFO L93 Difference]: Finished difference Result 92968 states and 113065 transitions. [2019-09-10 07:54:05,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-09-10 07:54:05,928 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 130 [2019-09-10 07:54:05,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:54:06,205 INFO L225 Difference]: With dead ends: 92968 [2019-09-10 07:54:06,205 INFO L226 Difference]: Without dead ends: 92968 [2019-09-10 07:54:06,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 223 SyntacticMatches, 19 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7744 ImplicationChecksByTransitivity, 48.5s TimeCoverageRelationStatistics Valid=4649, Invalid=18607, Unknown=0, NotChecked=0, Total=23256 [2019-09-10 07:54:06,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92968 states. [2019-09-10 07:54:07,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92968 to 62446. [2019-09-10 07:54:07,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62446 states. [2019-09-10 07:54:08,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62446 states to 62446 states and 76768 transitions. [2019-09-10 07:54:08,010 INFO L78 Accepts]: Start accepts. Automaton has 62446 states and 76768 transitions. Word has length 130 [2019-09-10 07:54:08,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:54:08,011 INFO L475 AbstractCegarLoop]: Abstraction has 62446 states and 76768 transitions. [2019-09-10 07:54:08,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:54:08,012 INFO L276 IsEmpty]: Start isEmpty. Operand 62446 states and 76768 transitions. [2019-09-10 07:54:08,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 07:54:08,018 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:54:08,019 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:54:08,019 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:54:08,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:54:08,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1802869750, now seen corresponding path program 1 times [2019-09-10 07:54:08,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:54:08,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:54:08,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:54:08,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:54:08,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:54:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:54:08,375 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:54:08,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:54:08,375 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:54:08,376 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 132 with the following transitions: [2019-09-10 07:54:08,376 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [76], [79], [82], [86], [89], [92], [96], [99], [102], [106], [109], [112], [115], [119], [122], [125], [129], [132], [136], [139], [142], [191], [194], [199], [202], [206], [219], [221], [249], [289], [292], [295], [298], [355], [1124], [1127], [1128], [1130], [1200], [1203], [1206], [1209], [1250], [1639], [1642], [1645], [1648], [1674], [1850], [1853], [1857], [1860], [1863], [1867], [1869], [1872], [1877], [1879], [1882], [1887], [1890], [1896], [1898], [1901], [1904], [1909], [1912], [1918], [1920], [1923], [1938], [1940], [1942], [1945], [1960], [1962], [1964], [1966], [1969], [1972], [1980], [1982], [1985], [1988], [1996], [1998], [2001], [2004], [2012], [2014], [2017], [2020], [2028], [2065], [2066], [2070], [2071], [2072] [2019-09-10 07:54:08,389 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:54:08,390 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:54:08,437 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:54:08,890 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:54:08,891 INFO L272 AbstractInterpreter]: Visited 123 different actions 610 times. Merged at 50 different actions 431 times. Widened at 19 different actions 80 times. Performed 2076 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2076 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 49 fixpoints after 14 different actions. Largest state had 189 variables. [2019-09-10 07:54:08,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:54:08,891 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:54:08,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:54:08,891 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:54:08,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:54:08,906 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:54:09,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:54:09,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 1089 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 07:54:09,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:54:09,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:09,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:09,661 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:54:09,662 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:54:09,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:09,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:09,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:09,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:09,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:09,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:09,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:09,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:09,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:09,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:09,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:09,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:09,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:09,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:09,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:09,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:09,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:09,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:09,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:09,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:09,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:09,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:09,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:09,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:09,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:09,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:09,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:09,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:09,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:09,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:09,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:09,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:09,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:11,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:11,859 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Abandoning pump threads because process wont die! [2019-09-10 07:54:12,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:54:12,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2019-09-10 07:54:12,880 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:54:12,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:54:12,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:54:12,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:54:12,883 INFO L87 Difference]: Start difference. First operand 62446 states and 76768 transitions. Second operand 20 states. [2019-09-10 07:54:13,192 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-10 07:54:13,590 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-09-10 07:54:13,957 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 07:54:14,189 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:54:14,739 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:54:14,958 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:54:15,300 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:54:15,605 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:54:15,902 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:54:16,217 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:54:16,498 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:54:16,685 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:54:17,054 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:54:17,483 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:54:18,094 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:54:18,358 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:54:18,742 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:54:21,897 WARN L188 SmtUtils]: Spent 3.12 s on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:54:22,253 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 07:54:22,647 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 07:54:23,123 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 07:54:23,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:54:23,355 INFO L93 Difference]: Finished difference Result 185400 states and 224275 transitions. [2019-09-10 07:54:23,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 07:54:23,355 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 131 [2019-09-10 07:54:23,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:54:23,573 INFO L225 Difference]: With dead ends: 185400 [2019-09-10 07:54:23,573 INFO L226 Difference]: Without dead ends: 185400 [2019-09-10 07:54:23,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 227 SyntacticMatches, 22 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=648, Invalid=1704, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 07:54:23,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185400 states. [2019-09-10 07:54:25,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185400 to 125402. [2019-09-10 07:54:25,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125402 states. [2019-09-10 07:54:27,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125402 states to 125402 states and 153348 transitions. [2019-09-10 07:54:27,483 INFO L78 Accepts]: Start accepts. Automaton has 125402 states and 153348 transitions. Word has length 131 [2019-09-10 07:54:27,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:54:27,483 INFO L475 AbstractCegarLoop]: Abstraction has 125402 states and 153348 transitions. [2019-09-10 07:54:27,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:54:27,483 INFO L276 IsEmpty]: Start isEmpty. Operand 125402 states and 153348 transitions. [2019-09-10 07:54:27,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 07:54:27,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:54:27,495 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:54:27,495 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:54:27,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:54:27,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1670981759, now seen corresponding path program 1 times [2019-09-10 07:54:27,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:54:27,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:54:27,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:54:27,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:54:27,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:54:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:54:27,703 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:54:27,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:54:27,703 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:54:27,704 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 133 with the following transitions: [2019-09-10 07:54:27,705 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [76], [79], [82], [86], [89], [92], [96], [99], [102], [106], [109], [112], [115], [119], [122], [125], [129], [132], [136], [139], [144], [191], [194], [199], [202], [206], [219], [221], [247], [249], [289], [292], [295], [298], [355], [1124], [1127], [1128], [1130], [1200], [1203], [1206], [1209], [1250], [1639], [1642], [1645], [1648], [1674], [1850], [1853], [1857], [1860], [1863], [1867], [1869], [1872], [1877], [1879], [1882], [1887], [1890], [1896], [1898], [1901], [1916], [1918], [1920], [1923], [1926], [1931], [1934], [1940], [1942], [1945], [1960], [1962], [1964], [1966], [1969], [1972], [1980], [1982], [1985], [1988], [1996], [1998], [2001], [2004], [2012], [2014], [2017], [2020], [2028], [2065], [2066], [2070], [2071], [2072] [2019-09-10 07:54:27,712 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:54:27,713 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:54:27,753 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:54:28,351 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:54:28,353 INFO L272 AbstractInterpreter]: Visited 124 different actions 591 times. Merged at 50 different actions 413 times. Widened at 19 different actions 76 times. Performed 2001 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2001 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 43 fixpoints after 10 different actions. Largest state had 189 variables. [2019-09-10 07:54:28,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:54:28,353 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:54:28,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:54:28,354 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:54:28,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:54:28,386 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:54:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:54:28,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 1088 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 07:54:28,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:54:28,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:28,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:28,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:28,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:29,031 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:54:29,031 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:54:29,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:29,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:29,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:29,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:29,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:30,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:30,792 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:54:30,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:54:30,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2019-09-10 07:54:30,796 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:54:30,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:54:30,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:54:30,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=752, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:54:30,797 INFO L87 Difference]: Start difference. First operand 125402 states and 153348 transitions. Second operand 20 states. [2019-09-10 07:54:33,680 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2019-09-10 07:54:36,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:54:36,218 INFO L93 Difference]: Finished difference Result 255534 states and 312002 transitions. [2019-09-10 07:54:36,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-10 07:54:36,218 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 132 [2019-09-10 07:54:36,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:54:36,472 INFO L225 Difference]: With dead ends: 255534 [2019-09-10 07:54:36,472 INFO L226 Difference]: Without dead ends: 255534 [2019-09-10 07:54:36,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 225 SyntacticMatches, 20 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1545 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=896, Invalid=3526, Unknown=0, NotChecked=0, Total=4422 [2019-09-10 07:54:36,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255534 states. [2019-09-10 07:54:38,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255534 to 104376. [2019-09-10 07:54:38,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104376 states. [2019-09-10 07:54:38,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104376 states to 104376 states and 127709 transitions. [2019-09-10 07:54:38,574 INFO L78 Accepts]: Start accepts. Automaton has 104376 states and 127709 transitions. Word has length 132 [2019-09-10 07:54:38,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:54:38,574 INFO L475 AbstractCegarLoop]: Abstraction has 104376 states and 127709 transitions. [2019-09-10 07:54:38,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:54:38,574 INFO L276 IsEmpty]: Start isEmpty. Operand 104376 states and 127709 transitions. [2019-09-10 07:54:38,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 07:54:38,580 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:54:38,580 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:54:38,580 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:54:38,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:54:38,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1519808077, now seen corresponding path program 1 times [2019-09-10 07:54:38,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:54:38,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:54:38,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:54:38,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:54:38,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:54:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:54:38,852 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:54:38,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:54:38,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:54:38,853 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 133 with the following transitions: [2019-09-10 07:54:38,853 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [76], [79], [82], [86], [89], [92], [96], [99], [102], [106], [109], [112], [115], [119], [122], [125], [129], [132], [136], [139], [142], [191], [194], [199], [202], [206], [219], [221], [249], [289], [292], [295], [298], [355], [1124], [1127], [1128], [1130], [1200], [1203], [1206], [1209], [1250], [1639], [1642], [1645], [1648], [1674], [1850], [1853], [1857], [1860], [1863], [1867], [1869], [1872], [1877], [1879], [1882], [1885], [1896], [1898], [1901], [1904], [1909], [1912], [1918], [1920], [1923], [1926], [1931], [1934], [1940], [1942], [1945], [1960], [1962], [1964], [1966], [1969], [1972], [1980], [1982], [1985], [1988], [1996], [1998], [2001], [2004], [2012], [2014], [2017], [2020], [2028], [2065], [2066], [2070], [2071], [2072] [2019-09-10 07:54:38,858 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:54:38,858 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:54:38,885 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:54:41,327 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:54:41,328 INFO L272 AbstractInterpreter]: Visited 124 different actions 549 times. Merged at 51 different actions 378 times. Widened at 15 different actions 49 times. Performed 1918 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1918 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 41 fixpoints after 11 different actions. Largest state had 189 variables. [2019-09-10 07:54:41,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:54:41,328 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:54:41,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:54:41,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:54:41,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:54:41,353 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:54:41,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:54:41,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 1091 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 07:54:41,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:54:41,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:42,139 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:54:42,140 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:54:42,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:43,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:43,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:43,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:43,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:46,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:47,064 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:54:47,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:54:47,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2019-09-10 07:54:47,068 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:54:47,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:54:47,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:54:47,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:54:47,069 INFO L87 Difference]: Start difference. First operand 104376 states and 127709 transitions. Second operand 20 states. [2019-09-10 07:54:52,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:54:52,600 INFO L93 Difference]: Finished difference Result 333580 states and 399206 transitions. [2019-09-10 07:54:52,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 07:54:52,600 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 132 [2019-09-10 07:54:52,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:54:52,947 INFO L225 Difference]: With dead ends: 333580 [2019-09-10 07:54:52,948 INFO L226 Difference]: Without dead ends: 333580 [2019-09-10 07:54:52,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 214 SyntacticMatches, 37 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=648, Invalid=1704, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 07:54:53,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333580 states. [2019-09-10 07:54:55,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333580 to 211480. [2019-09-10 07:54:55,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211480 states. [2019-09-10 07:54:55,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211480 states to 211480 states and 257403 transitions. [2019-09-10 07:54:55,681 INFO L78 Accepts]: Start accepts. Automaton has 211480 states and 257403 transitions. Word has length 132 [2019-09-10 07:54:55,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:54:55,681 INFO L475 AbstractCegarLoop]: Abstraction has 211480 states and 257403 transitions. [2019-09-10 07:54:55,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:54:55,682 INFO L276 IsEmpty]: Start isEmpty. Operand 211480 states and 257403 transitions. [2019-09-10 07:54:55,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 07:54:55,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:54:55,693 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:54:55,693 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:54:55,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:54:55,694 INFO L82 PathProgramCache]: Analyzing trace with hash -789917506, now seen corresponding path program 1 times [2019-09-10 07:54:55,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:54:55,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:54:55,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:54:55,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:54:55,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:54:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:54:56,799 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:54:56,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:54:56,799 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:54:56,800 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 134 with the following transitions: [2019-09-10 07:54:56,800 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [76], [79], [82], [86], [89], [92], [96], [99], [102], [106], [109], [112], [115], [119], [122], [125], [129], [132], [136], [139], [142], [191], [194], [199], [202], [206], [219], [221], [249], [289], [292], [295], [298], [355], [1124], [1127], [1128], [1130], [1200], [1203], [1206], [1209], [1250], [1639], [1642], [1645], [1648], [1674], [1850], [1853], [1857], [1860], [1863], [1867], [1869], [1872], [1877], [1879], [1882], [1885], [1896], [1898], [1901], [1904], [1907], [1918], [1920], [1923], [1926], [1931], [1934], [1940], [1942], [1945], [1948], [1953], [1956], [1962], [1964], [1966], [1969], [1972], [1980], [1982], [1985], [1988], [1996], [1998], [2001], [2004], [2012], [2014], [2017], [2020], [2028], [2065], [2066], [2070], [2071], [2072] [2019-09-10 07:54:56,803 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:54:56,804 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:54:59,444 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:54:59,942 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:54:59,943 INFO L272 AbstractInterpreter]: Visited 125 different actions 720 times. Merged at 52 different actions 534 times. Widened at 18 different actions 85 times. Performed 2465 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2465 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 57 fixpoints after 13 different actions. Largest state had 189 variables. [2019-09-10 07:54:59,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:54:59,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:54:59,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:54:59,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:54:59,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:54:59,958 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:55:00,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:00,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 1093 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-10 07:55:00,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:55:00,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:00,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:00,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:01,069 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 07:55:01,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:01,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:01,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:01,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:02,244 WARN L188 SmtUtils]: Spent 853.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-09-10 07:55:02,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 12 terms [2019-09-10 07:55:03,933 WARN L188 SmtUtils]: Spent 368.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-09-10 07:55:03,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 12 terms [2019-09-10 07:55:04,452 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 46 [2019-09-10 07:55:04,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:04,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:05,281 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-10 07:55:05,281 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:55:06,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:06,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:06,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:06,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:07,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:07,758 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2019-09-10 07:55:08,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:08,708 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-10 07:55:08,729 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:55:08,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23, 23] imperfect sequences [18] total 60 [2019-09-10 07:55:08,729 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:55:08,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 07:55:08,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 07:55:08,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=3258, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 07:55:08,730 INFO L87 Difference]: Start difference. First operand 211480 states and 257403 transitions. Second operand 23 states. [2019-09-10 07:55:11,269 WARN L188 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 96 DAG size of output: 92 [2019-09-10 07:55:12,405 WARN L188 SmtUtils]: Spent 807.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 172 [2019-09-10 07:55:13,190 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 75 [2019-09-10 07:55:13,983 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 07:55:19,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:55:19,531 INFO L93 Difference]: Finished difference Result 611373 states and 744747 transitions. [2019-09-10 07:55:19,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:55:19,532 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 133 [2019-09-10 07:55:19,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:55:20,249 INFO L225 Difference]: With dead ends: 611373 [2019-09-10 07:55:20,249 INFO L226 Difference]: Without dead ends: 611373 [2019-09-10 07:55:20,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 220 SyntacticMatches, 5 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1219 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=464, Invalid=4506, Unknown=0, NotChecked=0, Total=4970 [2019-09-10 07:55:20,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611373 states. [2019-09-10 07:55:27,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611373 to 211495. [2019-09-10 07:55:27,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211495 states. [2019-09-10 07:55:27,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211495 states to 211495 states and 257420 transitions. [2019-09-10 07:55:27,620 INFO L78 Accepts]: Start accepts. Automaton has 211495 states and 257420 transitions. Word has length 133 [2019-09-10 07:55:27,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:55:27,620 INFO L475 AbstractCegarLoop]: Abstraction has 211495 states and 257420 transitions. [2019-09-10 07:55:27,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 07:55:27,620 INFO L276 IsEmpty]: Start isEmpty. Operand 211495 states and 257420 transitions. [2019-09-10 07:55:27,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 07:55:27,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:55:27,632 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:55:27,632 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:55:27,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:27,632 INFO L82 PathProgramCache]: Analyzing trace with hash -897827669, now seen corresponding path program 1 times [2019-09-10 07:55:27,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:55:27,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:27,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:27,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:27,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:55:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:27,857 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:55:27,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:55:27,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:55:27,858 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 134 with the following transitions: [2019-09-10 07:55:27,858 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [76], [79], [82], [86], [89], [92], [96], [99], [102], [106], [109], [112], [115], [119], [122], [125], [129], [132], [136], [139], [142], [191], [194], [199], [202], [206], [219], [221], [249], [289], [292], [295], [298], [355], [1124], [1127], [1128], [1130], [1200], [1203], [1206], [1209], [1250], [1639], [1642], [1645], [1650], [1672], [1674], [1850], [1853], [1857], [1860], [1863], [1867], [1869], [1872], [1877], [1879], [1894], [1896], [1898], [1901], [1904], [1907], [1918], [1920], [1923], [1926], [1931], [1934], [1940], [1942], [1945], [1948], [1953], [1956], [1962], [1964], [1966], [1969], [1972], [1980], [1982], [1985], [1988], [1996], [1998], [2001], [2004], [2012], [2014], [2017], [2020], [2028], [2065], [2066], [2070], [2071], [2072] [2019-09-10 07:55:27,860 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:55:27,860 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:55:27,888 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:55:28,776 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:55:28,776 INFO L272 AbstractInterpreter]: Visited 125 different actions 452 times. Merged at 51 different actions 288 times. Widened at 13 different actions 26 times. Performed 1612 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1612 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 32 fixpoints after 12 different actions. Largest state had 189 variables. [2019-09-10 07:55:28,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:28,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:55:28,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:55:28,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:55:28,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:28,797 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:55:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:28,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 1090 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 07:55:28,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:55:29,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:29,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:29,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:29,227 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:55:29,227 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:55:29,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:29,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:29,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:29,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:29,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:30,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:30,475 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:55:30,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:55:30,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 28 [2019-09-10 07:55:30,486 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:55:30,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 07:55:30,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 07:55:30,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:55:30,487 INFO L87 Difference]: Start difference. First operand 211495 states and 257420 transitions. Second operand 19 states. [2019-09-10 07:55:40,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:55:40,763 INFO L93 Difference]: Finished difference Result 575836 states and 696436 transitions. [2019-09-10 07:55:40,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-10 07:55:40,764 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 133 [2019-09-10 07:55:40,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:55:41,381 INFO L225 Difference]: With dead ends: 575836 [2019-09-10 07:55:41,382 INFO L226 Difference]: Without dead ends: 575836 [2019-09-10 07:55:41,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 216 SyntacticMatches, 33 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2409 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1326, Invalid=4836, Unknown=0, NotChecked=0, Total=6162 [2019-09-10 07:55:41,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575836 states. [2019-09-10 07:55:44,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575836 to 296103. [2019-09-10 07:55:44,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296103 states. [2019-09-10 07:55:45,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296103 states to 296103 states and 359684 transitions. [2019-09-10 07:55:45,213 INFO L78 Accepts]: Start accepts. Automaton has 296103 states and 359684 transitions. Word has length 133 [2019-09-10 07:55:45,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:55:45,213 INFO L475 AbstractCegarLoop]: Abstraction has 296103 states and 359684 transitions. [2019-09-10 07:55:45,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 07:55:45,213 INFO L276 IsEmpty]: Start isEmpty. Operand 296103 states and 359684 transitions. [2019-09-10 07:55:45,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 07:55:45,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:55:45,225 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:55:45,225 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:55:45,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:45,226 INFO L82 PathProgramCache]: Analyzing trace with hash 625720963, now seen corresponding path program 1 times [2019-09-10 07:55:45,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:55:45,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:45,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:45,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:45,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:55:45,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:46,179 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:55:46,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:55:46,180 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:55:46,180 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 134 with the following transitions: [2019-09-10 07:55:46,180 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [76], [79], [82], [86], [89], [92], [96], [99], [102], [106], [109], [112], [115], [119], [122], [125], [129], [132], [136], [139], [142], [191], [194], [199], [202], [206], [219], [221], [249], [289], [292], [295], [298], [355], [1124], [1127], [1128], [1130], [1200], [1203], [1206], [1211], [1248], [1250], [1639], [1642], [1645], [1648], [1674], [1850], [1853], [1857], [1860], [1863], [1867], [1869], [1872], [1877], [1879], [1882], [1885], [1896], [1898], [1901], [1904], [1909], [1912], [1918], [1920], [1923], [1926], [1931], [1934], [1940], [1942], [1945], [1960], [1962], [1964], [1966], [1969], [1972], [1980], [1982], [1985], [1988], [1996], [1998], [2001], [2004], [2012], [2014], [2017], [2020], [2028], [2065], [2066], [2070], [2071], [2072] [2019-09-10 07:55:46,183 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:55:46,183 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:55:46,217 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:55:46,632 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:55:46,632 INFO L272 AbstractInterpreter]: Visited 125 different actions 636 times. Merged at 51 different actions 457 times. Widened at 16 different actions 73 times. Performed 2129 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2129 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 50 fixpoints after 12 different actions. Largest state had 189 variables. [2019-09-10 07:55:46,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:46,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:55:46,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:55:46,633 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:55:46,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:46,660 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:55:46,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:46,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 1090 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 07:55:46,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:55:46,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:46,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:46,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:46,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:47,094 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:55:47,094 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:55:47,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:47,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:47,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:47,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:47,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:47,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:48,086 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:55:48,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:55:48,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 29 [2019-09-10 07:55:48,090 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:55:48,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 07:55:48,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 07:55:48,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:55:48,091 INFO L87 Difference]: Start difference. First operand 296103 states and 359684 transitions. Second operand 19 states. [2019-09-10 07:56:00,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:00,396 INFO L93 Difference]: Finished difference Result 859153 states and 1026613 transitions. [2019-09-10 07:56:00,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-10 07:56:00,396 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 133 [2019-09-10 07:56:00,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:01,456 INFO L225 Difference]: With dead ends: 859153 [2019-09-10 07:56:01,456 INFO L226 Difference]: Without dead ends: 859153 [2019-09-10 07:56:01,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 230 SyntacticMatches, 18 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2118 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1264, Invalid=5216, Unknown=0, NotChecked=0, Total=6480 [2019-09-10 07:56:01,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859153 states. [2019-09-10 07:56:07,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859153 to 296063. [2019-09-10 07:56:07,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296063 states. [2019-09-10 07:56:07,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296063 states to 296063 states and 359642 transitions. [2019-09-10 07:56:07,804 INFO L78 Accepts]: Start accepts. Automaton has 296063 states and 359642 transitions. Word has length 133 [2019-09-10 07:56:07,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:07,804 INFO L475 AbstractCegarLoop]: Abstraction has 296063 states and 359642 transitions. [2019-09-10 07:56:07,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 07:56:07,804 INFO L276 IsEmpty]: Start isEmpty. Operand 296063 states and 359642 transitions. [2019-09-10 07:56:07,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 07:56:07,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:07,814 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:56:07,815 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:07,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:07,815 INFO L82 PathProgramCache]: Analyzing trace with hash 410100622, now seen corresponding path program 1 times [2019-09-10 07:56:07,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:07,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:07,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:07,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:07,816 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:08,066 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:56:08,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:56:08,066 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:56:08,066 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 134 with the following transitions: [2019-09-10 07:56:08,067 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [76], [79], [82], [86], [89], [92], [96], [99], [102], [106], [109], [112], [115], [119], [122], [125], [129], [132], [136], [139], [142], [191], [194], [199], [202], [206], [219], [221], [249], [289], [292], [295], [300], [353], [355], [1124], [1127], [1128], [1130], [1200], [1203], [1206], [1209], [1250], [1639], [1642], [1645], [1648], [1674], [1850], [1853], [1857], [1860], [1863], [1867], [1869], [1872], [1877], [1879], [1882], [1885], [1896], [1898], [1901], [1904], [1909], [1912], [1918], [1920], [1923], [1938], [1940], [1942], [1945], [1948], [1953], [1956], [1962], [1964], [1966], [1969], [1972], [1980], [1982], [1985], [1988], [1996], [1998], [2001], [2004], [2012], [2014], [2017], [2020], [2028], [2065], [2066], [2070], [2071], [2072] [2019-09-10 07:56:08,070 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:56:08,070 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:56:08,097 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:56:08,373 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:56:08,373 INFO L272 AbstractInterpreter]: Visited 125 different actions 494 times. Merged at 51 different actions 327 times. Widened at 16 different actions 36 times. Performed 1777 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1777 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 34 fixpoints after 13 different actions. Largest state had 189 variables. [2019-09-10 07:56:08,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:08,373 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:56:08,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:56:08,374 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:56:08,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:08,390 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:56:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:08,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 1090 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 07:56:08,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:56:08,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:08,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:08,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:08,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:08,886 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:56:08,886 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:56:08,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:09,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:09,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:09,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:09,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:09,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:09,826 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:56:09,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:56:09,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2019-09-10 07:56:09,830 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:56:09,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:56:09,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:56:09,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=759, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:56:09,831 INFO L87 Difference]: Start difference. First operand 296063 states and 359642 transitions. Second operand 20 states. [2019-09-10 07:56:13,033 WARN L188 SmtUtils]: Spent 3.17 s on a formula simplification. DAG size of input: 44 DAG size of output: 26 [2019-09-10 07:56:16,783 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 33 [2019-09-10 07:56:24,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:24,247 INFO L93 Difference]: Finished difference Result 1177585 states and 1414362 transitions. [2019-09-10 07:56:24,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-10 07:56:24,247 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 133 [2019-09-10 07:56:24,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:25,598 INFO L225 Difference]: With dead ends: 1177585 [2019-09-10 07:56:25,598 INFO L226 Difference]: Without dead ends: 1177585 [2019-09-10 07:56:25,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 229 SyntacticMatches, 19 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2327 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=1501, Invalid=5809, Unknown=0, NotChecked=0, Total=7310 [2019-09-10 07:56:26,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177585 states. [2019-09-10 07:56:39,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177585 to 296037. [2019-09-10 07:56:39,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296037 states. [2019-09-10 07:56:39,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296037 states to 296037 states and 359614 transitions. [2019-09-10 07:56:39,890 INFO L78 Accepts]: Start accepts. Automaton has 296037 states and 359614 transitions. Word has length 133 [2019-09-10 07:56:39,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:39,891 INFO L475 AbstractCegarLoop]: Abstraction has 296037 states and 359614 transitions. [2019-09-10 07:56:39,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:56:39,891 INFO L276 IsEmpty]: Start isEmpty. Operand 296037 states and 359614 transitions. [2019-09-10 07:56:39,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 07:56:39,895 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:39,895 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:56:39,895 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:39,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:39,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1909109261, now seen corresponding path program 1 times [2019-09-10 07:56:39,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:39,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:39,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:39,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:39,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:39,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:40,598 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:56:40,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:56:40,598 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:56:40,598 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 135 with the following transitions: [2019-09-10 07:56:40,598 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [76], [79], [82], [86], [89], [92], [96], [99], [102], [106], [109], [112], [115], [119], [122], [125], [129], [132], [136], [139], [144], [191], [194], [199], [202], [206], [219], [221], [247], [249], [289], [292], [295], [298], [355], [1124], [1127], [1128], [1130], [1200], [1203], [1206], [1209], [1250], [1639], [1642], [1645], [1648], [1674], [1850], [1853], [1857], [1860], [1863], [1867], [1869], [1872], [1877], [1879], [1882], [1885], [1896], [1898], [1901], [1904], [1907], [1918], [1920], [1923], [1926], [1931], [1934], [1940], [1942], [1945], [1948], [1953], [1956], [1962], [1964], [1966], [1969], [1972], [1980], [1982], [1985], [1988], [1996], [1998], [2001], [2004], [2012], [2014], [2017], [2020], [2028], [2065], [2066], [2070], [2071], [2072] [2019-09-10 07:56:40,603 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:56:40,603 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:56:40,625 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:56:41,004 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:56:41,005 INFO L272 AbstractInterpreter]: Visited 126 different actions 614 times. Merged at 52 different actions 434 times. Widened at 17 different actions 58 times. Performed 2089 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2089 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 48 fixpoints after 12 different actions. Largest state had 189 variables. [2019-09-10 07:56:41,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:41,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:56:41,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:56:41,006 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:56:41,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:41,020 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:56:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:41,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 1092 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-10 07:56:41,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:56:41,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:41,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:41,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:42,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:42,488 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:56:42,488 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:56:43,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:43,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:43,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:45,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:45,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:45,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:45,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 07:56:45,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:45,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:48,196 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:56:48,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:56:48,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 51 [2019-09-10 07:56:48,201 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:56:48,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-10 07:56:48,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-10 07:56:48,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=2381, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 07:56:48,202 INFO L87 Difference]: Start difference. First operand 296037 states and 359614 transitions. Second operand 36 states. [2019-09-10 07:56:48,488 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 54 [2019-09-10 07:56:49,733 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2019-09-10 07:56:49,989 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2019-09-10 07:56:50,629 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2019-09-10 07:56:51,360 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 07:56:54,486 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-10 07:56:55,391 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 07:56:55,824 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-10 07:56:56,977 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 07:56:57,425 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-10 07:56:57,857 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 07:56:58,466 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 07:57:01,986 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 07:57:04,743 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 07:57:05,827 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 07:57:06,094 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-10 07:57:07,072 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 07:57:07,407 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 07:57:08,671 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 07:57:08,903 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 07:57:14,473 WARN L188 SmtUtils]: Spent 2.44 s on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 07:57:15,532 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 07:57:16,744 WARN L188 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-10 07:57:17,443 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 07:57:18,491 WARN L188 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:57:20,417 WARN L188 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 07:57:21,420 WARN L188 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 07:57:23,021 WARN L188 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-10 07:57:24,066 WARN L188 SmtUtils]: Spent 762.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 07:57:25,749 WARN L188 SmtUtils]: Spent 803.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:57:26,400 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 07:57:27,159 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-10 07:57:30,122 WARN L188 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 07:57:30,693 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-09-10 07:57:32,252 WARN L188 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:57:35,076 WARN L188 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-10 07:57:36,037 WARN L188 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 07:57:37,490 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 07:57:38,370 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 07:57:40,141 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 07:57:40,535 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-09-10 07:57:41,710 WARN L188 SmtUtils]: Spent 767.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-09-10 07:57:42,567 WARN L188 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 07:57:47,390 WARN L188 SmtUtils]: Spent 2.54 s on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:57:47,742 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 07:57:52,367 WARN L188 SmtUtils]: Spent 2.98 s on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 07:57:53,861 WARN L188 SmtUtils]: Spent 789.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2019-09-10 07:57:55,881 WARN L188 SmtUtils]: Spent 691.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:57:56,378 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 07:57:57,254 WARN L188 SmtUtils]: Spent 784.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2019-09-10 07:57:57,978 WARN L188 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 07:57:58,258 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 07:57:58,914 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-10 07:57:59,642 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 07:58:00,545 WARN L188 SmtUtils]: Spent 796.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2019-09-10 07:58:01,997 WARN L188 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 07:58:02,406 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 07:58:03,417 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-10 07:58:04,428 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2019-09-10 07:58:06,483 WARN L188 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 07:58:06,890 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 07:58:08,237 WARN L188 SmtUtils]: Spent 918.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 07:58:09,222 WARN L188 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:58:10,293 WARN L188 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 07:58:10,603 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 07:58:13,853 WARN L188 SmtUtils]: Spent 2.78 s on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 07:58:17,504 WARN L188 SmtUtils]: Spent 3.21 s on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-09-10 07:58:18,054 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 07:58:20,999 WARN L188 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:58:21,762 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-10 07:58:22,997 WARN L188 SmtUtils]: Spent 956.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 07:58:23,819 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 07:58:25,160 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 07:58:26,069 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 07:58:27,339 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 07:58:28,192 WARN L188 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 07:58:30,322 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-10 07:58:30,641 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 07:58:31,257 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 07:58:33,126 WARN L188 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 07:58:33,514 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 07:58:34,493 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 07:58:35,149 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 07:58:35,508 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-09-10 07:58:36,420 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 07:58:38,981 WARN L188 SmtUtils]: Spent 2.39 s on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 07:58:39,837 WARN L188 SmtUtils]: Spent 764.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2019-09-10 07:58:44,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:58:44,026 INFO L93 Difference]: Finished difference Result 853495 states and 1023731 transitions. [2019-09-10 07:58:44,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2019-09-10 07:58:44,026 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 134 [2019-09-10 07:58:44,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:58:45,080 INFO L225 Difference]: With dead ends: 853495 [2019-09-10 07:58:45,080 INFO L226 Difference]: Without dead ends: 853495 [2019-09-10 07:58:45,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 201 SyntacticMatches, 38 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16774 ImplicationChecksByTransitivity, 87.0s TimeCoverageRelationStatistics Valid=5768, Invalid=43738, Unknown=0, NotChecked=0, Total=49506 [2019-09-10 07:58:45,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853495 states. [2019-09-10 07:58:59,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853495 to 440511. [2019-09-10 07:58:59,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440511 states. [2019-09-10 07:59:00,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440511 states to 440511 states and 531625 transitions. [2019-09-10 07:59:00,696 INFO L78 Accepts]: Start accepts. Automaton has 440511 states and 531625 transitions. Word has length 134 [2019-09-10 07:59:00,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:00,696 INFO L475 AbstractCegarLoop]: Abstraction has 440511 states and 531625 transitions. [2019-09-10 07:59:00,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-10 07:59:00,696 INFO L276 IsEmpty]: Start isEmpty. Operand 440511 states and 531625 transitions. [2019-09-10 07:59:00,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 07:59:00,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:00,702 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:59:00,702 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:00,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:00,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1367763597, now seen corresponding path program 1 times [2019-09-10 07:59:00,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:00,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:00,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:00,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:00,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:00,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:01,270 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:59:01,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:59:01,270 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:59:01,270 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 135 with the following transitions: [2019-09-10 07:59:01,272 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [76], [79], [82], [86], [89], [92], [96], [99], [102], [106], [109], [112], [115], [119], [122], [125], [129], [132], [136], [139], [144], [191], [194], [199], [202], [206], [219], [221], [247], [249], [289], [292], [295], [298], [355], [1124], [1127], [1128], [1130], [1200], [1203], [1206], [1209], [1250], [1639], [1642], [1645], [1648], [1674], [1850], [1853], [1857], [1860], [1863], [1867], [1869], [1872], [1877], [1879], [1882], [1887], [1890], [1896], [1898], [1901], [1904], [1909], [1912], [1918], [1920], [1923], [1926], [1929], [1940], [1942], [1945], [1948], [1951], [1962], [1964], [1966], [1969], [1972], [1980], [1982], [1985], [1988], [1996], [1998], [2001], [2004], [2012], [2014], [2017], [2020], [2028], [2065], [2066], [2070], [2071], [2072] [2019-09-10 07:59:01,275 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:59:01,275 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:59:01,291 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:59:01,603 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:59:01,603 INFO L272 AbstractInterpreter]: Visited 126 different actions 555 times. Merged at 52 different actions 383 times. Widened at 16 different actions 54 times. Performed 1991 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1991 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 42 fixpoints after 12 different actions. Largest state had 189 variables. [2019-09-10 07:59:01,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:01,604 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:59:01,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:59:01,604 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:59:01,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:01,624 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:59:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:01,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 1092 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 07:59:01,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:59:01,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:59:01,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:59:01,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:59:02,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:59:02,237 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:59:02,238 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:59:02,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:59:02,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:59:02,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:59:02,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:59:02,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:59:02,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:59:02,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:59:02,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:59:02,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:59:02,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:59:02,566 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:59:02,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:59:02,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 27 [2019-09-10 07:59:02,571 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:59:02,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:59:02,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:59:02,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:59:02,572 INFO L87 Difference]: Start difference. First operand 440511 states and 531625 transitions. Second operand 21 states. [2019-09-10 07:59:08,025 WARN L188 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 75 DAG size of output: 35 [2019-09-10 07:59:08,194 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-09-10 07:59:08,401 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-10 07:59:08,580 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 34 [2019-09-10 07:59:08,801 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-10 07:59:09,119 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-09-10 07:59:09,766 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-10 07:59:10,185 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-09-10 07:59:11,107 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 39 [2019-09-10 07:59:11,343 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2019-09-10 07:59:11,599 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-09-10 07:59:13,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:13,818 INFO L93 Difference]: Finished difference Result 958484 states and 1152385 transitions. [2019-09-10 07:59:13,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-10 07:59:13,819 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 134 [2019-09-10 07:59:13,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:14,959 INFO L225 Difference]: With dead ends: 958484 [2019-09-10 07:59:14,959 INFO L226 Difference]: Without dead ends: 958484 [2019-09-10 07:59:14,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 250 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=642, Invalid=2780, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 07:59:16,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958484 states. [2019-09-10 07:59:29,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958484 to 781084. [2019-09-10 07:59:29,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781084 states. [2019-09-10 07:59:40,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781084 states to 781084 states and 942086 transitions. [2019-09-10 07:59:40,699 INFO L78 Accepts]: Start accepts. Automaton has 781084 states and 942086 transitions. Word has length 134 [2019-09-10 07:59:40,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:40,699 INFO L475 AbstractCegarLoop]: Abstraction has 781084 states and 942086 transitions. [2019-09-10 07:59:40,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:59:40,699 INFO L276 IsEmpty]: Start isEmpty. Operand 781084 states and 942086 transitions. [2019-09-10 07:59:40,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 07:59:40,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:40,710 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:59:40,710 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:40,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:40,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1722149876, now seen corresponding path program 1 times [2019-09-10 07:59:40,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:40,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:40,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:40,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:40,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:41,252 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:59:41,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:59:41,252 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:59:41,252 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 135 with the following transitions: [2019-09-10 07:59:41,254 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [76], [79], [82], [86], [89], [92], [96], [99], [102], [106], [109], [112], [115], [119], [122], [125], [129], [132], [136], [139], [142], [191], [194], [199], [202], [206], [219], [221], [249], [289], [292], [295], [298], [355], [1124], [1127], [1128], [1130], [1200], [1203], [1206], [1209], [1250], [1639], [1642], [1645], [1650], [1672], [1674], [1850], [1853], [1857], [1860], [1863], [1867], [1869], [1872], [1877], [1879], [1882], [1885], [1896], [1898], [1901], [1904], [1907], [1918], [1920], [1923], [1926], [1931], [1934], [1940], [1942], [1945], [1948], [1953], [1956], [1962], [1964], [1966], [1969], [1972], [1980], [1982], [1985], [1988], [1996], [1998], [2001], [2004], [2012], [2014], [2017], [2020], [2028], [2065], [2066], [2070], [2071], [2072] [2019-09-10 07:59:41,256 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:59:41,256 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:59:41,284 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:59:41,573 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:59:41,573 INFO L272 AbstractInterpreter]: Visited 126 different actions 537 times. Merged at 52 different actions 365 times. Widened at 14 different actions 39 times. Performed 1889 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1889 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 40 fixpoints after 11 different actions. Largest state had 189 variables. [2019-09-10 07:59:41,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:41,573 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:59:41,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:59:41,574 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:59:41,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:41,591 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:59:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:41,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 1092 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-10 07:59:41,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:59:42,856 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:59:42,856 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:59:43,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:59:44,273 WARN L188 SmtUtils]: Spent 974.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 24 [2019-09-10 07:59:47,565 WARN L188 SmtUtils]: Spent 562.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-09-10 07:59:47,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:59:47,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:59:47,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:59:48,272 WARN L188 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2019-09-10 07:59:49,198 WARN L188 SmtUtils]: Spent 731.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-09-10 07:59:49,448 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:59:49,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:59:49,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 19] total 52 [2019-09-10 07:59:49,452 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:59:49,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-10 07:59:49,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-10 07:59:49,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=2438, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 07:59:49,453 INFO L87 Difference]: Start difference. First operand 781084 states and 942086 transitions. Second operand 35 states. [2019-09-10 07:59:52,364 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-10 07:59:52,630 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 07:59:52,984 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-09-10 07:59:53,369 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-09-10 07:59:53,831 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-09-10 07:59:56,155 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-09-10 07:59:58,629 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-10 07:59:58,954 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-10 07:59:59,378 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-09-10 08:00:01,166 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-10 08:00:01,427 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-09-10 08:00:04,571 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-09-10 08:00:05,002 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 08:00:05,310 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:00:06,480 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-10 08:00:07,118 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-09-10 08:00:09,951 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:00:10,206 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-09-10 08:00:12,821 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-10 08:00:13,068 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-09-10 08:00:13,325 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 08:00:13,655 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:00:15,373 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-10 08:00:15,635 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-10 08:00:15,896 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-10 08:00:16,121 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 08:00:16,701 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 08:00:17,056 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-10 08:00:17,379 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-09-10 08:00:18,685 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-10 08:00:19,548 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-09-10 08:00:19,840 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-10 08:00:20,070 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-10 08:00:20,494 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 08:00:21,260 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 41 [2019-09-10 08:00:21,505 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 08:00:21,949 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 08:00:22,449 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:00:23,019 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-10 08:00:23,187 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-10 08:00:23,409 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:00:23,630 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:00:23,909 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-09-10 08:00:24,111 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-10 08:00:24,356 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-09-10 08:00:24,977 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-09-10 08:00:25,542 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-10 08:00:26,240 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-10 08:00:26,440 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-10 08:00:27,081 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-10 08:00:27,498 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-10 08:00:27,753 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 08:00:28,037 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:00:28,368 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-10 08:00:28,603 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:00:28,797 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 08:00:29,063 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 08:00:31,308 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:00:33,053 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:00:33,471 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-09-10 08:00:34,131 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-09-10 08:00:34,466 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-09-10 08:00:34,785 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-09-10 08:00:35,328 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2019-09-10 08:00:35,618 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-10 08:00:36,111 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:00:36,742 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 08:00:41,132 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-09-10 08:00:43,568 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2019-09-10 08:00:49,134 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-09-10 08:00:49,323 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 08:00:50,040 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-10 08:00:50,306 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:00:50,679 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 08:00:51,034 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-10 08:00:52,179 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 08:00:53,657 WARN L188 SmtUtils]: Spent 624.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-09-10 08:00:54,218 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 08:00:58,313 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-10 08:01:00,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:00,986 INFO L93 Difference]: Finished difference Result 1797551 states and 2156516 transitions. [2019-09-10 08:01:00,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2019-09-10 08:01:00,986 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 134 [2019-09-10 08:01:00,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:14,992 INFO L225 Difference]: With dead ends: 1797551 [2019-09-10 08:01:14,992 INFO L226 Difference]: Without dead ends: 1797551 [2019-09-10 08:01:14,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 216 SyntacticMatches, 18 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12857 ImplicationChecksByTransitivity, 44.9s TimeCoverageRelationStatistics Valid=4257, Invalid=35145, Unknown=0, NotChecked=0, Total=39402 [2019-09-10 08:01:15,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1797551 states. [2019-09-10 08:01:42,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1797551 to 1125379. [2019-09-10 08:01:42,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125379 states. [2019-09-10 08:01:46,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125379 states to 1125379 states and 1356781 transitions. [2019-09-10 08:01:46,420 INFO L78 Accepts]: Start accepts. Automaton has 1125379 states and 1356781 transitions. Word has length 134 [2019-09-10 08:01:46,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:46,420 INFO L475 AbstractCegarLoop]: Abstraction has 1125379 states and 1356781 transitions. [2019-09-10 08:01:46,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-10 08:01:46,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1125379 states and 1356781 transitions. [2019-09-10 08:01:46,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:01:46,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:46,436 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 08:01:46,436 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:46,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:46,436 INFO L82 PathProgramCache]: Analyzing trace with hash 232940602, now seen corresponding path program 1 times [2019-09-10 08:01:46,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:46,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:46,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:46,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:46,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:47,145 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:01:47,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:01:47,146 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:01:47,146 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 135 with the following transitions: [2019-09-10 08:01:47,146 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [76], [79], [82], [86], [89], [92], [96], [99], [102], [106], [109], [112], [115], [119], [122], [125], [129], [132], [136], [139], [142], [191], [194], [199], [202], [206], [219], [221], [249], [289], [292], [295], [298], [355], [1124], [1127], [1128], [1130], [1200], [1203], [1206], [1209], [1250], [1639], [1642], [1645], [1650], [1672], [1674], [1850], [1853], [1857], [1860], [1863], [1867], [1869], [1872], [1877], [1879], [1882], [1885], [1896], [1898], [1901], [1904], [1909], [1912], [1918], [1920], [1923], [1926], [1929], [1940], [1942], [1945], [1948], [1953], [1956], [1962], [1964], [1966], [1969], [1972], [1980], [1982], [1985], [1988], [1996], [1998], [2001], [2004], [2012], [2014], [2017], [2020], [2028], [2065], [2066], [2070], [2071], [2072] [2019-09-10 08:01:47,148 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:01:47,148 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:01:47,166 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:01:47,523 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:01:47,523 INFO L272 AbstractInterpreter]: Visited 126 different actions 653 times. Merged at 52 different actions 472 times. Widened at 17 different actions 70 times. Performed 2241 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2241 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 51 fixpoints after 13 different actions. Largest state had 189 variables. [2019-09-10 08:01:47,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:47,523 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:01:47,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:01:47,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:01:47,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:47,540 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:01:47,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:47,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 1092 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-10 08:01:47,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:01:49,922 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:01:49,922 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:01:50,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:01:50,946 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:01:50,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:01:50,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17, 16] total 52 [2019-09-10 08:01:50,951 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:01:50,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-10 08:01:50,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-10 08:01:50,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2470, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 08:01:50,952 INFO L87 Difference]: Start difference. First operand 1125379 states and 1356781 transitions. Second operand 38 states. [2019-09-10 08:01:51,166 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-09-10 08:01:56,149 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-10 08:01:56,605 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 08:01:56,814 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 08:01:57,054 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 08:01:57,696 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-10 08:02:08,140 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 08:02:08,373 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-10 08:02:08,990 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 08:02:09,703 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-09-10 08:02:10,983 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-09-10 08:02:11,322 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 08:02:12,029 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 08:02:12,924 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-09-10 08:02:14,688 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-09-10 08:02:14,969 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-09-10 08:02:15,187 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-09-10 08:02:15,394 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-09-10 08:02:15,656 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-09-10 08:02:16,233 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-09-10 08:02:16,679 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-10 08:02:19,111 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2019-09-10 08:02:19,361 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 08:02:21,210 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2019-09-10 08:02:21,469 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 08:02:21,796 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 08:02:22,418 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 08:02:22,746 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-09-10 08:02:22,985 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-09-10 08:02:23,604 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-09-10 08:02:24,303 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-09-10 08:02:24,682 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2019-09-10 08:02:24,906 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-09-10 08:02:25,155 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2019-09-10 08:02:25,574 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-09-10 08:02:26,103 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-09-10 08:02:26,434 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 08:02:26,726 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 08:02:26,999 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-09-10 08:02:27,301 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 08:02:28,281 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-09-10 08:02:28,519 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 08:02:28,818 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-09-10 08:02:29,147 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-10 08:02:29,384 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-09-10 08:02:29,667 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-09-10 08:02:29,934 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-09-10 08:02:32,340 WARN L188 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 08:02:32,662 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-10 08:02:32,907 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-09-10 08:02:33,188 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-09-10 08:02:33,473 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-09-10 08:02:33,935 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 08:02:34,261 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-09-10 08:02:34,557 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-09-10 08:02:35,000 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 08:02:35,612 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-09-10 08:02:35,852 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-09-10 08:02:36,113 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 08:02:36,392 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2019-09-10 08:02:36,718 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 08:02:37,016 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2019-09-10 08:02:37,323 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-09-10 08:02:37,563 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-09-10 08:02:37,843 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 08:02:38,360 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 08:02:39,012 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-09-10 08:02:39,295 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 08:02:39,696 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 08:02:40,580 WARN L188 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-09-10 08:02:41,192 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-09-10 08:02:41,525 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-09-10 08:02:41,898 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 08:02:42,142 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 79 [2019-09-10 08:02:42,406 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-09-10 08:02:42,862 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-10 08:02:43,243 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-09-10 08:02:43,508 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 08:02:43,788 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-09-10 08:02:44,175 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-09-10 08:02:44,581 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 08:02:45,591 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-09-10 08:02:45,864 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-09-10 08:02:46,116 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 08:02:46,439 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2019-09-10 08:02:46,866 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2019-09-10 08:02:47,251 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-09-10 08:02:47,466 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:02:47,782 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-09-10 08:02:48,236 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-09-10 08:02:48,901 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 08:02:49,192 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 08:02:49,386 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-10 08:02:49,618 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 08:02:49,896 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 08:02:50,127 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-10 08:02:50,347 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 08:02:50,542 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-10 08:02:50,795 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-09-10 08:02:51,545 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-09-10 08:02:51,855 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-09-10 08:02:52,039 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-10 08:02:52,540 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-09-10 08:02:52,994 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-09-10 08:02:53,264 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-09-10 08:02:53,584 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-09-10 08:02:54,412 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-09-10 08:02:54,606 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-09-10 08:02:54,831 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 08:02:55,038 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 08:02:55,669 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-10 08:02:55,890 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-09-10 08:02:56,123 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-09-10 08:02:56,356 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 08:02:56,579 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 08:02:58,326 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 08:02:58,515 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-09-10 08:02:59,374 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-09-10 08:02:59,605 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 08:03:01,941 WARN L188 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 08:03:04,205 WARN L188 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 08:03:04,756 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-09-10 08:03:05,100 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 08:03:05,346 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 08:03:05,593 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 08:03:05,806 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-10 08:03:06,299 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 08:03:06,642 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 08:03:08,016 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2019-09-10 08:03:08,314 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 08:03:08,574 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 08:03:08,783 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-10 08:03:09,475 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-10 08:03:09,701 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-09-10 08:03:10,018 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-09-10 08:03:10,297 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-10 08:03:10,649 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-09-10 08:03:10,817 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-10 08:03:11,024 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-10 08:03:11,181 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-09-10 08:03:11,786 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-09-10 08:03:12,055 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-10 08:03:12,310 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-10 08:03:12,633 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-09-10 08:03:12,859 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-10 08:03:13,464 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-10 08:03:14,100 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-09-10 08:03:14,292 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-09-10 08:03:14,593 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 08:03:14,998 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2019-09-10 08:03:15,726 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 08:03:16,303 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-09-10 08:03:16,747 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 08:03:16,988 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 08:03:17,774 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-09-10 08:03:17,993 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-09-10 08:03:18,212 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-10 08:03:18,613 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-10 08:03:18,870 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2019-09-10 08:03:19,116 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-10 08:03:19,309 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-10 08:03:19,566 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-09-10 08:03:19,758 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-09-10 08:03:19,975 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-10 08:03:20,414 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-10 08:03:20,761 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-09-10 08:03:20,964 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2019-09-10 08:03:21,292 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-09-10 08:03:21,643 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-10 08:03:21,851 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-10 08:03:22,025 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 08:03:22,310 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-10 08:03:23,071 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-09-10 08:03:23,327 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-09-10 08:03:23,647 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-09-10 08:03:24,308 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-09-10 08:03:24,484 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 08:03:24,846 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 08:03:25,035 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:03:25,419 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-09-10 08:03:25,829 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 08:03:26,509 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-09-10 08:03:27,049 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-09-10 08:03:30,341 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-09-10 08:03:31,823 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2019-09-10 08:03:32,757 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-09-10 08:03:34,015 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 70 [2019-09-10 08:03:34,225 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2019-09-10 08:03:34,412 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2019-09-10 08:03:34,642 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 75 [2019-09-10 08:03:35,499 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-09-10 08:03:35,676 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-09-10 08:03:35,920 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2019-09-10 08:03:36,166 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-09-10 08:03:36,568 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2019-09-10 08:03:37,017 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-09-10 08:03:37,711 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-10 08:03:38,175 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-10 08:03:38,365 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-10 08:03:38,579 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-09-10 08:03:38,852 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2019-09-10 08:03:39,303 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-09-10 08:03:40,053 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2019-09-10 08:03:40,491 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 08:03:40,786 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-09-10 08:03:41,014 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-09-10 08:03:41,413 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-09-10 08:03:41,742 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-09-10 08:03:42,061 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2019-09-10 08:03:42,240 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-10 08:03:42,803 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-09-10 08:03:42,973 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-09-10 08:03:43,318 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-09-10 08:03:43,689 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-09-10 08:03:44,015 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-09-10 08:03:44,415 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-09-10 08:03:44,622 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-09-10 08:03:44,874 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 08:03:45,218 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65