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.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:00:41,182 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:00:41,184 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:00:41,195 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:00:41,196 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:00:41,197 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:00:41,199 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:00:41,202 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:00:41,206 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:00:41,212 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:00:41,213 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:00:41,214 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:00:41,214 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:00:41,215 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:00:41,217 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:00:41,218 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:00:41,219 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:00:41,220 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:00:41,221 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:00:41,223 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:00:41,225 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:00:41,228 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:00:41,229 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:00:41,230 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:00:41,234 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:00:41,234 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:00:41,234 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:00:41,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:00:41,236 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:00:41,240 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:00:41,240 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:00:41,241 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:00:41,243 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:00:41,244 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:00:41,245 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:00:41,245 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:00:41,245 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:00:41,246 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:00:41,246 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:00:41,249 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:00:41,252 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:00:41,253 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 08:00:41,286 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:00:41,287 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:00:41,287 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:00:41,287 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:00:41,289 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:00:41,289 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:00:41,289 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:00:41,290 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:00:41,290 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:00:41,290 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:00:41,291 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:00:41,291 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:00:41,291 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:00:41,291 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:00:41,292 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:00:41,292 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:00:41,292 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:00:41,292 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:00:41,292 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:00:41,293 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:00:41,293 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:00:41,294 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:00:41,295 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:00:41,295 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:00:41,295 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:00:41,295 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:00:41,296 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:00:41,296 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:00:41,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:00:41,296 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:00:41,355 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:00:41,369 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:00:41,372 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:00:41,374 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:00:41,376 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:00:41,377 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 08:00:41,437 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a608953d9/a969234e745c427ca4c462e0a3be4145/FLAGcec0aaede [2019-09-10 08:00:42,178 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:00:42,179 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 08:00:42,215 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a608953d9/a969234e745c427ca4c462e0a3be4145/FLAGcec0aaede [2019-09-10 08:00:42,294 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a608953d9/a969234e745c427ca4c462e0a3be4145 [2019-09-10 08:00:42,306 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:00:42,308 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:00:42,309 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:00:42,309 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:00:42,313 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:00:42,314 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:00:42" (1/1) ... [2019-09-10 08:00:42,317 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@450f3575 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:00:42, skipping insertion in model container [2019-09-10 08:00:42,317 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:00:42" (1/1) ... [2019-09-10 08:00:42,325 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:00:42,471 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:00:43,477 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:00:43,491 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:00:43,859 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:00:43,900 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:00:43,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:00:43 WrapperNode [2019-09-10 08:00:43,901 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:00:43,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:00:43,902 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:00:43,902 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:00:43,917 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:00:43" (1/1) ... [2019-09-10 08:00:43,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:00:43" (1/1) ... [2019-09-10 08:00:43,978 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:00:43" (1/1) ... [2019-09-10 08:00:43,979 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:00:43" (1/1) ... [2019-09-10 08:00:44,064 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:00:43" (1/1) ... [2019-09-10 08:00:44,100 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:00:43" (1/1) ... [2019-09-10 08:00:44,114 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:00:43" (1/1) ... [2019-09-10 08:00:44,148 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:00:44,149 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:00:44,149 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:00:44,149 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:00:44,150 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:00:43" (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 08:00:44,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:00:44,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:00:44,219 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:00:44,220 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:00:44,220 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:00:44,220 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:00:44,220 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 08:00:44,220 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:00:44,221 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:00:44,221 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:00:44,221 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:00:44,222 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:00:44,222 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:00:44,223 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:00:44,223 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:00:44,224 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:00:44,224 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:00:44,225 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:00:44,225 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:00:44,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:00:44,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:00:47,642 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:00:47,642 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:00:47,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:00:47 BoogieIcfgContainer [2019-09-10 08:00:47,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:00:47,645 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:00:47,645 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:00:47,648 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:00:47,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:00:42" (1/3) ... [2019-09-10 08:00:47,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ab53d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:00:47, skipping insertion in model container [2019-09-10 08:00:47,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:00:43" (2/3) ... [2019-09-10 08:00:47,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ab53d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:00:47, skipping insertion in model container [2019-09-10 08:00:47,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:00:47" (3/3) ... [2019-09-10 08:00:47,652 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 08:00:47,663 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:00:47,672 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-09-10 08:00:47,691 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-09-10 08:00:47,723 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:00:47,723 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:00:47,723 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:00:47,723 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:00:47,724 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:00:47,724 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:00:47,724 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:00:47,724 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:00:47,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states. [2019-09-10 08:00:47,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 08:00:47,824 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:47,825 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] [2019-09-10 08:00:47,828 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:47,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:47,834 INFO L82 PathProgramCache]: Analyzing trace with hash 2026715041, now seen corresponding path program 1 times [2019-09-10 08:00:47,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:47,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:47,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:47,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:47,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:48,456 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 08:00:48,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:48,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:00:48,460 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:48,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:00:48,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:00:48,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:00:48,489 INFO L87 Difference]: Start difference. First operand 1116 states. Second operand 5 states. [2019-09-10 08:00:49,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:49,714 INFO L93 Difference]: Finished difference Result 716 states and 1233 transitions. [2019-09-10 08:00:49,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:00:49,716 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-09-10 08:00:49,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:49,737 INFO L225 Difference]: With dead ends: 716 [2019-09-10 08:00:49,737 INFO L226 Difference]: Without dead ends: 704 [2019-09-10 08:00:49,739 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 08:00:49,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-09-10 08:00:49,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 704. [2019-09-10 08:00:49,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2019-09-10 08:00:49,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 889 transitions. [2019-09-10 08:00:49,834 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 889 transitions. Word has length 76 [2019-09-10 08:00:49,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:49,834 INFO L475 AbstractCegarLoop]: Abstraction has 704 states and 889 transitions. [2019-09-10 08:00:49,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:00:49,835 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 889 transitions. [2019-09-10 08:00:49,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 08:00:49,839 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:49,839 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] [2019-09-10 08:00:49,840 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:49,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:49,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1438864747, now seen corresponding path program 1 times [2019-09-10 08:00:49,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:49,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:49,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:49,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:49,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:50,082 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 08:00:50,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:50,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:00:50,083 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:50,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:00:50,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:00:50,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:00:50,086 INFO L87 Difference]: Start difference. First operand 704 states and 889 transitions. Second operand 5 states. [2019-09-10 08:00:50,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:50,728 INFO L93 Difference]: Finished difference Result 546 states and 698 transitions. [2019-09-10 08:00:50,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:00:50,728 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-09-10 08:00:50,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:50,732 INFO L225 Difference]: With dead ends: 546 [2019-09-10 08:00:50,732 INFO L226 Difference]: Without dead ends: 546 [2019-09-10 08:00:50,733 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 08:00:50,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-09-10 08:00:50,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 546. [2019-09-10 08:00:50,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2019-09-10 08:00:50,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 698 transitions. [2019-09-10 08:00:50,751 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 698 transitions. Word has length 76 [2019-09-10 08:00:50,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:50,751 INFO L475 AbstractCegarLoop]: Abstraction has 546 states and 698 transitions. [2019-09-10 08:00:50,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:00:50,752 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 698 transitions. [2019-09-10 08:00:50,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 08:00:50,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:50,755 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] [2019-09-10 08:00:50,755 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:50,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:50,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1708480706, now seen corresponding path program 1 times [2019-09-10 08:00:50,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:50,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:50,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:50,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:50,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:50,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:50,940 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 08:00:50,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:50,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:00:50,941 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:50,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:00:50,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:00:50,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:00:50,947 INFO L87 Difference]: Start difference. First operand 546 states and 698 transitions. Second operand 5 states. [2019-09-10 08:00:51,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:51,832 INFO L93 Difference]: Finished difference Result 721 states and 943 transitions. [2019-09-10 08:00:51,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:00:51,833 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-09-10 08:00:51,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:51,837 INFO L225 Difference]: With dead ends: 721 [2019-09-10 08:00:51,837 INFO L226 Difference]: Without dead ends: 721 [2019-09-10 08:00:51,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:00:51,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2019-09-10 08:00:51,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 657. [2019-09-10 08:00:51,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-09-10 08:00:51,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 887 transitions. [2019-09-10 08:00:51,858 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 887 transitions. Word has length 76 [2019-09-10 08:00:51,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:51,858 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 887 transitions. [2019-09-10 08:00:51,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:00:51,859 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 887 transitions. [2019-09-10 08:00:51,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 08:00:51,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:51,862 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] [2019-09-10 08:00:51,862 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:51,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:51,863 INFO L82 PathProgramCache]: Analyzing trace with hash 755366932, now seen corresponding path program 1 times [2019-09-10 08:00:51,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:51,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:51,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:51,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:51,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:52,003 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 08:00:52,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:52,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:00:52,004 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:52,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:00:52,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:00:52,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:00:52,007 INFO L87 Difference]: Start difference. First operand 657 states and 887 transitions. Second operand 5 states. [2019-09-10 08:00:52,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:52,553 INFO L93 Difference]: Finished difference Result 641 states and 867 transitions. [2019-09-10 08:00:52,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:00:52,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-10 08:00:52,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:52,557 INFO L225 Difference]: With dead ends: 641 [2019-09-10 08:00:52,557 INFO L226 Difference]: Without dead ends: 641 [2019-09-10 08:00:52,558 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 08:00:52,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2019-09-10 08:00:52,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2019-09-10 08:00:52,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-09-10 08:00:52,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 867 transitions. [2019-09-10 08:00:52,575 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 867 transitions. Word has length 77 [2019-09-10 08:00:52,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:52,575 INFO L475 AbstractCegarLoop]: Abstraction has 641 states and 867 transitions. [2019-09-10 08:00:52,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:00:52,575 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 867 transitions. [2019-09-10 08:00:52,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 08:00:52,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:52,577 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] [2019-09-10 08:00:52,578 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:52,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:52,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1886479960, now seen corresponding path program 1 times [2019-09-10 08:00:52,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:52,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:52,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:52,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:52,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:52,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:52,667 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 08:00:52,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:52,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:00:52,667 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:52,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:00:52,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:00:52,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:00:52,669 INFO L87 Difference]: Start difference. First operand 641 states and 867 transitions. Second operand 5 states. [2019-09-10 08:00:53,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:53,158 INFO L93 Difference]: Finished difference Result 547 states and 740 transitions. [2019-09-10 08:00:53,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:00:53,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-10 08:00:53,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:53,162 INFO L225 Difference]: With dead ends: 547 [2019-09-10 08:00:53,162 INFO L226 Difference]: Without dead ends: 547 [2019-09-10 08:00:53,163 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 08:00:53,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-09-10 08:00:53,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2019-09-10 08:00:53,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 08:00:53,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 740 transitions. [2019-09-10 08:00:53,176 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 740 transitions. Word has length 78 [2019-09-10 08:00:53,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:53,177 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 740 transitions. [2019-09-10 08:00:53,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:00:53,177 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 740 transitions. [2019-09-10 08:00:53,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 08:00:53,178 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:53,178 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] [2019-09-10 08:00:53,179 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:53,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:53,179 INFO L82 PathProgramCache]: Analyzing trace with hash -213392593, now seen corresponding path program 1 times [2019-09-10 08:00:53,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:53,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:53,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:53,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:53,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:53,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:53,431 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 08:00:53,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:53,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:00:53,432 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:53,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:00:53,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:00:53,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:00:53,435 INFO L87 Difference]: Start difference. First operand 547 states and 740 transitions. Second operand 8 states. [2019-09-10 08:00:54,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:54,316 INFO L93 Difference]: Finished difference Result 775 states and 1025 transitions. [2019-09-10 08:00:54,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:00:54,316 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 79 [2019-09-10 08:00:54,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:54,321 INFO L225 Difference]: With dead ends: 775 [2019-09-10 08:00:54,321 INFO L226 Difference]: Without dead ends: 775 [2019-09-10 08:00:54,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:00:54,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-09-10 08:00:54,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 547. [2019-09-10 08:00:54,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 08:00:54,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 739 transitions. [2019-09-10 08:00:54,338 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 739 transitions. Word has length 79 [2019-09-10 08:00:54,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:54,339 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 739 transitions. [2019-09-10 08:00:54,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:00:54,339 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 739 transitions. [2019-09-10 08:00:54,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 08:00:54,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:54,341 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] [2019-09-10 08:00:54,341 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:54,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:54,342 INFO L82 PathProgramCache]: Analyzing trace with hash -929977429, now seen corresponding path program 1 times [2019-09-10 08:00:54,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:54,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:54,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:54,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:54,344 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:54,521 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 08:00:54,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:54,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:00:54,522 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:54,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:00:54,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:00:54,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:00:54,523 INFO L87 Difference]: Start difference. First operand 547 states and 739 transitions. Second operand 9 states. [2019-09-10 08:00:56,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:56,019 INFO L93 Difference]: Finished difference Result 1106 states and 1533 transitions. [2019-09-10 08:00:56,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:00:56,020 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2019-09-10 08:00:56,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:56,026 INFO L225 Difference]: With dead ends: 1106 [2019-09-10 08:00:56,026 INFO L226 Difference]: Without dead ends: 1106 [2019-09-10 08:00:56,027 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 08:00:56,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-09-10 08:00:56,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 547. [2019-09-10 08:00:56,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 08:00:56,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 738 transitions. [2019-09-10 08:00:56,047 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 738 transitions. Word has length 79 [2019-09-10 08:00:56,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:56,047 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 738 transitions. [2019-09-10 08:00:56,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:00:56,048 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 738 transitions. [2019-09-10 08:00:56,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 08:00:56,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:56,049 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] [2019-09-10 08:00:56,050 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:56,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:56,050 INFO L82 PathProgramCache]: Analyzing trace with hash -868457063, now seen corresponding path program 1 times [2019-09-10 08:00:56,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:56,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:56,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:56,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:56,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:56,206 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 08:00:56,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:56,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:00:56,206 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:56,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:00:56,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:00:56,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:00:56,208 INFO L87 Difference]: Start difference. First operand 547 states and 738 transitions. Second operand 9 states. [2019-09-10 08:00:58,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:58,142 INFO L93 Difference]: Finished difference Result 874 states and 1223 transitions. [2019-09-10 08:00:58,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:00:58,142 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2019-09-10 08:00:58,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:58,146 INFO L225 Difference]: With dead ends: 874 [2019-09-10 08:00:58,147 INFO L226 Difference]: Without dead ends: 874 [2019-09-10 08:00:58,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:00:58,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-09-10 08:00:58,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 547. [2019-09-10 08:00:58,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 08:00:58,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 737 transitions. [2019-09-10 08:00:58,165 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 737 transitions. Word has length 79 [2019-09-10 08:00:58,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:58,165 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 737 transitions. [2019-09-10 08:00:58,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:00:58,165 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 737 transitions. [2019-09-10 08:00:58,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 08:00:58,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:58,167 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] [2019-09-10 08:00:58,167 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:58,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:58,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1890090262, now seen corresponding path program 1 times [2019-09-10 08:00:58,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:58,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:58,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:58,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:58,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:58,332 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 08:00:58,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:58,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:00:58,332 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:58,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:00:58,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:00:58,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:00:58,333 INFO L87 Difference]: Start difference. First operand 547 states and 737 transitions. Second operand 9 states. [2019-09-10 08:00:59,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:59,735 INFO L93 Difference]: Finished difference Result 1106 states and 1528 transitions. [2019-09-10 08:00:59,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:00:59,735 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-10 08:00:59,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:59,741 INFO L225 Difference]: With dead ends: 1106 [2019-09-10 08:00:59,741 INFO L226 Difference]: Without dead ends: 1106 [2019-09-10 08:00:59,742 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 08:00:59,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-09-10 08:00:59,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 547. [2019-09-10 08:00:59,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 08:00:59,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 735 transitions. [2019-09-10 08:00:59,759 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 735 transitions. Word has length 81 [2019-09-10 08:00:59,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:59,759 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 735 transitions. [2019-09-10 08:00:59,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:00:59,759 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 735 transitions. [2019-09-10 08:00:59,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 08:00:59,761 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:59,761 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] [2019-09-10 08:00:59,761 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:59,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:59,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1898902830, now seen corresponding path program 1 times [2019-09-10 08:00:59,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:59,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:59,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:59,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:59,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:59,984 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 08:00:59,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:59,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:00:59,988 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:59,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:00:59,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:00:59,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:00:59,990 INFO L87 Difference]: Start difference. First operand 547 states and 735 transitions. Second operand 9 states. [2019-09-10 08:01:01,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:01,796 INFO L93 Difference]: Finished difference Result 1130 states and 1570 transitions. [2019-09-10 08:01:01,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:01:01,797 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-10 08:01:01,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:01,803 INFO L225 Difference]: With dead ends: 1130 [2019-09-10 08:01:01,804 INFO L226 Difference]: Without dead ends: 1130 [2019-09-10 08:01:01,804 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 08:01:01,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2019-09-10 08:01:01,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 547. [2019-09-10 08:01:01,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 08:01:01,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 733 transitions. [2019-09-10 08:01:01,822 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 733 transitions. Word has length 81 [2019-09-10 08:01:01,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:01,822 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 733 transitions. [2019-09-10 08:01:01,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:01:01,822 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 733 transitions. [2019-09-10 08:01:01,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 08:01:01,824 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:01,824 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] [2019-09-10 08:01:01,824 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:01,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:01,825 INFO L82 PathProgramCache]: Analyzing trace with hash 59601677, now seen corresponding path program 1 times [2019-09-10 08:01:01,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:01,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:01,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:01,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:01,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:01,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:01,976 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 08:01:01,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:01,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:01:01,977 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:01,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:01:01,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:01:01,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:01:01,978 INFO L87 Difference]: Start difference. First operand 547 states and 733 transitions. Second operand 9 states. [2019-09-10 08:01:03,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:03,459 INFO L93 Difference]: Finished difference Result 1106 states and 1524 transitions. [2019-09-10 08:01:03,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:01:03,459 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-10 08:01:03,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:03,465 INFO L225 Difference]: With dead ends: 1106 [2019-09-10 08:01:03,465 INFO L226 Difference]: Without dead ends: 1106 [2019-09-10 08:01:03,466 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 08:01:03,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-09-10 08:01:03,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 547. [2019-09-10 08:01:03,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 08:01:03,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 731 transitions. [2019-09-10 08:01:03,482 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 731 transitions. Word has length 81 [2019-09-10 08:01:03,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:03,483 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 731 transitions. [2019-09-10 08:01:03,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:01:03,483 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 731 transitions. [2019-09-10 08:01:03,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 08:01:03,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:03,484 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] [2019-09-10 08:01:03,485 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:03,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:03,485 INFO L82 PathProgramCache]: Analyzing trace with hash 916645204, now seen corresponding path program 1 times [2019-09-10 08:01:03,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:03,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:03,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:03,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:03,487 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:03,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:03,714 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 08:01:03,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:03,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:01:03,715 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:03,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:01:03,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:01:03,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:01:03,716 INFO L87 Difference]: Start difference. First operand 547 states and 731 transitions. Second operand 9 states. [2019-09-10 08:01:05,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:05,263 INFO L93 Difference]: Finished difference Result 874 states and 1215 transitions. [2019-09-10 08:01:05,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:01:05,263 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-10 08:01:05,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:05,268 INFO L225 Difference]: With dead ends: 874 [2019-09-10 08:01:05,268 INFO L226 Difference]: Without dead ends: 874 [2019-09-10 08:01:05,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:01:05,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-09-10 08:01:05,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 547. [2019-09-10 08:01:05,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 08:01:05,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 729 transitions. [2019-09-10 08:01:05,283 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 729 transitions. Word has length 81 [2019-09-10 08:01:05,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:05,283 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 729 transitions. [2019-09-10 08:01:05,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:01:05,284 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 729 transitions. [2019-09-10 08:01:05,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 08:01:05,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:05,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] [2019-09-10 08:01:05,286 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:05,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:05,286 INFO L82 PathProgramCache]: Analyzing trace with hash -819894320, now seen corresponding path program 1 times [2019-09-10 08:01:05,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:05,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:05,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:05,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:05,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:05,431 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 08:01:05,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:05,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:01:05,432 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:05,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:01:05,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:01:05,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:01:05,433 INFO L87 Difference]: Start difference. First operand 547 states and 729 transitions. Second operand 9 states. [2019-09-10 08:01:07,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:07,274 INFO L93 Difference]: Finished difference Result 1130 states and 1565 transitions. [2019-09-10 08:01:07,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:01:07,274 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-10 08:01:07,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:07,281 INFO L225 Difference]: With dead ends: 1130 [2019-09-10 08:01:07,282 INFO L226 Difference]: Without dead ends: 1130 [2019-09-10 08:01:07,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:01:07,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2019-09-10 08:01:07,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 547. [2019-09-10 08:01:07,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 08:01:07,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 728 transitions. [2019-09-10 08:01:07,299 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 728 transitions. Word has length 81 [2019-09-10 08:01:07,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:07,299 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 728 transitions. [2019-09-10 08:01:07,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:01:07,300 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 728 transitions. [2019-09-10 08:01:07,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 08:01:07,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:07,301 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] [2019-09-10 08:01:07,302 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:07,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:07,302 INFO L82 PathProgramCache]: Analyzing trace with hash 494668223, now seen corresponding path program 1 times [2019-09-10 08:01:07,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:07,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:07,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:07,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:07,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:07,473 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 08:01:07,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:07,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:01:07,474 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:07,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:01:07,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:01:07,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:01:07,476 INFO L87 Difference]: Start difference. First operand 547 states and 728 transitions. Second operand 9 states. [2019-09-10 08:01:08,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:08,936 INFO L93 Difference]: Finished difference Result 1106 states and 1520 transitions. [2019-09-10 08:01:08,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:01:08,937 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-10 08:01:08,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:08,943 INFO L225 Difference]: With dead ends: 1106 [2019-09-10 08:01:08,943 INFO L226 Difference]: Without dead ends: 1106 [2019-09-10 08:01:08,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:01:08,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-09-10 08:01:08,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 547. [2019-09-10 08:01:08,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 08:01:08,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 727 transitions. [2019-09-10 08:01:08,959 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 727 transitions. Word has length 81 [2019-09-10 08:01:08,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:08,960 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 727 transitions. [2019-09-10 08:01:08,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:01:08,960 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 727 transitions. [2019-09-10 08:01:08,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 08:01:08,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:08,961 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] [2019-09-10 08:01:08,962 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:08,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:08,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1431462676, now seen corresponding path program 1 times [2019-09-10 08:01:08,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:08,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:08,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:08,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:08,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:09,132 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 08:01:09,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:09,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:01:09,133 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:09,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:01:09,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:01:09,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:01:09,134 INFO L87 Difference]: Start difference. First operand 547 states and 727 transitions. Second operand 9 states. [2019-09-10 08:01:10,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:10,939 INFO L93 Difference]: Finished difference Result 1130 states and 1562 transitions. [2019-09-10 08:01:10,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:01:10,940 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-10 08:01:10,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:10,946 INFO L225 Difference]: With dead ends: 1130 [2019-09-10 08:01:10,946 INFO L226 Difference]: Without dead ends: 1130 [2019-09-10 08:01:10,947 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 08:01:10,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2019-09-10 08:01:10,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 547. [2019-09-10 08:01:10,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 08:01:10,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 726 transitions. [2019-09-10 08:01:10,960 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 726 transitions. Word has length 81 [2019-09-10 08:01:10,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:10,961 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 726 transitions. [2019-09-10 08:01:10,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:01:10,961 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 726 transitions. [2019-09-10 08:01:10,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 08:01:10,962 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:10,962 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] [2019-09-10 08:01:10,963 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:10,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:10,963 INFO L82 PathProgramCache]: Analyzing trace with hash -272719777, now seen corresponding path program 1 times [2019-09-10 08:01:10,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:10,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:10,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:10,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:10,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:11,120 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 08:01:11,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:11,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:01:11,123 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:11,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:01:11,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:01:11,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:01:11,124 INFO L87 Difference]: Start difference. First operand 547 states and 726 transitions. Second operand 9 states. [2019-09-10 08:01:12,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:12,681 INFO L93 Difference]: Finished difference Result 1106 states and 1518 transitions. [2019-09-10 08:01:12,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:01:12,681 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-10 08:01:12,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:12,688 INFO L225 Difference]: With dead ends: 1106 [2019-09-10 08:01:12,688 INFO L226 Difference]: Without dead ends: 1106 [2019-09-10 08:01:12,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:01:12,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-09-10 08:01:12,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 547. [2019-09-10 08:01:12,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 08:01:12,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 725 transitions. [2019-09-10 08:01:12,702 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 725 transitions. Word has length 81 [2019-09-10 08:01:12,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:12,702 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 725 transitions. [2019-09-10 08:01:12,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:01:12,703 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 725 transitions. [2019-09-10 08:01:12,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 08:01:12,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:12,704 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] [2019-09-10 08:01:12,705 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:12,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:12,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1337474297, now seen corresponding path program 1 times [2019-09-10 08:01:12,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:12,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:12,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:12,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:12,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:12,891 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 08:01:12,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:12,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:01:12,893 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:12,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:01:12,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:01:12,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:01:12,894 INFO L87 Difference]: Start difference. First operand 547 states and 725 transitions. Second operand 9 states. [2019-09-10 08:01:14,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:14,406 INFO L93 Difference]: Finished difference Result 1106 states and 1516 transitions. [2019-09-10 08:01:14,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:01:14,407 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 08:01:14,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:14,412 INFO L225 Difference]: With dead ends: 1106 [2019-09-10 08:01:14,412 INFO L226 Difference]: Without dead ends: 1106 [2019-09-10 08:01:14,413 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 08:01:14,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-09-10 08:01:14,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 547. [2019-09-10 08:01:14,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 08:01:14,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 723 transitions. [2019-09-10 08:01:14,425 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 723 transitions. Word has length 83 [2019-09-10 08:01:14,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:14,425 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 723 transitions. [2019-09-10 08:01:14,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:01:14,425 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 723 transitions. [2019-09-10 08:01:14,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 08:01:14,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:14,427 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] [2019-09-10 08:01:14,428 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:14,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:14,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1331235743, now seen corresponding path program 1 times [2019-09-10 08:01:14,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:14,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:14,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:14,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:14,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:14,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:14,596 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 08:01:14,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:14,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:01:14,597 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:14,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:01:14,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:01:14,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:01:14,598 INFO L87 Difference]: Start difference. First operand 547 states and 723 transitions. Second operand 9 states. [2019-09-10 08:01:16,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:16,334 INFO L93 Difference]: Finished difference Result 1082 states and 1475 transitions. [2019-09-10 08:01:16,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:01:16,335 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 08:01:16,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:16,341 INFO L225 Difference]: With dead ends: 1082 [2019-09-10 08:01:16,341 INFO L226 Difference]: Without dead ends: 1082 [2019-09-10 08:01:16,341 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 08:01:16,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-10 08:01:16,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-10 08:01:16,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 08:01:16,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 721 transitions. [2019-09-10 08:01:16,353 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 721 transitions. Word has length 83 [2019-09-10 08:01:16,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:16,354 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 721 transitions. [2019-09-10 08:01:16,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:01:16,354 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 721 transitions. [2019-09-10 08:01:16,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 08:01:16,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:16,356 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] [2019-09-10 08:01:16,356 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:16,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:16,357 INFO L82 PathProgramCache]: Analyzing trace with hash 11721297, now seen corresponding path program 1 times [2019-09-10 08:01:16,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:16,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:16,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:16,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:16,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:16,499 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 08:01:16,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:16,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:01:16,499 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:16,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:01:16,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:01:16,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:01:16,501 INFO L87 Difference]: Start difference. First operand 547 states and 721 transitions. Second operand 9 states. [2019-09-10 08:01:18,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:18,466 INFO L93 Difference]: Finished difference Result 1130 states and 1548 transitions. [2019-09-10 08:01:18,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:01:18,467 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 08:01:18,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:18,472 INFO L225 Difference]: With dead ends: 1130 [2019-09-10 08:01:18,473 INFO L226 Difference]: Without dead ends: 1130 [2019-09-10 08:01:18,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:01:18,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2019-09-10 08:01:18,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 547. [2019-09-10 08:01:18,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 08:01:18,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 719 transitions. [2019-09-10 08:01:18,485 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 719 transitions. Word has length 83 [2019-09-10 08:01:18,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:18,485 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 719 transitions. [2019-09-10 08:01:18,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:01:18,485 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 719 transitions. [2019-09-10 08:01:18,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 08:01:18,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:18,487 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] [2019-09-10 08:01:18,488 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:18,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:18,488 INFO L82 PathProgramCache]: Analyzing trace with hash 116579511, now seen corresponding path program 1 times [2019-09-10 08:01:18,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:18,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:18,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:18,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:18,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:18,635 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 08:01:18,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:18,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:01:18,636 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:18,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:01:18,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:01:18,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:01:18,637 INFO L87 Difference]: Start difference. First operand 547 states and 719 transitions. Second operand 9 states. [2019-09-10 08:01:20,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:20,184 INFO L93 Difference]: Finished difference Result 1082 states and 1471 transitions. [2019-09-10 08:01:20,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:01:20,185 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 08:01:20,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:20,190 INFO L225 Difference]: With dead ends: 1082 [2019-09-10 08:01:20,191 INFO L226 Difference]: Without dead ends: 1082 [2019-09-10 08:01:20,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:01:20,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-10 08:01:20,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-10 08:01:20,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 08:01:20,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 717 transitions. [2019-09-10 08:01:20,203 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 717 transitions. Word has length 83 [2019-09-10 08:01:20,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:20,203 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 717 transitions. [2019-09-10 08:01:20,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:01:20,204 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 717 transitions. [2019-09-10 08:01:20,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 08:01:20,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:20,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:01:20,206 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:20,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:20,206 INFO L82 PathProgramCache]: Analyzing trace with hash -2029458257, now seen corresponding path program 1 times [2019-09-10 08:01:20,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:20,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:20,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:20,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:20,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:20,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:20,353 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 08:01:20,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:20,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:01:20,354 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:20,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:01:20,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:01:20,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:01:20,355 INFO L87 Difference]: Start difference. First operand 547 states and 717 transitions. Second operand 9 states. [2019-09-10 08:01:22,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:22,189 INFO L93 Difference]: Finished difference Result 1082 states and 1469 transitions. [2019-09-10 08:01:22,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:01:22,189 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 08:01:22,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:22,195 INFO L225 Difference]: With dead ends: 1082 [2019-09-10 08:01:22,195 INFO L226 Difference]: Without dead ends: 1082 [2019-09-10 08:01:22,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:01:22,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-10 08:01:22,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-10 08:01:22,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 08:01:22,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 715 transitions. [2019-09-10 08:01:22,206 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 715 transitions. Word has length 83 [2019-09-10 08:01:22,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:22,206 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 715 transitions. [2019-09-10 08:01:22,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:01:22,206 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 715 transitions. [2019-09-10 08:01:22,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 08:01:22,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:22,208 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] [2019-09-10 08:01:22,208 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:22,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:22,209 INFO L82 PathProgramCache]: Analyzing trace with hash -2037194958, now seen corresponding path program 1 times [2019-09-10 08:01:22,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:22,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:22,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:22,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:22,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:22,411 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 08:01:22,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:22,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:01:22,411 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:22,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:01:22,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:01:22,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:01:22,412 INFO L87 Difference]: Start difference. First operand 547 states and 715 transitions. Second operand 9 states. [2019-09-10 08:01:24,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:24,306 INFO L93 Difference]: Finished difference Result 1082 states and 1465 transitions. [2019-09-10 08:01:24,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:01:24,309 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 08:01:24,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:24,315 INFO L225 Difference]: With dead ends: 1082 [2019-09-10 08:01:24,315 INFO L226 Difference]: Without dead ends: 1082 [2019-09-10 08:01:24,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:01:24,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-10 08:01:24,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-10 08:01:24,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 08:01:24,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 713 transitions. [2019-09-10 08:01:24,328 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 713 transitions. Word has length 83 [2019-09-10 08:01:24,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:24,328 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 713 transitions. [2019-09-10 08:01:24,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:01:24,328 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 713 transitions. [2019-09-10 08:01:24,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 08:01:24,330 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:24,330 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] [2019-09-10 08:01:24,330 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:24,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:24,331 INFO L82 PathProgramCache]: Analyzing trace with hash -315572149, now seen corresponding path program 1 times [2019-09-10 08:01:24,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:24,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:24,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:24,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:24,332 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:24,528 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 08:01:24,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:24,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:01:24,529 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:24,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:01:24,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:01:24,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:01:24,530 INFO L87 Difference]: Start difference. First operand 547 states and 713 transitions. Second operand 9 states. [2019-09-10 08:01:26,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:26,132 INFO L93 Difference]: Finished difference Result 1082 states and 1463 transitions. [2019-09-10 08:01:26,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:01:26,133 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 08:01:26,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:26,138 INFO L225 Difference]: With dead ends: 1082 [2019-09-10 08:01:26,139 INFO L226 Difference]: Without dead ends: 1082 [2019-09-10 08:01:26,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:01:26,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-10 08:01:26,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-10 08:01:26,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 08:01:26,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 712 transitions. [2019-09-10 08:01:26,148 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 712 transitions. Word has length 83 [2019-09-10 08:01:26,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:26,148 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 712 transitions. [2019-09-10 08:01:26,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:01:26,149 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 712 transitions. [2019-09-10 08:01:26,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 08:01:26,150 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:26,150 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] [2019-09-10 08:01:26,151 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:26,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:26,151 INFO L82 PathProgramCache]: Analyzing trace with hash -697978443, now seen corresponding path program 1 times [2019-09-10 08:01:26,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:26,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:26,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:26,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:26,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:26,299 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 08:01:26,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:26,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:01:26,300 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:26,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:01:26,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:01:26,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:01:26,301 INFO L87 Difference]: Start difference. First operand 547 states and 712 transitions. Second operand 9 states. [2019-09-10 08:01:28,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:28,217 INFO L93 Difference]: Finished difference Result 1082 states and 1462 transitions. [2019-09-10 08:01:28,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:01:28,218 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 08:01:28,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:28,224 INFO L225 Difference]: With dead ends: 1082 [2019-09-10 08:01:28,224 INFO L226 Difference]: Without dead ends: 1082 [2019-09-10 08:01:28,225 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 08:01:28,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-10 08:01:28,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-10 08:01:28,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 08:01:28,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 711 transitions. [2019-09-10 08:01:28,236 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 711 transitions. Word has length 83 [2019-09-10 08:01:28,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:28,236 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 711 transitions. [2019-09-10 08:01:28,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:01:28,236 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 711 transitions. [2019-09-10 08:01:28,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 08:01:28,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:28,238 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] [2019-09-10 08:01:28,238 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:28,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:28,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1927606278, now seen corresponding path program 1 times [2019-09-10 08:01:28,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:28,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:28,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:28,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:28,241 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:28,386 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 08:01:28,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:28,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:01:28,387 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:28,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:01:28,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:01:28,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:01:28,388 INFO L87 Difference]: Start difference. First operand 547 states and 711 transitions. Second operand 9 states. [2019-09-10 08:01:30,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:30,258 INFO L93 Difference]: Finished difference Result 1082 states and 1460 transitions. [2019-09-10 08:01:30,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:01:30,263 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 08:01:30,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:30,268 INFO L225 Difference]: With dead ends: 1082 [2019-09-10 08:01:30,268 INFO L226 Difference]: Without dead ends: 1082 [2019-09-10 08:01:30,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:01:30,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-10 08:01:30,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-10 08:01:30,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 08:01:30,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 710 transitions. [2019-09-10 08:01:30,279 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 710 transitions. Word has length 83 [2019-09-10 08:01:30,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:30,279 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 710 transitions. [2019-09-10 08:01:30,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:01:30,280 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 710 transitions. [2019-09-10 08:01:30,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 08:01:30,281 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:30,281 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] [2019-09-10 08:01:30,281 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:30,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:30,282 INFO L82 PathProgramCache]: Analyzing trace with hash 416569401, now seen corresponding path program 1 times [2019-09-10 08:01:30,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:30,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:30,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:30,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:30,286 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:30,472 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 08:01:30,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:30,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:01:30,473 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:30,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:01:30,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:01:30,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:01:30,474 INFO L87 Difference]: Start difference. First operand 547 states and 710 transitions. Second operand 9 states. [2019-09-10 08:01:32,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:32,254 INFO L93 Difference]: Finished difference Result 1082 states and 1459 transitions. [2019-09-10 08:01:32,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:01:32,255 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 08:01:32,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:32,261 INFO L225 Difference]: With dead ends: 1082 [2019-09-10 08:01:32,261 INFO L226 Difference]: Without dead ends: 1082 [2019-09-10 08:01:32,262 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 08:01:32,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-10 08:01:32,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-10 08:01:32,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 08:01:32,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 709 transitions. [2019-09-10 08:01:32,272 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 709 transitions. Word has length 83 [2019-09-10 08:01:32,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:32,272 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 709 transitions. [2019-09-10 08:01:32,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:01:32,272 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 709 transitions. [2019-09-10 08:01:32,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 08:01:32,274 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:32,274 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] [2019-09-10 08:01:32,274 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:32,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:32,275 INFO L82 PathProgramCache]: Analyzing trace with hash -961144879, now seen corresponding path program 1 times [2019-09-10 08:01:32,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:32,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:32,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:32,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:32,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:32,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:32,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:01:32,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:32,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:01:32,429 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:32,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:01:32,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:01:32,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:01:32,430 INFO L87 Difference]: Start difference. First operand 547 states and 709 transitions. Second operand 9 states. [2019-09-10 08:01:33,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:33,956 INFO L93 Difference]: Finished difference Result 1106 states and 1495 transitions. [2019-09-10 08:01:33,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:01:33,957 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 08:01:33,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:33,962 INFO L225 Difference]: With dead ends: 1106 [2019-09-10 08:01:33,962 INFO L226 Difference]: Without dead ends: 1106 [2019-09-10 08:01:33,962 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:01:33,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-09-10 08:01:33,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 547. [2019-09-10 08:01:33,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 08:01:33,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 708 transitions. [2019-09-10 08:01:33,977 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 708 transitions. Word has length 83 [2019-09-10 08:01:33,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:33,977 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 708 transitions. [2019-09-10 08:01:33,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:01:33,977 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 708 transitions. [2019-09-10 08:01:33,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 08:01:33,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:33,979 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] [2019-09-10 08:01:33,979 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:33,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:33,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1104924732, now seen corresponding path program 1 times [2019-09-10 08:01:33,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:33,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:33,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:33,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:33,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:34,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:34,134 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 08:01:34,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:34,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:01:34,135 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:34,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:01:34,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:01:34,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:01:34,136 INFO L87 Difference]: Start difference. First operand 547 states and 708 transitions. Second operand 9 states. [2019-09-10 08:01:36,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:36,070 INFO L93 Difference]: Finished difference Result 1082 states and 1456 transitions. [2019-09-10 08:01:36,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:01:36,071 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 08:01:36,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:36,075 INFO L225 Difference]: With dead ends: 1082 [2019-09-10 08:01:36,075 INFO L226 Difference]: Without dead ends: 1082 [2019-09-10 08:01:36,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:01:36,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-10 08:01:36,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-10 08:01:36,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 08:01:36,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 707 transitions. [2019-09-10 08:01:36,086 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 707 transitions. Word has length 83 [2019-09-10 08:01:36,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:36,086 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 707 transitions. [2019-09-10 08:01:36,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:01:36,087 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 707 transitions. [2019-09-10 08:01:36,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 08:01:36,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:36,088 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] [2019-09-10 08:01:36,089 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:36,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:36,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1641831093, now seen corresponding path program 1 times [2019-09-10 08:01:36,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:36,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:36,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:36,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:36,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:36,232 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 08:01:36,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:36,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:01:36,233 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:36,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:01:36,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:01:36,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:01:36,234 INFO L87 Difference]: Start difference. First operand 547 states and 707 transitions. Second operand 9 states. [2019-09-10 08:01:37,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:37,963 INFO L93 Difference]: Finished difference Result 1082 states and 1455 transitions. [2019-09-10 08:01:37,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:01:37,963 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 08:01:37,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:37,966 INFO L225 Difference]: With dead ends: 1082 [2019-09-10 08:01:37,966 INFO L226 Difference]: Without dead ends: 1082 [2019-09-10 08:01:37,966 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 08:01:37,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-10 08:01:37,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-10 08:01:37,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 08:01:37,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 706 transitions. [2019-09-10 08:01:37,975 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 706 transitions. Word has length 83 [2019-09-10 08:01:37,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:37,976 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 706 transitions. [2019-09-10 08:01:37,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:01:37,976 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 706 transitions. [2019-09-10 08:01:37,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 08:01:37,977 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:37,977 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] [2019-09-10 08:01:37,978 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:37,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:37,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1207818414, now seen corresponding path program 1 times [2019-09-10 08:01:37,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:37,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:37,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:37,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:37,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:38,118 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 08:01:38,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:38,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:01:38,118 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:38,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:01:38,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:01:38,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:01:38,119 INFO L87 Difference]: Start difference. First operand 547 states and 706 transitions. Second operand 9 states. [2019-09-10 08:01:39,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:39,864 INFO L93 Difference]: Finished difference Result 1081 states and 1453 transitions. [2019-09-10 08:01:39,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:01:39,864 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-10 08:01:39,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:39,867 INFO L225 Difference]: With dead ends: 1081 [2019-09-10 08:01:39,867 INFO L226 Difference]: Without dead ends: 1081 [2019-09-10 08:01:39,868 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 08:01:39,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-10 08:01:39,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 546. [2019-09-10 08:01:39,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2019-09-10 08:01:39,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 704 transitions. [2019-09-10 08:01:39,877 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 704 transitions. Word has length 84 [2019-09-10 08:01:39,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:39,877 INFO L475 AbstractCegarLoop]: Abstraction has 546 states and 704 transitions. [2019-09-10 08:01:39,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:01:39,878 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 704 transitions. [2019-09-10 08:01:39,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:01:39,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:39,879 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] [2019-09-10 08:01:39,880 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:39,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:39,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1370154188, now seen corresponding path program 1 times [2019-09-10 08:01:39,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:39,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:39,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:39,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:39,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:40,918 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 08:01:41,103 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:01:42,178 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 08:01:42,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:42,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 08:01:42,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:42,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 08:01:42,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 08:01:42,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:01:42,180 INFO L87 Difference]: Start difference. First operand 546 states and 704 transitions. Second operand 26 states. [2019-09-10 08:01:42,358 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-10 08:01:43,214 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2019-09-10 08:01:43,533 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-10 08:01:43,794 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2019-09-10 08:01:44,109 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2019-09-10 08:01:44,527 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2019-09-10 08:01:44,791 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-10 08:01:45,042 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-10 08:01:45,327 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 08:01:49,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:49,664 INFO L93 Difference]: Finished difference Result 753 states and 969 transitions. [2019-09-10 08:01:49,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:01:49,665 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 85 [2019-09-10 08:01:49,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:49,666 INFO L225 Difference]: With dead ends: 753 [2019-09-10 08:01:49,666 INFO L226 Difference]: Without dead ends: 753 [2019-09-10 08:01:49,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=331, Invalid=1309, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 08:01:49,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2019-09-10 08:01:49,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 561. [2019-09-10 08:01:49,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-09-10 08:01:49,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 725 transitions. [2019-09-10 08:01:49,675 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 725 transitions. Word has length 85 [2019-09-10 08:01:49,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:49,677 INFO L475 AbstractCegarLoop]: Abstraction has 561 states and 725 transitions. [2019-09-10 08:01:49,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 08:01:49,677 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 725 transitions. [2019-09-10 08:01:49,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:01:49,679 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:49,679 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] [2019-09-10 08:01:49,683 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:49,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:49,684 INFO L82 PathProgramCache]: Analyzing trace with hash -230689484, now seen corresponding path program 1 times [2019-09-10 08:01:49,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:49,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:49,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:49,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:49,686 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:49,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:50,657 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 08:01:50,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:50,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:01:50,658 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:50,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:01:50,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:01:50,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:01:50,659 INFO L87 Difference]: Start difference. First operand 561 states and 725 transitions. Second operand 17 states. [2019-09-10 08:01:51,437 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:01:51,594 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-10 08:01:53,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:53,905 INFO L93 Difference]: Finished difference Result 1169 states and 1569 transitions. [2019-09-10 08:01:53,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:01:53,906 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2019-09-10 08:01:53,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:53,908 INFO L225 Difference]: With dead ends: 1169 [2019-09-10 08:01:53,908 INFO L226 Difference]: Without dead ends: 1169 [2019-09-10 08:01:53,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:01:53,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2019-09-10 08:01:53,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 541. [2019-09-10 08:01:53,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-09-10 08:01:53,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 696 transitions. [2019-09-10 08:01:53,920 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 696 transitions. Word has length 85 [2019-09-10 08:01:53,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:53,920 INFO L475 AbstractCegarLoop]: Abstraction has 541 states and 696 transitions. [2019-09-10 08:01:53,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:01:53,920 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 696 transitions. [2019-09-10 08:01:53,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:01:53,922 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:53,922 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] [2019-09-10 08:01:53,922 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:53,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:53,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1185402698, now seen corresponding path program 1 times [2019-09-10 08:01:53,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:53,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:53,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:53,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:53,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:54,824 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 08:01:54,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:54,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:01:54,825 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:54,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:01:54,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:01:54,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:01:54,827 INFO L87 Difference]: Start difference. First operand 541 states and 696 transitions. Second operand 16 states. [2019-09-10 08:01:55,616 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 08:01:55,789 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:01:55,959 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:01:56,161 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 08:01:56,346 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-10 08:01:58,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:01:58,732 INFO L93 Difference]: Finished difference Result 873 states and 1105 transitions. [2019-09-10 08:01:58,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 08:01:58,733 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 85 [2019-09-10 08:01:58,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:01:58,735 INFO L225 Difference]: With dead ends: 873 [2019-09-10 08:01:58,735 INFO L226 Difference]: Without dead ends: 873 [2019-09-10 08:01:58,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=220, Invalid=710, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:01:58,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2019-09-10 08:01:58,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 547. [2019-09-10 08:01:58,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-10 08:01:58,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 704 transitions. [2019-09-10 08:01:58,743 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 704 transitions. Word has length 85 [2019-09-10 08:01:58,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:01:58,743 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 704 transitions. [2019-09-10 08:01:58,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:01:58,743 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 704 transitions. [2019-09-10 08:01:58,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:01:58,745 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:01:58,745 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] [2019-09-10 08:01:58,745 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:01:58,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:58,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1294662844, now seen corresponding path program 1 times [2019-09-10 08:01:58,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:01:58,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:58,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:58,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:01:58,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:01:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:59,548 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 08:01:59,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:01:59,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:01:59,548 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:01:59,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:01:59,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:01:59,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:01:59,549 INFO L87 Difference]: Start difference. First operand 547 states and 704 transitions. Second operand 17 states. [2019-09-10 08:02:00,216 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 08:02:00,379 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-10 08:02:01,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:01,307 INFO L93 Difference]: Finished difference Result 763 states and 1014 transitions. [2019-09-10 08:02:01,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 08:02:01,307 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2019-09-10 08:02:01,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:01,309 INFO L225 Difference]: With dead ends: 763 [2019-09-10 08:02:01,309 INFO L226 Difference]: Without dead ends: 763 [2019-09-10 08:02:01,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:02:01,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2019-09-10 08:02:01,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 505. [2019-09-10 08:02:01,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-09-10 08:02:01,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 647 transitions. [2019-09-10 08:02:01,316 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 647 transitions. Word has length 85 [2019-09-10 08:02:01,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:01,316 INFO L475 AbstractCegarLoop]: Abstraction has 505 states and 647 transitions. [2019-09-10 08:02:01,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:02:01,317 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 647 transitions. [2019-09-10 08:02:01,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:02:01,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:01,318 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] [2019-09-10 08:02:01,318 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:01,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:01,319 INFO L82 PathProgramCache]: Analyzing trace with hash 181793350, now seen corresponding path program 1 times [2019-09-10 08:02:01,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:01,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:01,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:01,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:01,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:02,316 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-10 08:02:02,464 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 08:02:02,614 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 08:02:02,762 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-10 08:02:03,675 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 08:02:03,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:03,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-09-10 08:02:03,676 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:03,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 08:02:03,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 08:02:03,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:02:03,677 INFO L87 Difference]: Start difference. First operand 505 states and 647 transitions. Second operand 27 states. [2019-09-10 08:02:03,875 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-09-10 08:02:04,584 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-09-10 08:02:04,746 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-09-10 08:02:04,954 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2019-09-10 08:02:05,479 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 81 [2019-09-10 08:02:05,876 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2019-09-10 08:02:06,328 WARN L188 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 82 [2019-09-10 08:02:06,841 WARN L188 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 92 [2019-09-10 08:02:07,099 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-09-10 08:02:07,406 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-09-10 08:02:07,683 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-09-10 08:02:07,949 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-09-10 08:02:08,226 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-09-10 08:02:08,563 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-09-10 08:02:12,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:12,305 INFO L93 Difference]: Finished difference Result 684 states and 877 transitions. [2019-09-10 08:02:12,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 08:02:12,306 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 85 [2019-09-10 08:02:12,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:12,308 INFO L225 Difference]: With dead ends: 684 [2019-09-10 08:02:12,308 INFO L226 Difference]: Without dead ends: 684 [2019-09-10 08:02:12,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=433, Invalid=1547, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 08:02:12,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2019-09-10 08:02:12,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 516. [2019-09-10 08:02:12,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-09-10 08:02:12,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 659 transitions. [2019-09-10 08:02:12,316 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 659 transitions. Word has length 85 [2019-09-10 08:02:12,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:12,317 INFO L475 AbstractCegarLoop]: Abstraction has 516 states and 659 transitions. [2019-09-10 08:02:12,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 08:02:12,317 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 659 transitions. [2019-09-10 08:02:12,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:02:12,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:12,318 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] [2019-09-10 08:02:12,319 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:12,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:12,319 INFO L82 PathProgramCache]: Analyzing trace with hash 151515162, now seen corresponding path program 1 times [2019-09-10 08:02:12,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:12,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:12,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:12,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:12,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:12,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:13,158 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 08:02:13,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:13,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:02:13,158 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:13,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:02:13,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:02:13,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:02:13,159 INFO L87 Difference]: Start difference. First operand 516 states and 659 transitions. Second operand 17 states. [2019-09-10 08:02:13,875 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 08:02:14,048 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-10 08:02:15,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:15,423 INFO L93 Difference]: Finished difference Result 806 states and 1080 transitions. [2019-09-10 08:02:15,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:02:15,424 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2019-09-10 08:02:15,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:15,427 INFO L225 Difference]: With dead ends: 806 [2019-09-10 08:02:15,427 INFO L226 Difference]: Without dead ends: 806 [2019-09-10 08:02:15,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:02:15,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2019-09-10 08:02:15,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 487. [2019-09-10 08:02:15,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-09-10 08:02:15,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 621 transitions. [2019-09-10 08:02:15,437 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 621 transitions. Word has length 85 [2019-09-10 08:02:15,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:15,437 INFO L475 AbstractCegarLoop]: Abstraction has 487 states and 621 transitions. [2019-09-10 08:02:15,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:02:15,437 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 621 transitions. [2019-09-10 08:02:15,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:02:15,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:15,438 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] [2019-09-10 08:02:15,439 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:15,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:15,439 INFO L82 PathProgramCache]: Analyzing trace with hash 626554292, now seen corresponding path program 1 times [2019-09-10 08:02:15,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:15,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:15,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:15,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:15,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:15,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:16,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:02:16,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:16,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:02:16,439 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:16,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:02:16,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:02:16,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:02:16,442 INFO L87 Difference]: Start difference. First operand 487 states and 621 transitions. Second operand 17 states. [2019-09-10 08:02:17,164 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-10 08:02:17,362 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-10 08:02:19,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:19,817 INFO L93 Difference]: Finished difference Result 1017 states and 1368 transitions. [2019-09-10 08:02:19,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:02:19,818 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2019-09-10 08:02:19,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:19,821 INFO L225 Difference]: With dead ends: 1017 [2019-09-10 08:02:19,821 INFO L226 Difference]: Without dead ends: 1017 [2019-09-10 08:02:19,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:02:19,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2019-09-10 08:02:19,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 486. [2019-09-10 08:02:19,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2019-09-10 08:02:19,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 618 transitions. [2019-09-10 08:02:19,830 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 618 transitions. Word has length 85 [2019-09-10 08:02:19,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:19,831 INFO L475 AbstractCegarLoop]: Abstraction has 486 states and 618 transitions. [2019-09-10 08:02:19,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:02:19,831 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 618 transitions. [2019-09-10 08:02:19,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:02:19,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:19,832 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] [2019-09-10 08:02:19,832 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:19,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:19,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1764599692, now seen corresponding path program 1 times [2019-09-10 08:02:19,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:19,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:19,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:19,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:19,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:20,489 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-10 08:02:20,658 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 08:02:20,831 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:02:21,635 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 08:02:21,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:21,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 08:02:21,635 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:21,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 08:02:21,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 08:02:21,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:02:21,637 INFO L87 Difference]: Start difference. First operand 486 states and 618 transitions. Second operand 25 states. [2019-09-10 08:02:21,804 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-10 08:02:22,818 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-10 08:02:23,172 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-09-10 08:02:23,485 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2019-09-10 08:02:23,839 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-09-10 08:02:24,072 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-10 08:02:24,309 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-10 08:02:24,547 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 08:02:24,797 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 08:02:25,043 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 08:02:25,349 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 08:02:28,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:28,557 INFO L93 Difference]: Finished difference Result 776 states and 1016 transitions. [2019-09-10 08:02:28,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 08:02:28,557 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-09-10 08:02:28,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:28,560 INFO L225 Difference]: With dead ends: 776 [2019-09-10 08:02:28,560 INFO L226 Difference]: Without dead ends: 776 [2019-09-10 08:02:28,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=415, Invalid=1391, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 08:02:28,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2019-09-10 08:02:28,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 497. [2019-09-10 08:02:28,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2019-09-10 08:02:28,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 630 transitions. [2019-09-10 08:02:28,569 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 630 transitions. Word has length 85 [2019-09-10 08:02:28,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:28,569 INFO L475 AbstractCegarLoop]: Abstraction has 497 states and 630 transitions. [2019-09-10 08:02:28,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 08:02:28,569 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 630 transitions. [2019-09-10 08:02:28,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:02:28,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:28,571 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] [2019-09-10 08:02:28,571 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:28,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:28,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1793652703, now seen corresponding path program 1 times [2019-09-10 08:02:28,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:28,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:28,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:28,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:28,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:29,265 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 08:02:29,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:29,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 08:02:29,265 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:29,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 08:02:29,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 08:02:29,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:02:29,270 INFO L87 Difference]: Start difference. First operand 497 states and 630 transitions. Second operand 15 states. [2019-09-10 08:02:29,834 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2019-09-10 08:02:29,974 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-10 08:02:30,110 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-10 08:02:31,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:31,075 INFO L93 Difference]: Finished difference Result 663 states and 882 transitions. [2019-09-10 08:02:31,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:02:31,075 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 85 [2019-09-10 08:02:31,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:31,077 INFO L225 Difference]: With dead ends: 663 [2019-09-10 08:02:31,077 INFO L226 Difference]: Without dead ends: 663 [2019-09-10 08:02:31,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:02:31,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-09-10 08:02:31,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 456. [2019-09-10 08:02:31,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-09-10 08:02:31,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 581 transitions. [2019-09-10 08:02:31,084 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 581 transitions. Word has length 85 [2019-09-10 08:02:31,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:31,084 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 581 transitions. [2019-09-10 08:02:31,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 08:02:31,084 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 581 transitions. [2019-09-10 08:02:31,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 08:02:31,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:31,085 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] [2019-09-10 08:02:31,086 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:31,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:31,086 INFO L82 PathProgramCache]: Analyzing trace with hash -2017902633, now seen corresponding path program 1 times [2019-09-10 08:02:31,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:31,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:31,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:31,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:31,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:31,228 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 08:02:31,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:31,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:02:31,229 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:31,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:02:31,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:02:31,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:02:31,230 INFO L87 Difference]: Start difference. First operand 456 states and 581 transitions. Second operand 9 states. [2019-09-10 08:02:32,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:32,361 INFO L93 Difference]: Finished difference Result 942 states and 1275 transitions. [2019-09-10 08:02:32,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:02:32,362 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-09-10 08:02:32,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:32,366 INFO L225 Difference]: With dead ends: 942 [2019-09-10 08:02:32,366 INFO L226 Difference]: Without dead ends: 942 [2019-09-10 08:02:32,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:02:32,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2019-09-10 08:02:32,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 456. [2019-09-10 08:02:32,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-09-10 08:02:32,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 578 transitions. [2019-09-10 08:02:32,376 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 578 transitions. Word has length 86 [2019-09-10 08:02:32,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:32,376 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 578 transitions. [2019-09-10 08:02:32,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:02:32,376 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 578 transitions. [2019-09-10 08:02:32,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 08:02:32,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:32,377 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] [2019-09-10 08:02:32,378 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:32,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:32,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1859590783, now seen corresponding path program 1 times [2019-09-10 08:02:32,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:32,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:32,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:32,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:32,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:32,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:32,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 08:02:32,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:32,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:02:32,545 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:32,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:02:32,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:02:32,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:02:32,546 INFO L87 Difference]: Start difference. First operand 456 states and 578 transitions. Second operand 9 states. [2019-09-10 08:02:33,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:33,910 INFO L93 Difference]: Finished difference Result 929 states and 1252 transitions. [2019-09-10 08:02:33,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:02:33,911 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-09-10 08:02:33,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:33,913 INFO L225 Difference]: With dead ends: 929 [2019-09-10 08:02:33,913 INFO L226 Difference]: Without dead ends: 929 [2019-09-10 08:02:33,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:02:33,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-09-10 08:02:33,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 456. [2019-09-10 08:02:33,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-09-10 08:02:33,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 575 transitions. [2019-09-10 08:02:33,921 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 575 transitions. Word has length 86 [2019-09-10 08:02:33,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:33,921 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 575 transitions. [2019-09-10 08:02:33,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:02:33,921 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 575 transitions. [2019-09-10 08:02:33,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 08:02:33,922 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:33,922 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] [2019-09-10 08:02:33,922 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:33,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:33,922 INFO L82 PathProgramCache]: Analyzing trace with hash 163610703, now seen corresponding path program 1 times [2019-09-10 08:02:33,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:33,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:33,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:33,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:33,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:34,316 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 08:02:34,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:34,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:02:34,316 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:34,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:02:34,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:02:34,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:02:34,317 INFO L87 Difference]: Start difference. First operand 456 states and 575 transitions. Second operand 12 states. [2019-09-10 08:02:34,889 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2019-09-10 08:02:35,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:35,500 INFO L93 Difference]: Finished difference Result 1245 states and 1711 transitions. [2019-09-10 08:02:35,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:02:35,500 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 86 [2019-09-10 08:02:35,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:35,502 INFO L225 Difference]: With dead ends: 1245 [2019-09-10 08:02:35,502 INFO L226 Difference]: Without dead ends: 1245 [2019-09-10 08:02:35,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:02:35,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2019-09-10 08:02:35,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 422. [2019-09-10 08:02:35,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-09-10 08:02:35,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 533 transitions. [2019-09-10 08:02:35,508 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 533 transitions. Word has length 86 [2019-09-10 08:02:35,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:35,509 INFO L475 AbstractCegarLoop]: Abstraction has 422 states and 533 transitions. [2019-09-10 08:02:35,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:02:35,509 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 533 transitions. [2019-09-10 08:02:35,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 08:02:35,510 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:35,510 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] [2019-09-10 08:02:35,510 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:35,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:35,510 INFO L82 PathProgramCache]: Analyzing trace with hash 28003791, now seen corresponding path program 1 times [2019-09-10 08:02:35,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:35,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:35,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:35,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:35,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:36,237 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 08:02:36,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:36,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:02:36,237 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:36,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:02:36,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:02:36,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:02:36,238 INFO L87 Difference]: Start difference. First operand 422 states and 533 transitions. Second operand 16 states. [2019-09-10 08:02:36,911 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-09-10 08:02:37,515 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-10 08:02:38,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:38,994 INFO L93 Difference]: Finished difference Result 1213 states and 1668 transitions. [2019-09-10 08:02:38,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:02:38,995 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 86 [2019-09-10 08:02:38,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:38,997 INFO L225 Difference]: With dead ends: 1213 [2019-09-10 08:02:38,997 INFO L226 Difference]: Without dead ends: 1213 [2019-09-10 08:02:38,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=172, Invalid=584, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:02:38,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2019-09-10 08:02:39,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 434. [2019-09-10 08:02:39,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-09-10 08:02:39,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 547 transitions. [2019-09-10 08:02:39,004 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 547 transitions. Word has length 86 [2019-09-10 08:02:39,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:39,004 INFO L475 AbstractCegarLoop]: Abstraction has 434 states and 547 transitions. [2019-09-10 08:02:39,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:02:39,005 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 547 transitions. [2019-09-10 08:02:39,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 08:02:39,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:39,005 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] [2019-09-10 08:02:39,006 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:39,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:39,006 INFO L82 PathProgramCache]: Analyzing trace with hash 676927323, now seen corresponding path program 1 times [2019-09-10 08:02:39,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:39,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:39,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:39,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:39,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:39,755 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 08:02:39,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:39,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:02:39,756 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:39,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:02:39,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:02:39,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:02:39,757 INFO L87 Difference]: Start difference. First operand 434 states and 547 transitions. Second operand 16 states. [2019-09-10 08:02:40,424 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-09-10 08:02:40,901 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-10 08:02:41,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:41,854 INFO L93 Difference]: Finished difference Result 653 states and 840 transitions. [2019-09-10 08:02:41,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 08:02:41,855 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 86 [2019-09-10 08:02:41,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:41,856 INFO L225 Difference]: With dead ends: 653 [2019-09-10 08:02:41,856 INFO L226 Difference]: Without dead ends: 653 [2019-09-10 08:02:41,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:02:41,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-09-10 08:02:41,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 418. [2019-09-10 08:02:41,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-09-10 08:02:41,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 526 transitions. [2019-09-10 08:02:41,862 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 526 transitions. Word has length 86 [2019-09-10 08:02:41,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:41,862 INFO L475 AbstractCegarLoop]: Abstraction has 418 states and 526 transitions. [2019-09-10 08:02:41,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:02:41,862 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 526 transitions. [2019-09-10 08:02:41,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 08:02:41,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:41,863 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] [2019-09-10 08:02:41,863 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:41,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:41,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1971516155, now seen corresponding path program 1 times [2019-09-10 08:02:41,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:41,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:41,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:41,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:41,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:42,694 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 08:02:42,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:42,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:02:42,694 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:42,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:02:42,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:02:42,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:02:42,695 INFO L87 Difference]: Start difference. First operand 418 states and 526 transitions. Second operand 16 states. [2019-09-10 08:02:43,453 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 08:02:43,604 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-09-10 08:02:43,744 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-09-10 08:02:43,905 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-09-10 08:02:45,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:45,356 INFO L93 Difference]: Finished difference Result 648 states and 828 transitions. [2019-09-10 08:02:45,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:02:45,357 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 86 [2019-09-10 08:02:45,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:45,358 INFO L225 Difference]: With dead ends: 648 [2019-09-10 08:02:45,358 INFO L226 Difference]: Without dead ends: 648 [2019-09-10 08:02:45,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:02:45,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-09-10 08:02:45,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 401. [2019-09-10 08:02:45,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-09-10 08:02:45,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 503 transitions. [2019-09-10 08:02:45,366 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 503 transitions. Word has length 86 [2019-09-10 08:02:45,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:45,366 INFO L475 AbstractCegarLoop]: Abstraction has 401 states and 503 transitions. [2019-09-10 08:02:45,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:02:45,366 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 503 transitions. [2019-09-10 08:02:45,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 08:02:45,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:45,368 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] [2019-09-10 08:02:45,368 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:45,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:45,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1312927659, now seen corresponding path program 1 times [2019-09-10 08:02:45,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:45,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:45,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:45,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:45,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:45,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:45,826 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 08:02:45,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:45,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:02:45,827 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:45,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:02:45,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:02:45,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:02:45,827 INFO L87 Difference]: Start difference. First operand 401 states and 503 transitions. Second operand 12 states. [2019-09-10 08:02:47,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:47,121 INFO L93 Difference]: Finished difference Result 622 states and 796 transitions. [2019-09-10 08:02:47,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:02:47,122 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 86 [2019-09-10 08:02:47,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:47,123 INFO L225 Difference]: With dead ends: 622 [2019-09-10 08:02:47,123 INFO L226 Difference]: Without dead ends: 622 [2019-09-10 08:02:47,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:02:47,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-09-10 08:02:47,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 397. [2019-09-10 08:02:47,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-10 08:02:47,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 498 transitions. [2019-09-10 08:02:47,129 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 498 transitions. Word has length 86 [2019-09-10 08:02:47,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:47,129 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 498 transitions. [2019-09-10 08:02:47,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:02:47,130 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 498 transitions. [2019-09-10 08:02:47,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 08:02:47,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:47,130 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] [2019-09-10 08:02:47,131 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:47,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:47,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1341980670, now seen corresponding path program 1 times [2019-09-10 08:02:47,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:47,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:47,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:47,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:47,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:47,883 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 08:02:47,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:47,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:02:47,883 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:47,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:02:47,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:02:47,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:02:47,884 INFO L87 Difference]: Start difference. First operand 397 states and 498 transitions. Second operand 17 states. [2019-09-10 08:02:48,736 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:02:48,887 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-10 08:02:49,063 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-10 08:02:49,239 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-10 08:02:50,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:50,533 INFO L93 Difference]: Finished difference Result 911 states and 1260 transitions. [2019-09-10 08:02:50,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:02:50,534 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 86 [2019-09-10 08:02:50,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:50,536 INFO L225 Difference]: With dead ends: 911 [2019-09-10 08:02:50,536 INFO L226 Difference]: Without dead ends: 911 [2019-09-10 08:02:50,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=217, Invalid=775, Unknown=0, NotChecked=0, Total=992 [2019-09-10 08:02:50,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2019-09-10 08:02:50,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 373. [2019-09-10 08:02:50,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-09-10 08:02:50,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 467 transitions. [2019-09-10 08:02:50,542 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 467 transitions. Word has length 86 [2019-09-10 08:02:50,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:50,543 INFO L475 AbstractCegarLoop]: Abstraction has 373 states and 467 transitions. [2019-09-10 08:02:50,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:02:50,543 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 467 transitions. [2019-09-10 08:02:50,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 08:02:50,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:50,543 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] [2019-09-10 08:02:50,544 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:50,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:50,544 INFO L82 PathProgramCache]: Analyzing trace with hash 151346387, now seen corresponding path program 1 times [2019-09-10 08:02:50,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:50,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:50,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:50,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:50,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:51,431 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 08:02:51,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:51,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 08:02:51,431 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:51,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 08:02:51,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 08:02:51,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:02:51,432 INFO L87 Difference]: Start difference. First operand 373 states and 467 transitions. Second operand 15 states. [2019-09-10 08:02:51,655 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2019-09-10 08:02:51,896 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-09-10 08:02:52,062 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-10 08:02:52,323 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-10 08:02:52,629 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 08:02:52,869 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2019-09-10 08:02:53,135 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 44 [2019-09-10 08:02:53,393 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 44 [2019-09-10 08:02:53,839 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 39 [2019-09-10 08:02:54,209 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-09-10 08:02:54,422 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2019-09-10 08:02:56,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:56,054 INFO L93 Difference]: Finished difference Result 1679 states and 2368 transitions. [2019-09-10 08:02:56,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:02:56,055 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 86 [2019-09-10 08:02:56,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:56,057 INFO L225 Difference]: With dead ends: 1679 [2019-09-10 08:02:56,057 INFO L226 Difference]: Without dead ends: 1679 [2019-09-10 08:02:56,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=234, Invalid=758, Unknown=0, NotChecked=0, Total=992 [2019-09-10 08:02:56,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2019-09-10 08:02:56,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 341. [2019-09-10 08:02:56,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-09-10 08:02:56,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 429 transitions. [2019-09-10 08:02:56,067 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 429 transitions. Word has length 86 [2019-09-10 08:02:56,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:56,067 INFO L475 AbstractCegarLoop]: Abstraction has 341 states and 429 transitions. [2019-09-10 08:02:56,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 08:02:56,067 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 429 transitions. [2019-09-10 08:02:56,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:02:56,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:56,068 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] [2019-09-10 08:02:56,069 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:56,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:56,069 INFO L82 PathProgramCache]: Analyzing trace with hash 470342809, now seen corresponding path program 1 times [2019-09-10 08:02:56,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:56,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:56,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:56,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:56,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:56,228 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 08:02:56,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:56,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:02:56,229 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:56,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:02:56,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:02:56,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:02:56,229 INFO L87 Difference]: Start difference. First operand 341 states and 429 transitions. Second operand 9 states. [2019-09-10 08:02:57,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:57,134 INFO L93 Difference]: Finished difference Result 541 states and 698 transitions. [2019-09-10 08:02:57,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 08:02:57,135 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-10 08:02:57,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:57,136 INFO L225 Difference]: With dead ends: 541 [2019-09-10 08:02:57,136 INFO L226 Difference]: Without dead ends: 541 [2019-09-10 08:02:57,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:02:57,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-09-10 08:02:57,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 341. [2019-09-10 08:02:57,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-09-10 08:02:57,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 427 transitions. [2019-09-10 08:02:57,142 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 427 transitions. Word has length 87 [2019-09-10 08:02:57,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:57,143 INFO L475 AbstractCegarLoop]: Abstraction has 341 states and 427 transitions. [2019-09-10 08:02:57,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:02:57,143 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 427 transitions. [2019-09-10 08:02:57,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:02:57,144 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:57,144 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] [2019-09-10 08:02:57,144 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:57,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:57,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1658746276, now seen corresponding path program 1 times [2019-09-10 08:02:57,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:57,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:57,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:57,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:57,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:57,613 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 08:02:57,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:57,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:02:57,613 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:57,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:02:57,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:02:57,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:02:57,614 INFO L87 Difference]: Start difference. First operand 341 states and 427 transitions. Second operand 9 states. [2019-09-10 08:02:58,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:58,131 INFO L93 Difference]: Finished difference Result 723 states and 992 transitions. [2019-09-10 08:02:58,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:02:58,132 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-10 08:02:58,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:58,133 INFO L225 Difference]: With dead ends: 723 [2019-09-10 08:02:58,133 INFO L226 Difference]: Without dead ends: 723 [2019-09-10 08:02:58,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:02:58,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2019-09-10 08:02:58,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 301. [2019-09-10 08:02:58,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-09-10 08:02:58,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 382 transitions. [2019-09-10 08:02:58,137 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 382 transitions. Word has length 87 [2019-09-10 08:02:58,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:58,137 INFO L475 AbstractCegarLoop]: Abstraction has 301 states and 382 transitions. [2019-09-10 08:02:58,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:02:58,137 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 382 transitions. [2019-09-10 08:02:58,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:02:58,138 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:58,138 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] [2019-09-10 08:02:58,138 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:58,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:58,139 INFO L82 PathProgramCache]: Analyzing trace with hash -266310598, now seen corresponding path program 1 times [2019-09-10 08:02:58,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:58,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:58,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:58,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:58,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:58,644 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 08:02:58,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:02:58,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:02:58,645 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:02:58,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:02:58,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:02:58,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:02:58,645 INFO L87 Difference]: Start difference. First operand 301 states and 382 transitions. Second operand 13 states. [2019-09-10 08:02:58,768 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-09-10 08:02:59,208 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 25 [2019-09-10 08:02:59,455 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2019-09-10 08:02:59,682 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2019-09-10 08:03:00,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:00,089 INFO L93 Difference]: Finished difference Result 565 states and 778 transitions. [2019-09-10 08:03:00,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:03:00,089 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 87 [2019-09-10 08:03:00,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:00,090 INFO L225 Difference]: With dead ends: 565 [2019-09-10 08:03:00,090 INFO L226 Difference]: Without dead ends: 565 [2019-09-10 08:03:00,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:03:00,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2019-09-10 08:03:00,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 257. [2019-09-10 08:03:00,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-10 08:03:00,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 333 transitions. [2019-09-10 08:03:00,096 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 333 transitions. Word has length 87 [2019-09-10 08:03:00,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:00,096 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 333 transitions. [2019-09-10 08:03:00,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:03:00,096 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 333 transitions. [2019-09-10 08:03:00,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 08:03:00,097 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:00,097 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] [2019-09-10 08:03:00,097 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:00,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:00,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1545293458, now seen corresponding path program 1 times [2019-09-10 08:03:00,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:00,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:00,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:00,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:00,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:00,890 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 08:03:00,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:03:00,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:03:00,890 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:03:00,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:03:00,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:03:00,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:03:00,891 INFO L87 Difference]: Start difference. First operand 257 states and 333 transitions. Second operand 16 states. [2019-09-10 08:03:01,023 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-09-10 08:03:01,638 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2019-09-10 08:03:01,833 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-10 08:03:02,021 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 08:03:02,199 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 08:03:02,367 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-10 08:03:02,599 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-09-10 08:03:02,814 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2019-09-10 08:03:03,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:03,521 INFO L93 Difference]: Finished difference Result 944 states and 1343 transitions. [2019-09-10 08:03:03,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:03:03,521 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 88 [2019-09-10 08:03:03,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:03,522 INFO L225 Difference]: With dead ends: 944 [2019-09-10 08:03:03,523 INFO L226 Difference]: Without dead ends: 944 [2019-09-10 08:03:03,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=194, Invalid=562, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:03:03,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2019-09-10 08:03:03,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 257. [2019-09-10 08:03:03,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-10 08:03:03,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 332 transitions. [2019-09-10 08:03:03,530 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 332 transitions. Word has length 88 [2019-09-10 08:03:03,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:03,530 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 332 transitions. [2019-09-10 08:03:03,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:03:03,530 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 332 transitions. [2019-09-10 08:03:03,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 08:03:03,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:03,531 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] [2019-09-10 08:03:03,531 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:03,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:03,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1695614251, now seen corresponding path program 1 times [2019-09-10 08:03:03,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:03,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:03,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:03,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:03,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:03,966 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 08:03:03,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:03:03,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 08:03:03,967 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:03:03,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 08:03:03,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 08:03:03,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:03:03,968 INFO L87 Difference]: Start difference. First operand 257 states and 332 transitions. Second operand 11 states. [2019-09-10 08:03:05,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:05,171 INFO L93 Difference]: Finished difference Result 947 states and 1346 transitions. [2019-09-10 08:03:05,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 08:03:05,172 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 89 [2019-09-10 08:03:05,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:05,174 INFO L225 Difference]: With dead ends: 947 [2019-09-10 08:03:05,174 INFO L226 Difference]: Without dead ends: 947 [2019-09-10 08:03:05,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:03:05,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2019-09-10 08:03:05,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 251. [2019-09-10 08:03:05,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-09-10 08:03:05,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 326 transitions. [2019-09-10 08:03:05,180 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 326 transitions. Word has length 89 [2019-09-10 08:03:05,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:05,180 INFO L475 AbstractCegarLoop]: Abstraction has 251 states and 326 transitions. [2019-09-10 08:03:05,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 08:03:05,180 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 326 transitions. [2019-09-10 08:03:05,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:03:05,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:05,181 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:03:05,181 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:05,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:05,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1499104933, now seen corresponding path program 1 times [2019-09-10 08:03:05,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:05,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:05,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:05,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:05,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:05,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:05,259 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 08:03:05,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:03:05,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:03:05,260 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:03:05,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:03:05,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:03:05,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:03:05,261 INFO L87 Difference]: Start difference. First operand 251 states and 326 transitions. Second operand 3 states. [2019-09-10 08:03:05,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:05,296 INFO L93 Difference]: Finished difference Result 369 states and 498 transitions. [2019-09-10 08:03:05,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:03:05,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-09-10 08:03:05,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:05,297 INFO L225 Difference]: With dead ends: 369 [2019-09-10 08:03:05,297 INFO L226 Difference]: Without dead ends: 369 [2019-09-10 08:03:05,298 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 08:03:05,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-09-10 08:03:05,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 367. [2019-09-10 08:03:05,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-09-10 08:03:05,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 497 transitions. [2019-09-10 08:03:05,301 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 497 transitions. Word has length 115 [2019-09-10 08:03:05,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:05,302 INFO L475 AbstractCegarLoop]: Abstraction has 367 states and 497 transitions. [2019-09-10 08:03:05,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:03:05,302 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 497 transitions. [2019-09-10 08:03:05,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:03:05,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:05,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:03:05,303 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:05,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:05,303 INFO L82 PathProgramCache]: Analyzing trace with hash -527865099, now seen corresponding path program 1 times [2019-09-10 08:03:05,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:05,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:05,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:05,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:05,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:05,360 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 08:03:05,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:03:05,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:03:05,361 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:03:05,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:03:05,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:03:05,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:03:05,362 INFO L87 Difference]: Start difference. First operand 367 states and 497 transitions. Second operand 3 states. [2019-09-10 08:03:05,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:05,396 INFO L93 Difference]: Finished difference Result 589 states and 814 transitions. [2019-09-10 08:03:05,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:03:05,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-09-10 08:03:05,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:05,397 INFO L225 Difference]: With dead ends: 589 [2019-09-10 08:03:05,397 INFO L226 Difference]: Without dead ends: 589 [2019-09-10 08:03:05,397 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 08:03:05,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-09-10 08:03:05,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 583. [2019-09-10 08:03:05,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-09-10 08:03:05,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 809 transitions. [2019-09-10 08:03:05,402 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 809 transitions. Word has length 117 [2019-09-10 08:03:05,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:05,402 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 809 transitions. [2019-09-10 08:03:05,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:03:05,402 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 809 transitions. [2019-09-10 08:03:05,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:03:05,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:05,404 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:03:05,404 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:05,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:05,404 INFO L82 PathProgramCache]: Analyzing trace with hash -461371587, now seen corresponding path program 1 times [2019-09-10 08:03:05,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:05,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:05,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:05,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:05,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:05,486 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 08:03:05,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:03:05,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:03:05,487 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:03:05,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:03:05,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:03:05,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:03:05,487 INFO L87 Difference]: Start difference. First operand 583 states and 809 transitions. Second operand 3 states. [2019-09-10 08:03:05,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:05,530 INFO L93 Difference]: Finished difference Result 817 states and 1148 transitions. [2019-09-10 08:03:05,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:03:05,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-09-10 08:03:05,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:05,532 INFO L225 Difference]: With dead ends: 817 [2019-09-10 08:03:05,532 INFO L226 Difference]: Without dead ends: 817 [2019-09-10 08:03:05,533 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 08:03:05,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2019-09-10 08:03:05,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 815. [2019-09-10 08:03:05,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2019-09-10 08:03:05,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1147 transitions. [2019-09-10 08:03:05,540 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1147 transitions. Word has length 117 [2019-09-10 08:03:05,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:05,540 INFO L475 AbstractCegarLoop]: Abstraction has 815 states and 1147 transitions. [2019-09-10 08:03:05,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:03:05,541 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1147 transitions. [2019-09-10 08:03:05,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:03:05,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:05,542 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:03:05,542 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:05,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:05,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1576522212, now seen corresponding path program 1 times [2019-09-10 08:03:05,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:05,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:05,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:05,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:05,543 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:05,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:05,653 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 08:03:05,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:03:05,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:03:05,654 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:03:05,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:03:05,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:03:05,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:03:05,655 INFO L87 Difference]: Start difference. First operand 815 states and 1147 transitions. Second operand 7 states. [2019-09-10 08:03:06,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:06,207 INFO L93 Difference]: Finished difference Result 2957 states and 4204 transitions. [2019-09-10 08:03:06,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:03:06,207 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-09-10 08:03:06,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:06,210 INFO L225 Difference]: With dead ends: 2957 [2019-09-10 08:03:06,211 INFO L226 Difference]: Without dead ends: 2957 [2019-09-10 08:03:06,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:03:06,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2019-09-10 08:03:06,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 1623. [2019-09-10 08:03:06,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1623 states. [2019-09-10 08:03:06,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2325 transitions. [2019-09-10 08:03:06,230 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2325 transitions. Word has length 117 [2019-09-10 08:03:06,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:06,230 INFO L475 AbstractCegarLoop]: Abstraction has 1623 states and 2325 transitions. [2019-09-10 08:03:06,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:03:06,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2325 transitions. [2019-09-10 08:03:06,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:03:06,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:06,231 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:03:06,231 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:06,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:06,232 INFO L82 PathProgramCache]: Analyzing trace with hash 298627100, now seen corresponding path program 1 times [2019-09-10 08:03:06,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:06,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:06,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:06,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:06,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:06,333 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 08:03:06,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:03:06,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:03:06,334 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:03:06,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:03:06,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:03:06,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:03:06,335 INFO L87 Difference]: Start difference. First operand 1623 states and 2325 transitions. Second operand 7 states. [2019-09-10 08:03:06,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:06,900 INFO L93 Difference]: Finished difference Result 5293 states and 7568 transitions. [2019-09-10 08:03:06,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:03:06,901 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-09-10 08:03:06,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:06,906 INFO L225 Difference]: With dead ends: 5293 [2019-09-10 08:03:06,906 INFO L226 Difference]: Without dead ends: 5293 [2019-09-10 08:03:06,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:03:06,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5293 states. [2019-09-10 08:03:06,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5293 to 3359. [2019-09-10 08:03:06,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3359 states. [2019-09-10 08:03:06,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3359 states to 3359 states and 4849 transitions. [2019-09-10 08:03:06,940 INFO L78 Accepts]: Start accepts. Automaton has 3359 states and 4849 transitions. Word has length 117 [2019-09-10 08:03:06,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:06,941 INFO L475 AbstractCegarLoop]: Abstraction has 3359 states and 4849 transitions. [2019-09-10 08:03:06,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:03:06,941 INFO L276 IsEmpty]: Start isEmpty. Operand 3359 states and 4849 transitions. [2019-09-10 08:03:06,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:03:06,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:06,942 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:03:06,943 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:06,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:06,943 INFO L82 PathProgramCache]: Analyzing trace with hash 662712860, now seen corresponding path program 1 times [2019-09-10 08:03:06,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:06,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:06,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:06,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:06,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:07,029 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 08:03:07,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:03:07,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:03:07,029 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:03:07,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:03:07,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:03:07,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:03:07,030 INFO L87 Difference]: Start difference. First operand 3359 states and 4849 transitions. Second operand 7 states. [2019-09-10 08:03:07,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:07,602 INFO L93 Difference]: Finished difference Result 11893 states and 17060 transitions. [2019-09-10 08:03:07,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:03:07,602 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-09-10 08:03:07,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:07,613 INFO L225 Difference]: With dead ends: 11893 [2019-09-10 08:03:07,613 INFO L226 Difference]: Without dead ends: 11893 [2019-09-10 08:03:07,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:03:07,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11893 states. [2019-09-10 08:03:07,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11893 to 7071. [2019-09-10 08:03:07,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7071 states. [2019-09-10 08:03:07,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7071 states to 7071 states and 10233 transitions. [2019-09-10 08:03:07,686 INFO L78 Accepts]: Start accepts. Automaton has 7071 states and 10233 transitions. Word has length 117 [2019-09-10 08:03:07,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:07,687 INFO L475 AbstractCegarLoop]: Abstraction has 7071 states and 10233 transitions. [2019-09-10 08:03:07,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:03:07,687 INFO L276 IsEmpty]: Start isEmpty. Operand 7071 states and 10233 transitions. [2019-09-10 08:03:07,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:03:07,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:07,689 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:03:07,689 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:07,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:07,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1403171868, now seen corresponding path program 1 times [2019-09-10 08:03:07,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:07,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:07,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:07,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:07,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:07,794 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 08:03:07,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:03:07,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:03:07,795 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:03:07,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:03:07,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:03:07,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:03:07,796 INFO L87 Difference]: Start difference. First operand 7071 states and 10233 transitions. Second operand 7 states. [2019-09-10 08:03:08,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:08,451 INFO L93 Difference]: Finished difference Result 20329 states and 29250 transitions. [2019-09-10 08:03:08,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:03:08,451 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-09-10 08:03:08,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:08,469 INFO L225 Difference]: With dead ends: 20329 [2019-09-10 08:03:08,470 INFO L226 Difference]: Without dead ends: 20329 [2019-09-10 08:03:08,470 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:03:08,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20329 states. [2019-09-10 08:03:08,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20329 to 11679. [2019-09-10 08:03:08,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11679 states. [2019-09-10 08:03:08,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11679 states to 11679 states and 16929 transitions. [2019-09-10 08:03:08,670 INFO L78 Accepts]: Start accepts. Automaton has 11679 states and 16929 transitions. Word has length 117 [2019-09-10 08:03:08,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:08,670 INFO L475 AbstractCegarLoop]: Abstraction has 11679 states and 16929 transitions. [2019-09-10 08:03:08,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:03:08,671 INFO L276 IsEmpty]: Start isEmpty. Operand 11679 states and 16929 transitions. [2019-09-10 08:03:08,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:03:08,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:08,673 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:03:08,673 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:08,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:08,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1159936026, now seen corresponding path program 1 times [2019-09-10 08:03:08,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:08,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:08,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:08,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:08,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:08,758 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 08:03:08,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:03:08,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:03:08,759 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:03:08,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:03:08,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:03:08,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:03:08,759 INFO L87 Difference]: Start difference. First operand 11679 states and 16929 transitions. Second operand 7 states. [2019-09-10 08:03:09,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:09,252 INFO L93 Difference]: Finished difference Result 24645 states and 35324 transitions. [2019-09-10 08:03:09,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:03:09,252 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2019-09-10 08:03:09,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:09,274 INFO L225 Difference]: With dead ends: 24645 [2019-09-10 08:03:09,274 INFO L226 Difference]: Without dead ends: 24645 [2019-09-10 08:03:09,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:03:09,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24645 states. [2019-09-10 08:03:09,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24645 to 13775. [2019-09-10 08:03:09,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13775 states. [2019-09-10 08:03:09,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13775 states to 13775 states and 19809 transitions. [2019-09-10 08:03:09,449 INFO L78 Accepts]: Start accepts. Automaton has 13775 states and 19809 transitions. Word has length 118 [2019-09-10 08:03:09,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:09,450 INFO L475 AbstractCegarLoop]: Abstraction has 13775 states and 19809 transitions. [2019-09-10 08:03:09,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:03:09,450 INFO L276 IsEmpty]: Start isEmpty. Operand 13775 states and 19809 transitions. [2019-09-10 08:03:09,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:03:09,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:09,452 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:03:09,452 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:09,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:09,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1593339123, now seen corresponding path program 1 times [2019-09-10 08:03:09,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:09,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:09,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:09,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:09,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:09,500 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 08:03:09,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:03:09,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:03:09,500 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:03:09,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:03:09,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:03:09,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:03:09,501 INFO L87 Difference]: Start difference. First operand 13775 states and 19809 transitions. Second operand 3 states. [2019-09-10 08:03:09,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:09,564 INFO L93 Difference]: Finished difference Result 15201 states and 21642 transitions. [2019-09-10 08:03:09,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:03:09,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-10 08:03:09,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:09,577 INFO L225 Difference]: With dead ends: 15201 [2019-09-10 08:03:09,577 INFO L226 Difference]: Without dead ends: 15201 [2019-09-10 08:03:09,577 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 08:03:09,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15201 states. [2019-09-10 08:03:10,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15201 to 15007. [2019-09-10 08:03:10,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15007 states. [2019-09-10 08:03:10,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15007 states to 15007 states and 21417 transitions. [2019-09-10 08:03:10,317 INFO L78 Accepts]: Start accepts. Automaton has 15007 states and 21417 transitions. Word has length 118 [2019-09-10 08:03:10,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:10,317 INFO L475 AbstractCegarLoop]: Abstraction has 15007 states and 21417 transitions. [2019-09-10 08:03:10,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:03:10,318 INFO L276 IsEmpty]: Start isEmpty. Operand 15007 states and 21417 transitions. [2019-09-10 08:03:10,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:03:10,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:10,319 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:03:10,320 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:10,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:10,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1861651787, now seen corresponding path program 1 times [2019-09-10 08:03:10,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:10,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:10,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:10,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:10,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:10,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:10,405 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 08:03:10,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:03:10,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:03:10,406 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:03:10,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:03:10,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:03:10,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:03:10,407 INFO L87 Difference]: Start difference. First operand 15007 states and 21417 transitions. Second operand 6 states. [2019-09-10 08:03:10,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:10,539 INFO L93 Difference]: Finished difference Result 23945 states and 33492 transitions. [2019-09-10 08:03:10,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:03:10,539 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-09-10 08:03:10,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:10,567 INFO L225 Difference]: With dead ends: 23945 [2019-09-10 08:03:10,567 INFO L226 Difference]: Without dead ends: 23945 [2019-09-10 08:03:10,567 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 08:03:10,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23945 states. [2019-09-10 08:03:10,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23945 to 15199. [2019-09-10 08:03:10,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15199 states. [2019-09-10 08:03:10,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15199 states to 15199 states and 21545 transitions. [2019-09-10 08:03:10,749 INFO L78 Accepts]: Start accepts. Automaton has 15199 states and 21545 transitions. Word has length 118 [2019-09-10 08:03:10,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:10,749 INFO L475 AbstractCegarLoop]: Abstraction has 15199 states and 21545 transitions. [2019-09-10 08:03:10,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:03:10,750 INFO L276 IsEmpty]: Start isEmpty. Operand 15199 states and 21545 transitions. [2019-09-10 08:03:10,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:03:10,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:10,752 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:03:10,752 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:10,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:10,752 INFO L82 PathProgramCache]: Analyzing trace with hash -2125598154, now seen corresponding path program 1 times [2019-09-10 08:03:10,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:10,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:10,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:10,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:10,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:10,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:10,810 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 08:03:10,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:03:10,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:03:10,811 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:03:10,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:03:10,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:03:10,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:03:10,812 INFO L87 Difference]: Start difference. First operand 15199 states and 21545 transitions. Second operand 3 states. [2019-09-10 08:03:10,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:10,854 INFO L93 Difference]: Finished difference Result 14289 states and 20026 transitions. [2019-09-10 08:03:10,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:03:10,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-09-10 08:03:10,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:10,867 INFO L225 Difference]: With dead ends: 14289 [2019-09-10 08:03:10,867 INFO L226 Difference]: Without dead ends: 14289 [2019-09-10 08:03:10,867 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 08:03:10,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14289 states. [2019-09-10 08:03:10,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14289 to 12727. [2019-09-10 08:03:10,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12727 states. [2019-09-10 08:03:10,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12727 states to 12727 states and 17869 transitions. [2019-09-10 08:03:10,971 INFO L78 Accepts]: Start accepts. Automaton has 12727 states and 17869 transitions. Word has length 119 [2019-09-10 08:03:10,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:10,972 INFO L475 AbstractCegarLoop]: Abstraction has 12727 states and 17869 transitions. [2019-09-10 08:03:10,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:03:10,972 INFO L276 IsEmpty]: Start isEmpty. Operand 12727 states and 17869 transitions. [2019-09-10 08:03:10,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:03:10,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:10,974 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:03:10,974 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:10,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:10,974 INFO L82 PathProgramCache]: Analyzing trace with hash -45815035, now seen corresponding path program 1 times [2019-09-10 08:03:10,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:10,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:10,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:10,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:10,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:11,036 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 08:03:11,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:03:11,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:03:11,037 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:03:11,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:03:11,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:03:11,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:03:11,038 INFO L87 Difference]: Start difference. First operand 12727 states and 17869 transitions. Second operand 3 states. [2019-09-10 08:03:11,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:11,102 INFO L93 Difference]: Finished difference Result 11817 states and 16350 transitions. [2019-09-10 08:03:11,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:03:11,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-10 08:03:11,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:11,117 INFO L225 Difference]: With dead ends: 11817 [2019-09-10 08:03:11,117 INFO L226 Difference]: Without dead ends: 11817 [2019-09-10 08:03:11,118 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 08:03:11,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11817 states. [2019-09-10 08:03:11,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11817 to 9007. [2019-09-10 08:03:11,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9007 states. [2019-09-10 08:03:11,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9007 states to 9007 states and 12448 transitions. [2019-09-10 08:03:11,251 INFO L78 Accepts]: Start accepts. Automaton has 9007 states and 12448 transitions. Word has length 120 [2019-09-10 08:03:11,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:11,252 INFO L475 AbstractCegarLoop]: Abstraction has 9007 states and 12448 transitions. [2019-09-10 08:03:11,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:03:11,252 INFO L276 IsEmpty]: Start isEmpty. Operand 9007 states and 12448 transitions. [2019-09-10 08:03:11,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:03:11,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:11,369 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:03:11,369 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:11,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:11,370 INFO L82 PathProgramCache]: Analyzing trace with hash -686485906, now seen corresponding path program 1 times [2019-09-10 08:03:11,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:11,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:11,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:11,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:11,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:11,426 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 08:03:11,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:03:11,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:03:11,427 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:03:11,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:03:11,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:03:11,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:03:11,428 INFO L87 Difference]: Start difference. First operand 9007 states and 12448 transitions. Second operand 3 states. [2019-09-10 08:03:11,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:11,478 INFO L93 Difference]: Finished difference Result 14283 states and 19586 transitions. [2019-09-10 08:03:11,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:03:11,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-10 08:03:11,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:11,492 INFO L225 Difference]: With dead ends: 14283 [2019-09-10 08:03:11,492 INFO L226 Difference]: Without dead ends: 14283 [2019-09-10 08:03:11,492 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 08:03:11,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14283 states. [2019-09-10 08:03:11,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14283 to 13369. [2019-09-10 08:03:11,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13369 states. [2019-09-10 08:03:11,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13369 states to 13369 states and 18483 transitions. [2019-09-10 08:03:11,598 INFO L78 Accepts]: Start accepts. Automaton has 13369 states and 18483 transitions. Word has length 121 [2019-09-10 08:03:11,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:11,598 INFO L475 AbstractCegarLoop]: Abstraction has 13369 states and 18483 transitions. [2019-09-10 08:03:11,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:03:11,598 INFO L276 IsEmpty]: Start isEmpty. Operand 13369 states and 18483 transitions. [2019-09-10 08:03:11,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:03:11,599 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:11,599 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:03:11,599 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:11,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:11,600 INFO L82 PathProgramCache]: Analyzing trace with hash 470166097, now seen corresponding path program 1 times [2019-09-10 08:03:11,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:11,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:11,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:11,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:11,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:11,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:11,651 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 08:03:11,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:03:11,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:03:11,651 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:03:11,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:03:11,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:03:11,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:03:11,652 INFO L87 Difference]: Start difference. First operand 13369 states and 18483 transitions. Second operand 3 states. [2019-09-10 08:03:11,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:11,695 INFO L93 Difference]: Finished difference Result 16177 states and 22046 transitions. [2019-09-10 08:03:11,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:03:11,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-10 08:03:11,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:11,708 INFO L225 Difference]: With dead ends: 16177 [2019-09-10 08:03:11,709 INFO L226 Difference]: Without dead ends: 16177 [2019-09-10 08:03:11,709 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 08:03:11,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16177 states. [2019-09-10 08:03:11,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16177 to 15391. [2019-09-10 08:03:11,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15391 states. [2019-09-10 08:03:11,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15391 states to 15391 states and 21105 transitions. [2019-09-10 08:03:11,821 INFO L78 Accepts]: Start accepts. Automaton has 15391 states and 21105 transitions. Word has length 122 [2019-09-10 08:03:11,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:11,822 INFO L475 AbstractCegarLoop]: Abstraction has 15391 states and 21105 transitions. [2019-09-10 08:03:11,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:03:11,822 INFO L276 IsEmpty]: Start isEmpty. Operand 15391 states and 21105 transitions. [2019-09-10 08:03:11,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:03:11,822 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:11,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, 1, 1, 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:03:11,823 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:11,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:11,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1737959858, now seen corresponding path program 1 times [2019-09-10 08:03:11,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:11,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:11,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:11,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:11,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:11,870 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 08:03:11,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:03:11,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:03:11,871 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:03:11,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:03:11,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:03:11,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:03:11,872 INFO L87 Difference]: Start difference. First operand 15391 states and 21105 transitions. Second operand 3 states. [2019-09-10 08:03:11,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:11,918 INFO L93 Difference]: Finished difference Result 16273 states and 22122 transitions. [2019-09-10 08:03:11,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:03:11,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-09-10 08:03:11,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:11,935 INFO L225 Difference]: With dead ends: 16273 [2019-09-10 08:03:11,936 INFO L226 Difference]: Without dead ends: 16273 [2019-09-10 08:03:11,936 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 08:03:11,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16273 states. [2019-09-10 08:03:12,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16273 to 15951. [2019-09-10 08:03:12,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15951 states. [2019-09-10 08:03:12,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15951 states to 15951 states and 21681 transitions. [2019-09-10 08:03:12,052 INFO L78 Accepts]: Start accepts. Automaton has 15951 states and 21681 transitions. Word has length 123 [2019-09-10 08:03:12,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:12,053 INFO L475 AbstractCegarLoop]: Abstraction has 15951 states and 21681 transitions. [2019-09-10 08:03:12,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:03:12,053 INFO L276 IsEmpty]: Start isEmpty. Operand 15951 states and 21681 transitions. [2019-09-10 08:03:12,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-10 08:03:12,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:12,056 INFO L399 BasicCegarLoop]: trace histogram [2, 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, 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:03:12,056 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:12,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:12,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1630138217, now seen corresponding path program 1 times [2019-09-10 08:03:12,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:12,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:12,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:12,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:12,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:12,302 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:03:12,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:03:12,302 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:03:12,303 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 152 with the following transitions: [2019-09-10 08:03:12,305 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], [75], [78], [81], [84], [87], [90], [93], [96], [100], [103], [106], [110], [113], [116], [120], [123], [126], [130], [133], [136], [140], [143], [146], [149], [153], [156], [159], [163], [166], [170], [173], [176], [273], [313], [316], [319], [322], [397], [2269], [2271], [2274], [2279], [2282], [2286], [2299], [2301], [2379], [2382], [2385], [2388], [2445], [3287], [3290], [3291], [3293], [3373], [3376], [3379], [3382], [3423], [3852], [3855], [3889], [4083], [4086], [4090], [4093], [4096], [4100], [4102], [4131], [4134], [4149], [4151], [4153], [4156], [4171], [4173], [4175], [4178], [4193], [4195], [4197], [4200], [4203], [4208], [4211], [4217], [4220], [4223], [4226], [4234], [4236], [4239], [4242], [4250], [4252], [4255], [4258], [4266], [4268], [4271], [4274], [4282], [4284], [4287], [4290], [4298], [4344], [4345], [4349], [4350], [4351] [2019-09-10 08:03:12,349 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:03:12,350 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:03:12,513 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:03:13,289 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:03:13,292 INFO L272 AbstractInterpreter]: Visited 138 different actions 577 times. Merged at 51 different actions 387 times. Widened at 20 different actions 67 times. Performed 2185 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2185 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 40 fixpoints after 13 different actions. Largest state had 268 variables. [2019-09-10 08:03:13,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:13,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:03:13,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:03:13,298 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 08:03:13,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:13,314 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:03:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:13,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 1513 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 08:03:13,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:03:13,827 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 08:03:13,828 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:03:13,950 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 08:03:13,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:03:13,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 7] total 14 [2019-09-10 08:03:13,955 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:03:13,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:03:13,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:03:13,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:03:13,960 INFO L87 Difference]: Start difference. First operand 15951 states and 21681 transitions. Second operand 7 states. [2019-09-10 08:03:14,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:14,209 INFO L93 Difference]: Finished difference Result 73719 states and 100077 transitions. [2019-09-10 08:03:14,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:03:14,209 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 151 [2019-09-10 08:03:14,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:14,352 INFO L225 Difference]: With dead ends: 73719 [2019-09-10 08:03:14,352 INFO L226 Difference]: Without dead ends: 73719 [2019-09-10 08:03:14,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 293 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:03:14,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73719 states. [2019-09-10 08:03:15,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73719 to 26047. [2019-09-10 08:03:15,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26047 states. [2019-09-10 08:03:15,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26047 states to 26047 states and 35249 transitions. [2019-09-10 08:03:15,374 INFO L78 Accepts]: Start accepts. Automaton has 26047 states and 35249 transitions. Word has length 151 [2019-09-10 08:03:15,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:15,375 INFO L475 AbstractCegarLoop]: Abstraction has 26047 states and 35249 transitions. [2019-09-10 08:03:15,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:03:15,375 INFO L276 IsEmpty]: Start isEmpty. Operand 26047 states and 35249 transitions. [2019-09-10 08:03:15,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-10 08:03:15,387 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:15,387 INFO L399 BasicCegarLoop]: trace histogram [2, 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, 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:03:15,387 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:15,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:15,388 INFO L82 PathProgramCache]: Analyzing trace with hash 245011095, now seen corresponding path program 1 times [2019-09-10 08:03:15,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:15,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:15,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:15,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:15,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:15,798 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 08:03:15,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:03:15,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:03:15,799 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:03:15,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:03:15,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:03:15,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:03:15,800 INFO L87 Difference]: Start difference. First operand 26047 states and 35249 transitions. Second operand 7 states. [2019-09-10 08:03:16,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:16,216 INFO L93 Difference]: Finished difference Result 89089 states and 120678 transitions. [2019-09-10 08:03:16,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:03:16,216 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 151 [2019-09-10 08:03:16,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:16,401 INFO L225 Difference]: With dead ends: 89089 [2019-09-10 08:03:16,402 INFO L226 Difference]: Without dead ends: 89089 [2019-09-10 08:03:16,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:03:16,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89089 states. [2019-09-10 08:03:17,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89089 to 41127. [2019-09-10 08:03:17,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41127 states. [2019-09-10 08:03:17,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41127 states to 41127 states and 55441 transitions. [2019-09-10 08:03:17,825 INFO L78 Accepts]: Start accepts. Automaton has 41127 states and 55441 transitions. Word has length 151 [2019-09-10 08:03:17,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:17,825 INFO L475 AbstractCegarLoop]: Abstraction has 41127 states and 55441 transitions. [2019-09-10 08:03:17,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:03:17,826 INFO L276 IsEmpty]: Start isEmpty. Operand 41127 states and 55441 transitions. [2019-09-10 08:03:17,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-10 08:03:17,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:17,832 INFO L399 BasicCegarLoop]: trace histogram [2, 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, 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:03:17,833 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:17,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:17,833 INFO L82 PathProgramCache]: Analyzing trace with hash 609096855, now seen corresponding path program 1 times [2019-09-10 08:03:17,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:17,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:17,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:17,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:17,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:17,997 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:03:17,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:03:17,997 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:03:17,999 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 152 with the following transitions: [2019-09-10 08:03:18,002 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], [75], [78], [81], [84], [87], [90], [93], [96], [100], [103], [106], [110], [113], [116], [120], [123], [126], [130], [133], [136], [140], [143], [146], [149], [153], [156], [159], [163], [166], [170], [173], [176], [273], [313], [316], [319], [322], [397], [2269], [2271], [2274], [2279], [2282], [2286], [2299], [2301], [2379], [2382], [2385], [2388], [2445], [3287], [3290], [3291], [3293], [3373], [3376], [3379], [3382], [3423], [3852], [3855], [3889], [4083], [4086], [4090], [4093], [4096], [4100], [4102], [4131], [4134], [4149], [4151], [4153], [4156], [4159], [4164], [4167], [4173], [4175], [4178], [4193], [4195], [4197], [4200], [4215], [4217], [4220], [4223], [4226], [4234], [4236], [4239], [4242], [4250], [4252], [4255], [4258], [4266], [4268], [4271], [4274], [4282], [4284], [4287], [4290], [4298], [4344], [4345], [4349], [4350], [4351] [2019-09-10 08:03:18,019 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:03:18,019 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:03:18,089 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:03:18,615 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:03:18,615 INFO L272 AbstractInterpreter]: Visited 138 different actions 558 times. Merged at 51 different actions 368 times. Widened at 20 different actions 62 times. Performed 2196 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2196 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 38 fixpoints after 9 different actions. Largest state had 268 variables. [2019-09-10 08:03:18,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:18,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:03:18,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:03:18,616 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 08:03:18,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:18,634 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 08:03:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:18,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 1513 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 08:03:18,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:03:19,042 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 08:03:19,043 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:03:19,149 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 08:03:19,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:03:19,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 7] total 14 [2019-09-10 08:03:19,162 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:03:19,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:03:19,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:03:19,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:03:19,163 INFO L87 Difference]: Start difference. First operand 41127 states and 55441 transitions. Second operand 7 states. [2019-09-10 08:03:19,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:19,859 INFO L93 Difference]: Finished difference Result 99581 states and 134798 transitions. [2019-09-10 08:03:19,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:03:19,860 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 151 [2019-09-10 08:03:19,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:20,024 INFO L225 Difference]: With dead ends: 99581 [2019-09-10 08:03:20,024 INFO L226 Difference]: Without dead ends: 99581 [2019-09-10 08:03:20,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 293 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:03:20,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99581 states. [2019-09-10 08:03:20,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99581 to 51223. [2019-09-10 08:03:20,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51223 states. [2019-09-10 08:03:21,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51223 states to 51223 states and 69009 transitions. [2019-09-10 08:03:21,048 INFO L78 Accepts]: Start accepts. Automaton has 51223 states and 69009 transitions. Word has length 151 [2019-09-10 08:03:21,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:21,048 INFO L475 AbstractCegarLoop]: Abstraction has 51223 states and 69009 transitions. [2019-09-10 08:03:21,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:03:21,049 INFO L276 IsEmpty]: Start isEmpty. Operand 51223 states and 69009 transitions. [2019-09-10 08:03:21,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-10 08:03:21,055 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:21,055 INFO L399 BasicCegarLoop]: trace histogram [2, 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, 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:03:21,055 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:21,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:21,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1349555863, now seen corresponding path program 1 times [2019-09-10 08:03:21,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:21,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:21,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:21,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:21,057 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:22,519 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:03:22,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:03:22,520 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:03:22,522 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 152 with the following transitions: [2019-09-10 08:03:22,523 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], [75], [78], [81], [84], [87], [90], [93], [96], [100], [103], [106], [110], [113], [116], [120], [123], [126], [130], [133], [136], [140], [143], [146], [149], [153], [156], [159], [163], [166], [170], [173], [176], [273], [313], [316], [319], [322], [397], [2269], [2271], [2274], [2279], [2282], [2286], [2299], [2301], [2379], [2382], [2385], [2388], [2445], [3287], [3290], [3291], [3293], [3373], [3376], [3379], [3382], [3423], [3852], [3855], [3889], [4083], [4086], [4090], [4093], [4096], [4100], [4102], [4131], [4134], [4137], [4142], [4145], [4151], [4153], [4156], [4171], [4173], [4175], [4178], [4193], [4195], [4197], [4200], [4215], [4217], [4220], [4223], [4226], [4234], [4236], [4239], [4242], [4250], [4252], [4255], [4258], [4266], [4268], [4271], [4274], [4282], [4284], [4287], [4290], [4298], [4344], [4345], [4349], [4350], [4351] [2019-09-10 08:03:22,528 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:03:22,528 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:03:22,577 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:03:23,060 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:03:23,061 INFO L272 AbstractInterpreter]: Visited 138 different actions 575 times. Merged at 51 different actions 386 times. Widened at 19 different actions 54 times. Performed 2224 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2224 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 45 fixpoints after 13 different actions. Largest state had 268 variables. [2019-09-10 08:03:23,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:23,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:03:23,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:03:23,061 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 08:03:23,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:23,084 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:03:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:23,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 1513 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 08:03:23,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:03:23,499 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 08:03:23,499 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:03:23,603 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 08:03:23,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:03:23,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 7] total 14 [2019-09-10 08:03:23,609 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:03:23,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:03:23,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:03:23,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:03:23,611 INFO L87 Difference]: Start difference. First operand 51223 states and 69009 transitions. Second operand 7 states. [2019-09-10 08:03:24,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:24,022 INFO L93 Difference]: Finished difference Result 110073 states and 148918 transitions. [2019-09-10 08:03:24,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:03:24,022 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 151 [2019-09-10 08:03:24,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:24,166 INFO L225 Difference]: With dead ends: 110073 [2019-09-10 08:03:24,166 INFO L226 Difference]: Without dead ends: 110073 [2019-09-10 08:03:24,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 293 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:03:24,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110073 states. [2019-09-10 08:03:25,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110073 to 61319. [2019-09-10 08:03:25,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61319 states. [2019-09-10 08:03:25,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61319 states to 61319 states and 82577 transitions. [2019-09-10 08:03:25,167 INFO L78 Accepts]: Start accepts. Automaton has 61319 states and 82577 transitions. Word has length 151 [2019-09-10 08:03:25,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:25,167 INFO L475 AbstractCegarLoop]: Abstraction has 61319 states and 82577 transitions. [2019-09-10 08:03:25,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:03:25,167 INFO L276 IsEmpty]: Start isEmpty. Operand 61319 states and 82577 transitions. [2019-09-10 08:03:25,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 08:03:25,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:25,172 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, 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:03:25,173 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:25,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:25,173 INFO L82 PathProgramCache]: Analyzing trace with hash -502160129, now seen corresponding path program 1 times [2019-09-10 08:03:25,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:25,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:25,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:25,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:25,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:25,327 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:03:25,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:03:25,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:03:25,328 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:03:25,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:03:25,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:03:25,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:03:25,329 INFO L87 Difference]: Start difference. First operand 61319 states and 82577 transitions. Second operand 7 states. [2019-09-10 08:03:26,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:26,006 INFO L93 Difference]: Finished difference Result 119601 states and 161734 transitions. [2019-09-10 08:03:26,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:03:26,007 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 152 [2019-09-10 08:03:26,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:26,226 INFO L225 Difference]: With dead ends: 119601 [2019-09-10 08:03:26,226 INFO L226 Difference]: Without dead ends: 119601 [2019-09-10 08:03:26,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:03:26,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119601 states. [2019-09-10 08:03:27,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119601 to 71415. [2019-09-10 08:03:27,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71415 states. [2019-09-10 08:03:27,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71415 states to 71415 states and 96145 transitions. [2019-09-10 08:03:27,624 INFO L78 Accepts]: Start accepts. Automaton has 71415 states and 96145 transitions. Word has length 152 [2019-09-10 08:03:27,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:27,624 INFO L475 AbstractCegarLoop]: Abstraction has 71415 states and 96145 transitions. [2019-09-10 08:03:27,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:03:27,624 INFO L276 IsEmpty]: Start isEmpty. Operand 71415 states and 96145 transitions. [2019-09-10 08:03:27,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 08:03:27,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:27,631 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 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:03:27,632 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:27,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:27,632 INFO L82 PathProgramCache]: Analyzing trace with hash -2110971407, now seen corresponding path program 1 times [2019-09-10 08:03:27,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:27,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:27,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:27,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:27,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:28,077 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:03:28,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:03:28,078 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:03:28,078 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 154 with the following transitions: [2019-09-10 08:03:28,079 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], [75], [78], [81], [84], [87], [90], [93], [96], [100], [103], [106], [110], [113], [116], [120], [123], [126], [130], [133], [136], [140], [143], [146], [149], [153], [156], [159], [163], [166], [170], [173], [176], [273], [313], [316], [319], [322], [397], [2269], [2271], [2274], [2277], [2279], [2282], [2286], [2288], [2293], [2301], [2379], [2382], [2385], [2388], [2445], [3287], [3290], [3291], [3293], [3373], [3376], [3379], [3382], [3423], [3852], [3855], [3889], [4083], [4086], [4090], [4093], [4096], [4100], [4102], [4105], [4110], [4112], [4127], [4129], [4131], [4134], [4149], [4151], [4153], [4156], [4171], [4173], [4175], [4178], [4193], [4195], [4197], [4200], [4215], [4217], [4220], [4223], [4226], [4234], [4236], [4239], [4242], [4250], [4252], [4255], [4258], [4266], [4268], [4271], [4274], [4282], [4284], [4287], [4290], [4298], [4344], [4345], [4349], [4350], [4351] [2019-09-10 08:03:28,084 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:03:28,084 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:03:28,158 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:03:28,973 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:03:28,973 INFO L272 AbstractInterpreter]: Visited 143 different actions 895 times. Merged at 55 different actions 652 times. Widened at 23 different actions 122 times. Performed 3118 root evaluator evaluations with a maximum evaluation depth of 7. Performed 3118 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 106 fixpoints after 19 different actions. Largest state had 268 variables. [2019-09-10 08:03:28,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:28,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:03:28,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:03:28,974 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 08:03:29,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:29,311 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:03:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:29,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 1513 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 08:03:29,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:03:29,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:29,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:29,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:30,122 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:03:30,123 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:03:30,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:30,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:30,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:30,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:30,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:32,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:03:32,887 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:03:32,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:03:32,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 30 [2019-09-10 08:03:32,902 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:03:32,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:03:32,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:03:32,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2019-09-10 08:03:32,904 INFO L87 Difference]: Start difference. First operand 71415 states and 96145 transitions. Second operand 21 states. [2019-09-10 08:03:34,610 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-09-10 08:03:34,784 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-09-10 08:03:35,766 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2019-09-10 08:03:35,929 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-10 08:03:36,116 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 08:03:36,292 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-10 08:03:36,459 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:03:36,606 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 08:03:37,050 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:03:37,345 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-10 08:03:37,575 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2019-09-10 08:03:37,830 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:03:38,054 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:03:38,213 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-10 08:03:38,359 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-09-10 08:03:38,592 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:03:38,775 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:03:38,935 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 08:03:39,133 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 08:03:39,320 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:03:39,485 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 08:03:39,672 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:03:39,832 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-10 08:03:40,134 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:03:40,386 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 50 [2019-09-10 08:03:40,592 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:03:40,784 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-09-10 08:03:41,001 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2019-09-10 08:03:41,157 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2019-09-10 08:03:41,404 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:03:41,643 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:03:41,893 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:03:42,062 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:03:42,234 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-09-10 08:03:42,412 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:03:42,558 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-09-10 08:03:43,649 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:03:43,951 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:03:44,163 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 08:03:44,514 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:03:44,712 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 08:03:44,947 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:03:45,130 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-10 08:03:45,643 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:03:45,851 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:03:46,034 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2019-09-10 08:03:46,202 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 08:03:46,429 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 08:03:46,612 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:03:46,816 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-10 08:03:47,007 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:03:47,180 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 08:03:47,355 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:03:47,569 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-10 08:03:47,799 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:03:48,021 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:03:48,213 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:03:48,421 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2019-09-10 08:03:48,607 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 08:03:48,811 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:03:49,052 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:03:49,732 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:03:50,026 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 08:03:50,251 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 08:03:50,424 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 08:03:50,656 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:03:50,866 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:03:51,083 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-10 08:03:51,296 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:03:51,524 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-09-10 08:03:51,706 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 08:03:51,939 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-09-10 08:03:52,139 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:03:52,302 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:03:52,499 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-09-10 08:03:53,543 WARN L188 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-10 08:03:53,725 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 08:03:53,923 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-10 08:03:54,066 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 08:03:54,221 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2019-09-10 08:03:54,409 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-10 08:03:54,607 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 08:03:54,783 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:03:55,035 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:03:55,244 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:03:55,469 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:03:55,643 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:03:55,893 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 08:03:56,099 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 50 [2019-09-10 08:03:56,280 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2019-09-10 08:03:56,474 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:03:56,729 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:03:56,952 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:03:57,170 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-09-10 08:03:57,362 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:03:57,569 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 50 [2019-09-10 08:03:57,729 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-09-10 08:03:57,919 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:03:58,082 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-10 08:03:58,261 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-10 08:03:58,434 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-10 08:03:58,676 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 08:03:58,850 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 08:03:59,105 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:03:59,300 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:03:59,473 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:03:59,629 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 08:03:59,861 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-10 08:04:00,113 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 08:04:00,358 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:04:00,528 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-09-10 08:04:00,732 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:04:00,974 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:04:01,229 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2019-09-10 08:04:01,476 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-09-10 08:04:01,694 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:04:01,856 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-10 08:04:02,021 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-10 08:04:02,276 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:04:02,484 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:04:02,806 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 08:04:02,977 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 08:04:03,131 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-10 08:04:03,428 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-10 08:04:03,766 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:04:03,948 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 08:04:04,155 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:04:04,513 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:04:04,757 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:04:04,941 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 08:04:05,160 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-09-10 08:04:05,421 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-10 08:04:05,636 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-10 08:04:05,886 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 08:04:06,105 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-10 08:04:06,284 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-10 08:04:06,498 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:04:06,689 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-09-10 08:04:06,917 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:04:07,145 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:04:07,463 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:04:07,654 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:04:07,846 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-10 08:04:08,020 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 08:04:08,181 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2019-09-10 08:04:08,509 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-10 08:04:08,725 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 08:04:09,032 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-10 08:04:09,209 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-09-10 08:04:09,427 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:04:09,658 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:04:09,819 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 43 [2019-09-10 08:04:10,010 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-09-10 08:04:10,184 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:04:10,408 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:04:10,612 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:04:10,852 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:04:11,049 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 51 [2019-09-10 08:04:11,300 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-09-10 08:04:11,504 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 08:04:11,750 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:04:11,925 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:04:12,094 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-10 08:04:12,266 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-09-10 08:04:12,531 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:04:12,720 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 08:04:12,887 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-09-10 08:04:13,075 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:04:13,569 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-10 08:04:13,733 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-09-10 08:04:13,938 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:04:14,124 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 08:04:14,378 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:04:14,613 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2019-09-10 08:04:14,912 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2019-09-10 08:04:15,111 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-09-10 08:04:15,267 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 42 [2019-09-10 08:04:15,489 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:04:15,733 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-10 08:04:16,010 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 08:04:16,204 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:04:16,364 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 08:04:16,548 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:04:16,738 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:04:16,955 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:04:17,141 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:04:17,295 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-10 08:04:17,486 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:04:17,700 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-10 08:04:17,899 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 08:04:18,092 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-10 08:04:18,264 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-10 08:04:18,615 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-09-10 08:04:18,814 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2019-09-10 08:04:19,061 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:04:19,273 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 08:04:19,471 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-09-10 08:04:19,668 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:04:19,902 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:04:20,126 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:04:20,360 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:04:20,538 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:04:20,729 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:04:20,944 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:04:21,191 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-10 08:04:21,355 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:04:21,595 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:04:21,924 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 08:04:22,078 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 08:04:22,276 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:04:22,480 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 08:04:22,724 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-09-10 08:04:22,959 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:04:23,158 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:04:23,357 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:04:23,527 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:04:23,722 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:04:23,919 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-10 08:04:24,113 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-09-10 08:04:24,307 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 08:04:24,542 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:04:24,735 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:04:25,110 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-10 08:04:25,329 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 08:04:25,831 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-10 08:04:26,179 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 51 [2019-09-10 08:04:26,388 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2019-09-10 08:04:26,627 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-09-10 08:04:26,875 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:04:27,065 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2019-09-10 08:04:27,368 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 44 [2019-09-10 08:04:27,613 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-09-10 08:04:28,083 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2019-09-10 08:04:30,045 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:04:30,190 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-10 08:04:30,482 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:04:30,643 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-10 08:04:31,289 WARN L188 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:04:31,512 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:04:31,835 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-09-10 08:04:32,003 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:04:32,167 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-10 08:04:32,348 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:04:32,580 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:04:32,797 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:04:32,990 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:04:33,154 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-10 08:04:33,518 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:04:33,681 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 08:04:33,890 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2019-09-10 08:04:34,042 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-09-10 08:04:34,207 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 08:04:34,521 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 08:04:34,748 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-09-10 08:04:34,934 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:04:35,118 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:04:35,317 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2019-09-10 08:04:35,515 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:04:35,807 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-09-10 08:04:36,006 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 08:04:36,197 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 08:04:36,453 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:04:36,726 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:04:36,907 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 08:04:37,116 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:04:37,360 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-09-10 08:04:37,569 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 08:04:37,720 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-10 08:04:38,034 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:04:38,353 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2019-09-10 08:04:38,716 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:04:38,921 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-10 08:04:39,109 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:04:39,279 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-09-10 08:04:39,911 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-09-10 08:04:40,121 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:04:40,304 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 43 [2019-09-10 08:04:40,497 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-09-10 08:04:40,701 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:04:40,918 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:04:41,101 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:04:41,303 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 50 [2019-09-10 08:04:41,565 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:04:42,110 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-09-10 08:04:42,375 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2019-09-10 08:04:52,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:52,402 INFO L93 Difference]: Finished difference Result 1581295 states and 2085328 transitions. [2019-09-10 08:04:52,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 327 states. [2019-09-10 08:04:52,403 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 153 [2019-09-10 08:04:52,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:54,663 INFO L225 Difference]: With dead ends: 1581295 [2019-09-10 08:04:54,663 INFO L226 Difference]: Without dead ends: 1581295 [2019-09-10 08:04:54,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 642 GetRequests, 245 SyntacticMatches, 44 SemanticMatches, 353 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52426 ImplicationChecksByTransitivity, 62.9s TimeCoverageRelationStatistics Valid=15646, Invalid=110024, Unknown=0, NotChecked=0, Total=125670 [2019-09-10 08:04:55,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581295 states. [2019-09-10 08:05:13,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581295 to 353907. [2019-09-10 08:05:13,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353907 states. [2019-09-10 08:05:14,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353907 states to 353907 states and 473441 transitions. [2019-09-10 08:05:14,038 INFO L78 Accepts]: Start accepts. Automaton has 353907 states and 473441 transitions. Word has length 153 [2019-09-10 08:05:14,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:14,038 INFO L475 AbstractCegarLoop]: Abstraction has 353907 states and 473441 transitions. [2019-09-10 08:05:14,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:05:14,038 INFO L276 IsEmpty]: Start isEmpty. Operand 353907 states and 473441 transitions. [2019-09-10 08:05:14,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 08:05:14,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:14,064 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 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:05:14,064 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:14,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:14,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1186931537, now seen corresponding path program 1 times [2019-09-10 08:05:14,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:14,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:14,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:14,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:14,065 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:14,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:14,146 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:14,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:14,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:05:14,147 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:14,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:05:14,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:05:14,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:05:14,148 INFO L87 Difference]: Start difference. First operand 353907 states and 473441 transitions. Second operand 3 states. [2019-09-10 08:05:19,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:19,937 INFO L93 Difference]: Finished difference Result 328089 states and 428370 transitions. [2019-09-10 08:05:19,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:05:19,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-09-10 08:05:19,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:20,332 INFO L225 Difference]: With dead ends: 328089 [2019-09-10 08:05:20,332 INFO L226 Difference]: Without dead ends: 328089 [2019-09-10 08:05:20,332 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 08:05:20,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328089 states. [2019-09-10 08:05:23,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328089 to 327347. [2019-09-10 08:05:23,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327347 states. [2019-09-10 08:05:23,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327347 states to 327347 states and 427481 transitions. [2019-09-10 08:05:23,598 INFO L78 Accepts]: Start accepts. Automaton has 327347 states and 427481 transitions. Word has length 153 [2019-09-10 08:05:23,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:23,598 INFO L475 AbstractCegarLoop]: Abstraction has 327347 states and 427481 transitions. [2019-09-10 08:05:23,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:05:23,598 INFO L276 IsEmpty]: Start isEmpty. Operand 327347 states and 427481 transitions. [2019-09-10 08:05:23,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 08:05:23,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:23,611 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, 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:05:23,612 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:23,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:23,612 INFO L82 PathProgramCache]: Analyzing trace with hash -646898186, now seen corresponding path program 1 times [2019-09-10 08:05:23,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:23,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:23,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:23,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:23,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:23,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:24,032 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:24,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:05:24,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:05:24,033 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 155 with the following transitions: [2019-09-10 08:05:24,033 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], [75], [78], [81], [84], [87], [90], [93], [96], [100], [103], [106], [110], [113], [116], [120], [123], [126], [130], [133], [136], [140], [143], [146], [149], [153], [156], [159], [163], [166], [170], [173], [176], [273], [313], [316], [319], [322], [397], [2269], [2271], [2274], [2279], [2282], [2286], [2299], [2301], [2379], [2382], [2385], [2388], [2445], [3287], [3290], [3291], [3293], [3373], [3376], [3379], [3382], [3423], [3852], [3855], [3889], [4083], [4086], [4090], [4093], [4096], [4100], [4102], [4105], [4110], [4112], [4115], [4120], [4123], [4129], [4131], [4134], [4149], [4151], [4153], [4156], [4171], [4173], [4175], [4178], [4193], [4195], [4197], [4200], [4203], [4208], [4211], [4217], [4220], [4223], [4226], [4234], [4236], [4239], [4242], [4250], [4252], [4255], [4258], [4266], [4268], [4271], [4274], [4282], [4284], [4287], [4290], [4298], [4344], [4345], [4349], [4350], [4351] [2019-09-10 08:05:24,036 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:05:24,036 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:05:24,086 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:05:25,488 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:05:25,488 INFO L272 AbstractInterpreter]: Visited 145 different actions 732 times. Merged at 58 different actions 516 times. Widened at 24 different actions 100 times. Performed 2605 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2605 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 59 fixpoints after 16 different actions. Largest state had 268 variables. [2019-09-10 08:05:25,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:25,489 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:05:25,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:05:25,489 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 08:05:25,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:25,503 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 08:05:25,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:25,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 1518 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 08:05:25,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:05:25,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:25,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:25,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:26,150 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 08:05:26,150 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:05:26,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:26,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:26,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:26,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:26,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:26,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:26,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:26,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:26,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:26,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:26,660 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 08:05:26,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:05:26,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 28 [2019-09-10 08:05:26,669 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:05:26,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:05:26,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:05:26,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:05:26,670 INFO L87 Difference]: Start difference. First operand 327347 states and 427481 transitions. Second operand 20 states. [2019-09-10 08:05:26,816 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-09-10 08:05:28,311 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-09-10 08:05:28,487 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-09-10 08:05:29,316 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 46 [2019-09-10 08:05:29,478 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-10 08:05:29,671 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-09-10 08:05:29,822 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-09-10 08:05:29,986 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:05:30,134 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 08:05:30,597 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:05:30,887 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-10 08:05:31,336 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 08:05:31,583 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:05:31,754 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-10 08:05:31,902 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-09-10 08:05:32,163 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:05:32,347 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:05:32,513 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-09-10 08:05:32,707 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-09-10 08:05:32,895 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:05:33,061 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-09-10 08:05:33,250 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:05:33,415 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-10 08:05:33,729 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-09-10 08:05:33,941 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-09-10 08:05:34,148 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:05:34,335 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-09-10 08:05:34,530 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-10 08:05:34,685 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 39 [2019-09-10 08:05:35,264 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:05:35,446 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 08:05:35,633 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 08:05:36,829 WARN L188 SmtUtils]: Spent 898.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-09-10 08:05:37,061 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:05:37,254 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 48 [2019-09-10 08:05:37,437 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:05:37,648 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 08:05:37,819 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:05:38,103 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-10 08:05:38,340 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-10 08:05:38,580 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2019-09-10 08:05:38,784 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:05:38,987 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-09-10 08:05:39,161 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 08:05:39,639 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-10 08:05:39,796 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-09-10 08:05:40,007 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:05:40,266 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-09-10 08:05:40,490 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-09-10 08:05:40,755 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-09-10 08:05:40,969 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-09-10 08:05:41,140 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 08:05:41,344 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:05:41,597 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-09-10 08:05:41,862 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-10 08:05:42,073 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 48 [2019-09-10 08:05:42,294 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-10 08:05:42,468 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-10 08:05:42,649 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 08:05:42,849 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:05:43,123 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:05:43,328 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 08:05:43,667 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 08:05:43,863 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-10 08:05:44,027 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-09-10 08:05:44,209 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 08:05:44,369 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-10 08:05:45,159 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-09-10 08:05:45,390 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-09-10 08:05:45,624 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:05:45,806 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-09-10 08:05:46,074 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-09-10 08:05:46,280 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-09-10 08:05:47,208 WARN L188 SmtUtils]: Spent 851.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-10 08:05:47,469 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-10 08:05:47,705 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:05:47,933 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-09-10 08:05:48,131 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-10 08:05:48,340 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:05:48,541 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:05:48,800 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:05:49,023 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-09-10 08:05:49,248 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-09-10 08:05:49,436 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-09-10 08:05:49,636 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 08:05:49,967 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 43 [2019-09-10 08:05:50,282 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2019-09-10 08:05:50,546 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2019-09-10 08:05:50,716 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 08:05:50,899 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 08:05:51,118 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:05:51,343 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:05:51,607 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-09-10 08:05:51,847 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-09-10 08:05:52,060 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2019-09-10 08:05:52,263 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2019-09-10 08:05:52,513 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:05:52,752 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:05:52,988 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:05:53,139 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 08:05:53,323 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:05:53,517 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:05:53,698 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:05:53,924 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-09-10 08:05:54,143 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-09-10 08:05:54,456 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-09-10 08:05:54,627 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-09-10 08:05:54,903 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:05:55,095 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:05:55,314 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:05:55,540 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2019-09-10 08:05:55,760 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2019-09-10 08:05:56,035 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 66 [2019-09-10 08:05:56,304 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 66 [2019-09-10 08:05:56,458 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 08:05:56,683 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:05:57,562 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:05:57,772 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-09-10 08:05:57,987 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-09-10 08:05:58,249 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-10 08:05:58,504 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-10 08:05:58,686 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:05:58,900 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:05:59,115 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:05:59,304 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-09-10 08:05:59,500 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:05:59,720 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:05:59,970 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2019-09-10 08:06:00,177 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:06:00,422 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-09-10 08:06:00,605 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:06:00,813 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-10 08:06:01,019 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2019-09-10 08:06:01,227 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-10 08:06:01,406 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-09-10 08:06:01,632 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:06:01,850 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:06:02,071 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-09-10 08:06:02,245 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2019-09-10 08:06:02,461 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-09-10 08:06:02,661 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:06:02,935 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2019-09-10 08:06:03,210 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:06:03,442 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:06:03,649 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-09-10 08:06:04,004 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2019-09-10 08:06:04,164 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 08:06:04,407 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:06:04,638 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:06:04,857 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-09-10 08:06:05,786 WARN L188 SmtUtils]: Spent 857.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2019-09-10 08:06:06,035 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:06:06,271 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:06:06,458 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2019-09-10 08:06:06,628 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2019-09-10 08:06:06,828 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:06:07,027 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:06:07,247 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:06:07,448 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:06:07,655 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:06:07,832 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-10 08:06:08,017 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-09-10 08:06:08,219 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-09-10 08:06:08,408 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 08:06:08,609 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 08:06:08,790 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-09-10 08:06:08,968 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2019-09-10 08:06:09,167 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:06:09,382 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-09-10 08:06:09,608 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2019-09-10 08:06:09,838 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:06:10,068 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:06:10,273 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:06:10,469 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 08:06:10,825 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 08:06:11,048 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 08:06:11,291 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 08:06:11,483 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-10 08:06:11,695 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-09-10 08:06:11,934 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:06:12,290 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:06:12,639 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 08:06:12,845 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-09-10 08:06:16,720 WARN L188 SmtUtils]: Spent 3.77 s on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-09-10 08:06:17,098 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:06:17,326 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 08:06:17,502 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 08:06:17,675 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-09-10 08:06:20,298 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:06:20,475 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:06:20,678 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:06:20,924 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:06:21,078 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-10 08:06:21,288 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:06:21,507 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:06:21,839 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:06:22,134 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-10 08:06:22,301 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:06:22,532 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:06:22,713 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-10 08:06:22,927 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:06:23,149 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:06:23,329 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:06:23,893 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:06:24,074 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-10 08:06:24,365 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:06:24,589 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 08:06:24,916 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:06:25,060 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-10 08:06:25,235 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:06:25,417 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-09-10 08:06:25,581 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 08:06:25,906 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 08:06:26,266 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:06:26,439 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-09-10 08:06:26,627 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:06:26,868 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:06:27,075 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 08:06:27,297 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:06:27,634 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-10 08:06:27,814 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:06:28,078 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 08:06:28,378 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:06:28,579 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:06:28,731 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-10 08:06:28,947 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:06:29,126 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-09-10 08:06:29,339 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-09-10 08:06:29,546 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-09-10 08:06:29,915 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-09-10 08:06:30,350 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:06:30,685 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2019-09-10 08:06:30,925 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:06:31,193 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:06:31,694 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:06:31,996 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-10 08:06:32,248 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:06:32,459 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:06:32,699 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:06:32,917 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:06:33,119 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:06:34,193 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:06:34,544 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:06:34,689 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-09-10 08:06:34,899 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:06:35,140 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:06:35,392 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:06:35,630 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:06:35,904 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:06:36,118 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:06:36,304 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-09-10 08:06:36,485 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-09-10 08:06:36,683 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 08:06:36,961 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:06:37,125 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-09-10 08:06:37,485 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:06:37,701 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:06:38,331 WARN L188 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:06:38,547 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:06:38,863 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:06:39,076 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:06:39,254 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-10 08:06:39,504 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:06:39,794 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:06:40,011 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:06:40,245 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:06:40,467 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:06:40,620 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 08:06:40,839 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-09-10 08:06:40,998 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 08:06:41,168 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 08:06:41,627 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:06:41,893 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2019-09-10 08:06:42,219 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2019-09-10 08:06:42,417 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:06:42,601 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 08:06:42,806 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:06:43,013 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:06:43,237 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-09-10 08:06:43,446 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-09-10 08:06:43,655 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-09-10 08:06:43,863 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 08:06:44,047 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:06:44,342 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:06:45,662 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-09-10 08:06:45,962 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 53 [2019-09-10 08:06:46,185 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 49 [2019-09-10 08:06:46,498 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-10 08:06:46,729 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 45 [2019-09-10 08:06:47,059 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-10 08:06:47,318 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:06:48,902 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:06:49,161 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:06:49,462 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:06:49,642 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:06:49,824 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-09-10 08:06:50,032 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:06:51,402 WARN L188 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:06:51,589 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:06:51,808 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:06:52,080 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2019-09-10 08:06:52,333 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:06:52,525 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 51 [2019-09-10 08:06:52,722 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:06:52,950 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-10 08:06:53,178 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:06:53,433 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-09-10 08:06:53,594 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2019-09-10 08:06:53,785 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-10 08:06:54,160 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2019-09-10 08:06:54,427 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-09-10 08:06:54,750 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 08:07:10,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:10,596 INFO L93 Difference]: Finished difference Result 3009365 states and 3871982 transitions. [2019-09-10 08:07:10,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 355 states. [2019-09-10 08:07:10,596 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 154 [2019-09-10 08:07:10,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:16,266 INFO L225 Difference]: With dead ends: 3009365 [2019-09-10 08:07:16,266 INFO L226 Difference]: Without dead ends: 3009365 [2019-09-10 08:07:16,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 291 SyntacticMatches, 2 SemanticMatches, 379 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60995 ImplicationChecksByTransitivity, 74.9s TimeCoverageRelationStatistics Valid=17905, Invalid=126875, Unknown=0, NotChecked=0, Total=144780 [2019-09-10 08:07:17,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3009365 states. [2019-09-10 08:07:56,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3009365 to 767875. [2019-09-10 08:07:56,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767875 states. [2019-09-10 08:07:57,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767875 states to 767875 states and 1005211 transitions. [2019-09-10 08:07:57,854 INFO L78 Accepts]: Start accepts. Automaton has 767875 states and 1005211 transitions. Word has length 154 [2019-09-10 08:07:57,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:57,854 INFO L475 AbstractCegarLoop]: Abstraction has 767875 states and 1005211 transitions. [2019-09-10 08:07:57,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 08:07:57,854 INFO L276 IsEmpty]: Start isEmpty. Operand 767875 states and 1005211 transitions. [2019-09-10 08:08:05,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 08:08:05,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:08:05,337 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, 1, 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:08:05,338 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:08:05,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:05,338 INFO L82 PathProgramCache]: Analyzing trace with hash 332171814, now seen corresponding path program 1 times [2019-09-10 08:08:05,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:08:05,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:05,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:05,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:05,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:08:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:05,485 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 08:08:05,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:08:05,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:08:05,486 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:08:05,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:08:05,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:08:05,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:08:05,486 INFO L87 Difference]: Start difference. First operand 767875 states and 1005211 transitions. Second operand 9 states. [2019-09-10 08:08:09,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:08:09,078 INFO L93 Difference]: Finished difference Result 1097411 states and 1433846 transitions. [2019-09-10 08:08:09,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 08:08:09,079 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 155 [2019-09-10 08:08:09,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:08:10,425 INFO L225 Difference]: With dead ends: 1097411 [2019-09-10 08:08:10,425 INFO L226 Difference]: Without dead ends: 1097411 [2019-09-10 08:08:10,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:08:18,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097411 states. [2019-09-10 08:08:36,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097411 to 767875. [2019-09-10 08:08:36,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767875 states. [2019-09-10 08:08:37,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767875 states to 767875 states and 1005203 transitions. [2019-09-10 08:08:37,408 INFO L78 Accepts]: Start accepts. Automaton has 767875 states and 1005203 transitions. Word has length 155 [2019-09-10 08:08:37,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:08:37,409 INFO L475 AbstractCegarLoop]: Abstraction has 767875 states and 1005203 transitions. [2019-09-10 08:08:37,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:08:37,409 INFO L276 IsEmpty]: Start isEmpty. Operand 767875 states and 1005203 transitions. [2019-09-10 08:08:37,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 08:08:37,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:08:37,446 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, 1, 1, 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:08:37,446 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:08:37,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:37,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1545212667, now seen corresponding path program 1 times [2019-09-10 08:08:37,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:08:37,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:37,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:37,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:37,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:08:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:39,764 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:08:39,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:08:39,765 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:08:39,765 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 157 with the following transitions: [2019-09-10 08:08:39,766 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], [75], [78], [81], [84], [87], [90], [93], [96], [100], [103], [106], [110], [113], [116], [120], [123], [126], [130], [133], [136], [140], [143], [146], [149], [153], [156], [159], [163], [166], [170], [173], [176], [273], [313], [316], [319], [322], [397], [2269], [2271], [2274], [2279], [2282], [2286], [2299], [2301], [2379], [2382], [2385], [2388], [2445], [3287], [3290], [3291], [3293], [3373], [3376], [3379], [3382], [3423], [3852], [3855], [3858], [3861], [3887], [4083], [4086], [4090], [4093], [4096], [4100], [4102], [4105], [4110], [4112], [4127], [4129], [4131], [4134], [4149], [4151], [4153], [4156], [4171], [4173], [4175], [4178], [4181], [4186], [4189], [4195], [4197], [4200], [4203], [4208], [4211], [4217], [4220], [4223], [4226], [4234], [4236], [4239], [4242], [4250], [4252], [4255], [4258], [4266], [4268], [4271], [4274], [4282], [4284], [4287], [4290], [4298], [4344], [4345], [4349], [4350], [4351] [2019-09-10 08:08:39,769 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:08:39,769 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:08:39,818 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:08:40,549 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:08:40,549 INFO L272 AbstractInterpreter]: Visited 147 different actions 860 times. Merged at 58 different actions 628 times. Widened at 23 different actions 125 times. Performed 2946 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2946 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 69 fixpoints after 17 different actions. Largest state had 268 variables. [2019-09-10 08:08:40,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:40,550 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:08:40,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:08:40,550 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 08:08:40,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:40,563 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:08:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:40,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 1520 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-10 08:08:40,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:08:41,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:41,432 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 08:08:41,433 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:08:41,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:42,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:42,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:42,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:44,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:44,920 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 08:08:45,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:08:45,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 29 [2019-09-10 08:08:45,558 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:08:45,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:08:45,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:08:45,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=720, Unknown=0, NotChecked=0, Total=812 [2019-09-10 08:08:45,559 INFO L87 Difference]: Start difference. First operand 767875 states and 1005203 transitions. Second operand 20 states. [2019-09-10 08:08:46,921 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-10 08:08:47,294 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-10 08:08:48,827 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 08:08:49,063 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 08:08:49,217 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 08:08:49,411 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 08:08:49,700 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-10 08:08:49,928 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 08:08:50,168 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-10 08:08:50,370 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:08:50,522 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 08:08:50,688 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 08:08:51,175 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:08:51,461 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:08:52,405 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-10 08:08:52,576 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 08:08:52,766 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:08:52,938 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 08:08:53,099 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:08:53,475 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-09-10 08:08:55,037 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 08:08:55,243 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-10 08:08:55,446 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 08:08:55,622 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:08:55,961 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-09-10 08:08:56,346 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 08:08:56,556 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 08:08:56,868 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2019-09-10 08:08:58,408 WARN L188 SmtUtils]: Spent 832.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 08:08:58,764 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-09-10 08:08:58,932 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 08:08:59,239 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-10 08:08:59,428 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 08:09:00,176 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-10 08:09:00,338 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 08:09:01,067 WARN L188 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:09:01,498 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 08:09:02,090 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 08:09:02,321 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:09:02,690 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2019-09-10 08:09:04,982 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-10 08:09:05,206 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 08:09:05,406 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:09:05,597 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 08:09:05,842 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 08:09:06,029 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:09:06,185 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 08:09:06,416 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-09-10 08:09:06,731 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-09-10 08:09:06,922 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 08:09:07,177 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-09-10 08:09:07,429 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-10 08:09:07,652 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:09:07,822 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 08:09:08,017 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 08:09:08,192 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-10 08:09:08,381 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:09:08,561 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:09:08,721 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 08:09:09,165 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2019-09-10 08:09:09,556 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2019-09-10 08:09:09,796 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-09-10 08:09:10,019 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-10 08:09:10,241 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-10 08:09:10,430 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:09:10,618 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:09:10,862 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-09-10 08:09:11,113 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-09-10 08:09:12,057 WARN L188 SmtUtils]: Spent 691.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 08:09:12,267 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:09:12,488 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-10 08:09:12,700 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:09:12,903 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:09:13,104 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 08:09:13,717 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-09-10 08:09:13,990 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 08:09:14,219 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 08:09:14,382 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-10 08:09:14,555 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 08:09:16,051 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-10 08:09:16,329 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 08:09:16,555 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-10 08:09:19,081 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 08:09:28,386 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-09-10 08:09:28,671 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-10 08:09:29,217 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-10 08:09:29,461 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 08:09:29,718 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-10 08:09:29,910 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:09:30,137 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:09:30,375 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-09-10 08:09:30,591 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:09:30,790 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 08:09:31,009 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:09:31,218 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 08:09:31,433 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 08:09:31,670 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 08:09:31,858 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:09:32,024 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:09:32,997 WARN L188 SmtUtils]: Spent 913.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 08:09:33,173 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 08:09:33,578 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 08:09:33,786 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 08:09:33,966 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-10 08:09:34,157 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:09:34,482 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:09:35,002 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 08:09:35,171 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-10 08:09:35,366 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 08:09:35,585 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 08:09:35,985 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-10 08:09:36,226 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 08:09:36,794 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-10 08:09:37,002 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-09-10 08:09:37,198 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 08:09:37,410 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 08:09:37,639 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-10 08:09:37,836 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:09:38,156 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-10 08:09:38,354 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-10 08:09:38,769 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 08:09:39,089 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 08:09:39,326 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 08:09:39,546 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:09:40,777 WARN L188 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-10 08:09:41,295 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-09-10 08:09:41,565 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-10 08:09:41,817 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-10 08:09:42,078 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-10 08:09:42,308 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 08:09:42,574 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-10 08:09:42,791 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:09:43,010 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:09:43,273 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 08:09:43,789 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 08:09:44,049 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 08:09:44,283 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-10 08:09:44,491 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 08:09:44,768 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 08:09:44,956 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 08:09:46,012 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 08:09:46,246 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 08:09:46,531 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-10 08:09:46,988 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 08:09:47,162 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 08:09:47,571 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 08:09:47,863 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 08:09:48,102 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 08:09:48,366 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-10 08:09:48,542 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-10 08:09:48,686 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-10 08:09:48,997 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-10 08:09:49,209 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 08:09:49,562 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-09-10 08:09:51,088 WARN L188 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 08:09:51,344 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-10 08:09:51,522 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 08:09:51,721 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 08:09:51,998 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:09:52,370 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:09:52,579 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:09:52,831 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 08:09:53,133 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-09-10 08:09:53,369 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 08:10:10,173 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-10 08:10:10,682 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-10 08:10:11,131 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-10 08:10:11,319 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 08:10:11,601 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 08:10:15,851 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-09-10 08:10:16,599 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2019-09-10 08:10:16,947 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:10:17,384 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-10 08:10:17,680 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-09-10 08:10:20,363 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-09-10 08:10:21,243 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-09-10 08:10:21,477 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:10:23,023 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 08:10:23,329 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:10:23,624 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 08:10:23,894 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-09-10 08:10:24,107 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:10:24,441 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 08:10:24,945 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 08:10:25,174 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 08:10:25,425 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:10:25,723 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 08:10:25,996 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:10:26,224 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 08:10:26,981 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-09-10 08:10:27,242 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-10 08:10:27,481 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-10 08:10:27,737 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 08:10:28,139 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 08:10:28,646 WARN L188 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 08:10:28,952 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 08:10:29,646 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-09-10 08:10:29,919 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-10 08:11:23,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:23,659 INFO L93 Difference]: Finished difference Result 7913371 states and 10205702 transitions. [2019-09-10 08:11:23,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 229 states. [2019-09-10 08:11:23,659 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 156 [2019-09-10 08:11:23,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted.