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.6.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:14:04,231 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:14:04,233 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:14:04,246 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:14:04,246 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:14:04,248 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:14:04,250 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:14:04,255 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:14:04,256 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:14:04,258 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:14:04,259 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:14:04,260 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:14:04,260 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:14:04,263 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:14:04,264 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:14:04,265 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:14:04,266 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:14:04,267 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:14:04,270 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:14:04,274 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:14:04,278 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:14:04,280 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:14:04,282 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:14:04,284 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:14:04,287 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:14:04,287 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:14:04,287 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:14:04,288 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:14:04,289 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:14:04,290 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:14:04,290 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:14:04,293 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:14:04,293 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:14:04,294 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:14:04,295 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:14:04,295 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:14:04,296 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:14:04,296 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:14:04,296 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:14:04,298 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:14:04,299 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:14:04,300 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:14:04,326 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:14:04,326 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:14:04,327 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:14:04,327 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:14:04,328 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:14:04,328 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:14:04,328 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:14:04,329 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:14:04,329 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:14:04,329 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:14:04,331 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:14:04,331 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:14:04,332 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:14:04,332 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:14:04,332 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:14:04,332 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:14:04,333 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:14:04,333 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:14:04,333 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:14:04,333 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:14:04,334 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:14:04,334 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:14:04,334 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:14:04,334 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:14:04,335 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:14:04,335 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:14:04,335 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:14:04,335 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:14:04,335 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:14:04,335 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:14:04,387 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:14:04,403 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:14:04,408 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:14:04,409 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:14:04,410 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:14:04,410 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 08:14:04,476 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2393ba323/388d61ed269d4c2e9b8cbfa159d60245/FLAG5b7410491 [2019-09-10 08:14:05,328 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:14:05,329 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 08:14:05,367 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2393ba323/388d61ed269d4c2e9b8cbfa159d60245/FLAG5b7410491 [2019-09-10 08:14:05,792 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2393ba323/388d61ed269d4c2e9b8cbfa159d60245 [2019-09-10 08:14:05,801 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:14:05,802 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:14:05,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:14:05,804 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:14:05,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:14:05,808 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:14:05" (1/1) ... [2019-09-10 08:14:05,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@200f2ca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:14:05, skipping insertion in model container [2019-09-10 08:14:05,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:14:05" (1/1) ... [2019-09-10 08:14:05,817 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:14:06,065 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:14:07,906 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:14:07,934 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:14:08,836 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:14:08,878 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:14:08,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:14:08 WrapperNode [2019-09-10 08:14:08,879 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:14:08,880 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:14:08,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:14:08,880 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:14:08,895 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:14:08" (1/1) ... [2019-09-10 08:14:08,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:14:08" (1/1) ... [2019-09-10 08:14:08,975 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:14:08" (1/1) ... [2019-09-10 08:14:08,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:14:08" (1/1) ... [2019-09-10 08:14:09,066 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:14:08" (1/1) ... [2019-09-10 08:14:09,130 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:14:08" (1/1) ... [2019-09-10 08:14:09,162 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:14:08" (1/1) ... [2019-09-10 08:14:09,202 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:14:09,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:14:09,203 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:14:09,203 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:14:09,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:14:08" (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:14:09,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:14:09,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:14:09,268 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:14:09,268 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:14:09,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:14:09,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:14:09,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 08:14:09,269 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:14:09,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:14:09,270 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:14:09,270 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:14:09,270 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:14:09,270 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:14:09,271 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:14:09,272 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:14:09,272 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:14:09,273 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 08:14:09,273 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:14:09,273 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:14:09,273 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:14:09,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:14:09,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:14:14,874 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:14:14,875 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:14:14,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:14:14 BoogieIcfgContainer [2019-09-10 08:14:14,877 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:14:14,878 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:14:14,878 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:14:14,881 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:14:14,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:14:05" (1/3) ... [2019-09-10 08:14:14,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@197067f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:14:14, skipping insertion in model container [2019-09-10 08:14:14,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:14:08" (2/3) ... [2019-09-10 08:14:14,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@197067f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:14:14, skipping insertion in model container [2019-09-10 08:14:14,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:14:14" (3/3) ... [2019-09-10 08:14:14,885 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 08:14:14,894 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:14:14,921 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 22 error locations. [2019-09-10 08:14:14,937 INFO L252 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2019-09-10 08:14:14,963 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:14:14,963 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:14:14,963 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:14:14,963 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:14:14,963 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:14:14,963 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:14:14,964 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:14:14,964 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:14:15,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2353 states. [2019-09-10 08:14:15,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 08:14:15,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:15,063 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] [2019-09-10 08:14:15,065 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:15,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:15,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1894963753, now seen corresponding path program 1 times [2019-09-10 08:14:15,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:15,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:15,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:15,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:15,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:15,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:15,792 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:14:15,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:15,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:14:15,795 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:15,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:14:15,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:14:15,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:14:15,821 INFO L87 Difference]: Start difference. First operand 2353 states. Second operand 5 states. [2019-09-10 08:14:18,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:18,209 INFO L93 Difference]: Finished difference Result 1759 states and 3081 transitions. [2019-09-10 08:14:18,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:14:18,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-10 08:14:18,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:18,246 INFO L225 Difference]: With dead ends: 1759 [2019-09-10 08:14:18,247 INFO L226 Difference]: Without dead ends: 1747 [2019-09-10 08:14:18,250 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:14:18,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1747 states. [2019-09-10 08:14:18,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1747 to 1747. [2019-09-10 08:14:18,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1747 states. [2019-09-10 08:14:18,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1747 states to 1747 states and 2288 transitions. [2019-09-10 08:14:18,412 INFO L78 Accepts]: Start accepts. Automaton has 1747 states and 2288 transitions. Word has length 90 [2019-09-10 08:14:18,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:18,412 INFO L475 AbstractCegarLoop]: Abstraction has 1747 states and 2288 transitions. [2019-09-10 08:14:18,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:14:18,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1747 states and 2288 transitions. [2019-09-10 08:14:18,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 08:14:18,419 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:18,419 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] [2019-09-10 08:14:18,420 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:18,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:18,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1518436791, now seen corresponding path program 1 times [2019-09-10 08:14:18,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:18,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:18,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:18,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:18,424 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:18,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:18,592 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:14:18,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:18,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:14:18,593 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:18,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:14:18,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:14:18,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:14:18,595 INFO L87 Difference]: Start difference. First operand 1747 states and 2288 transitions. Second operand 5 states. [2019-09-10 08:14:19,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:19,718 INFO L93 Difference]: Finished difference Result 1199 states and 1579 transitions. [2019-09-10 08:14:19,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:14:19,719 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-10 08:14:19,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:19,726 INFO L225 Difference]: With dead ends: 1199 [2019-09-10 08:14:19,726 INFO L226 Difference]: Without dead ends: 1199 [2019-09-10 08:14:19,727 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:14:19,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2019-09-10 08:14:19,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 1199. [2019-09-10 08:14:19,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1199 states. [2019-09-10 08:14:19,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1579 transitions. [2019-09-10 08:14:19,752 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1579 transitions. Word has length 90 [2019-09-10 08:14:19,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:19,753 INFO L475 AbstractCegarLoop]: Abstraction has 1199 states and 1579 transitions. [2019-09-10 08:14:19,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:14:19,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1579 transitions. [2019-09-10 08:14:19,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 08:14:19,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:19,757 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] [2019-09-10 08:14:19,758 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:19,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:19,758 INFO L82 PathProgramCache]: Analyzing trace with hash 487198845, now seen corresponding path program 1 times [2019-09-10 08:14:19,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:19,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:19,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:19,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:19,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:19,907 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:14:19,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:19,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:14:19,908 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:19,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:14:19,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:14:19,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:14:19,913 INFO L87 Difference]: Start difference. First operand 1199 states and 1579 transitions. Second operand 5 states. [2019-09-10 08:14:21,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:21,562 INFO L93 Difference]: Finished difference Result 1600 states and 2146 transitions. [2019-09-10 08:14:21,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:14:21,563 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-10 08:14:21,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:21,571 INFO L225 Difference]: With dead ends: 1600 [2019-09-10 08:14:21,571 INFO L226 Difference]: Without dead ends: 1600 [2019-09-10 08:14:21,571 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:14:21,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2019-09-10 08:14:21,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1486. [2019-09-10 08:14:21,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1486 states. [2019-09-10 08:14:21,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 2042 transitions. [2019-09-10 08:14:21,609 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 2042 transitions. Word has length 90 [2019-09-10 08:14:21,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:21,609 INFO L475 AbstractCegarLoop]: Abstraction has 1486 states and 2042 transitions. [2019-09-10 08:14:21,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:14:21,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 2042 transitions. [2019-09-10 08:14:21,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 08:14:21,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:21,614 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] [2019-09-10 08:14:21,614 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:21,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:21,615 INFO L82 PathProgramCache]: Analyzing trace with hash -611229365, now seen corresponding path program 1 times [2019-09-10 08:14:21,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:21,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:21,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:21,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:21,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:21,799 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:14:21,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:21,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:14:21,800 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:21,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:14:21,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:14:21,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:14:21,801 INFO L87 Difference]: Start difference. First operand 1486 states and 2042 transitions. Second operand 5 states. [2019-09-10 08:14:22,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:22,572 INFO L93 Difference]: Finished difference Result 1026 states and 1411 transitions. [2019-09-10 08:14:22,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:14:22,573 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-10 08:14:22,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:22,579 INFO L225 Difference]: With dead ends: 1026 [2019-09-10 08:14:22,579 INFO L226 Difference]: Without dead ends: 1026 [2019-09-10 08:14:22,580 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:14:22,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2019-09-10 08:14:22,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1026. [2019-09-10 08:14:22,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1026 states. [2019-09-10 08:14:22,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1411 transitions. [2019-09-10 08:14:22,610 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1411 transitions. Word has length 91 [2019-09-10 08:14:22,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:22,611 INFO L475 AbstractCegarLoop]: Abstraction has 1026 states and 1411 transitions. [2019-09-10 08:14:22,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:14:22,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1411 transitions. [2019-09-10 08:14:22,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 08:14:22,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:22,616 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] [2019-09-10 08:14:22,617 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:22,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:22,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1651376349, now seen corresponding path program 1 times [2019-09-10 08:14:22,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:22,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:22,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:22,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:22,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:22,775 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:14:22,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:22,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:14:22,776 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:22,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:14:22,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:14:22,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:14:22,777 INFO L87 Difference]: Start difference. First operand 1026 states and 1411 transitions. Second operand 5 states. [2019-09-10 08:14:23,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:23,313 INFO L93 Difference]: Finished difference Result 917 states and 1268 transitions. [2019-09-10 08:14:23,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:14:23,314 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-09-10 08:14:23,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:23,320 INFO L225 Difference]: With dead ends: 917 [2019-09-10 08:14:23,321 INFO L226 Difference]: Without dead ends: 917 [2019-09-10 08:14:23,321 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:14:23,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2019-09-10 08:14:23,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 917. [2019-09-10 08:14:23,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 917 states. [2019-09-10 08:14:23,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1268 transitions. [2019-09-10 08:14:23,344 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1268 transitions. Word has length 92 [2019-09-10 08:14:23,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:23,345 INFO L475 AbstractCegarLoop]: Abstraction has 917 states and 1268 transitions. [2019-09-10 08:14:23,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:14:23,346 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1268 transitions. [2019-09-10 08:14:23,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 08:14:23,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:23,349 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] [2019-09-10 08:14:23,350 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:23,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:23,351 INFO L82 PathProgramCache]: Analyzing trace with hash 620980430, now seen corresponding path program 1 times [2019-09-10 08:14:23,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:23,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:23,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:23,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:23,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:23,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:23,510 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:14:23,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:23,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:14:23,511 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:23,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:14:23,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:14:23,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:14:23,513 INFO L87 Difference]: Start difference. First operand 917 states and 1268 transitions. Second operand 5 states. [2019-09-10 08:14:24,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:24,165 INFO L93 Difference]: Finished difference Result 909 states and 1257 transitions. [2019-09-10 08:14:24,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:14:24,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-10 08:14:24,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:24,171 INFO L225 Difference]: With dead ends: 909 [2019-09-10 08:14:24,171 INFO L226 Difference]: Without dead ends: 909 [2019-09-10 08:14:24,172 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:14:24,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-09-10 08:14:24,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 909. [2019-09-10 08:14:24,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:14:24,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1257 transitions. [2019-09-10 08:14:24,189 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1257 transitions. Word has length 93 [2019-09-10 08:14:24,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:24,190 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1257 transitions. [2019-09-10 08:14:24,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:14:24,190 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1257 transitions. [2019-09-10 08:14:24,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 08:14:24,192 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:24,193 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] [2019-09-10 08:14:24,193 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:24,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:24,194 INFO L82 PathProgramCache]: Analyzing trace with hash 574019279, now seen corresponding path program 1 times [2019-09-10 08:14:24,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:24,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:24,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:24,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:24,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:24,413 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:14:24,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:24,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:24,414 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:24,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:24,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:24,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:24,415 INFO L87 Difference]: Start difference. First operand 909 states and 1257 transitions. Second operand 9 states. [2019-09-10 08:14:26,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:26,642 INFO L93 Difference]: Finished difference Result 1730 states and 2435 transitions. [2019-09-10 08:14:26,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:26,643 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-09-10 08:14:26,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:26,651 INFO L225 Difference]: With dead ends: 1730 [2019-09-10 08:14:26,652 INFO L226 Difference]: Without dead ends: 1730 [2019-09-10 08:14:26,652 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:14:26,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2019-09-10 08:14:26,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 909. [2019-09-10 08:14:26,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:14:26,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1256 transitions. [2019-09-10 08:14:26,678 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1256 transitions. Word has length 94 [2019-09-10 08:14:26,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:26,678 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1256 transitions. [2019-09-10 08:14:26,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:26,678 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1256 transitions. [2019-09-10 08:14:26,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 08:14:26,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:26,681 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] [2019-09-10 08:14:26,682 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:26,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:26,682 INFO L82 PathProgramCache]: Analyzing trace with hash -2033100651, now seen corresponding path program 1 times [2019-09-10 08:14:26,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:26,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:26,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:26,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:26,684 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:26,912 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:14:26,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:26,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:26,913 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:26,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:26,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:26,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:26,915 INFO L87 Difference]: Start difference. First operand 909 states and 1256 transitions. Second operand 9 states. [2019-09-10 08:14:29,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:29,278 INFO L93 Difference]: Finished difference Result 1633 states and 2283 transitions. [2019-09-10 08:14:29,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:14:29,278 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-09-10 08:14:29,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:29,284 INFO L225 Difference]: With dead ends: 1633 [2019-09-10 08:14:29,284 INFO L226 Difference]: Without dead ends: 1633 [2019-09-10 08:14:29,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:14:29,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2019-09-10 08:14:29,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 909. [2019-09-10 08:14:29,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:14:29,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1255 transitions. [2019-09-10 08:14:29,309 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1255 transitions. Word has length 94 [2019-09-10 08:14:29,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:29,310 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1255 transitions. [2019-09-10 08:14:29,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:29,310 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1255 transitions. [2019-09-10 08:14:29,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 08:14:29,312 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:29,313 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] [2019-09-10 08:14:29,313 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:29,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:29,314 INFO L82 PathProgramCache]: Analyzing trace with hash -518152584, now seen corresponding path program 1 times [2019-09-10 08:14:29,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:29,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:29,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:29,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:29,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:29,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:29,575 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:14:29,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:29,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:14:29,576 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:29,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:14:29,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:14:29,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:14:29,577 INFO L87 Difference]: Start difference. First operand 909 states and 1255 transitions. Second operand 8 states. [2019-09-10 08:14:31,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:31,032 INFO L93 Difference]: Finished difference Result 1230 states and 1643 transitions. [2019-09-10 08:14:31,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:14:31,033 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-09-10 08:14:31,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:31,039 INFO L225 Difference]: With dead ends: 1230 [2019-09-10 08:14:31,039 INFO L226 Difference]: Without dead ends: 1230 [2019-09-10 08:14:31,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:14:31,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2019-09-10 08:14:31,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 909. [2019-09-10 08:14:31,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:14:31,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1254 transitions. [2019-09-10 08:14:31,058 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1254 transitions. Word has length 94 [2019-09-10 08:14:31,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:31,058 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1254 transitions. [2019-09-10 08:14:31,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:14:31,058 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1254 transitions. [2019-09-10 08:14:31,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 08:14:31,061 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:31,061 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] [2019-09-10 08:14:31,062 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:31,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:31,062 INFO L82 PathProgramCache]: Analyzing trace with hash 103072893, now seen corresponding path program 1 times [2019-09-10 08:14:31,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:31,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:31,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:31,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:31,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:31,240 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:14:31,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:31,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:31,241 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:31,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:31,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:31,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:31,244 INFO L87 Difference]: Start difference. First operand 909 states and 1254 transitions. Second operand 9 states. [2019-09-10 08:14:33,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:33,556 INFO L93 Difference]: Finished difference Result 1703 states and 2385 transitions. [2019-09-10 08:14:33,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:33,557 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-10 08:14:33,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:33,565 INFO L225 Difference]: With dead ends: 1703 [2019-09-10 08:14:33,566 INFO L226 Difference]: Without dead ends: 1703 [2019-09-10 08:14:33,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:14:33,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2019-09-10 08:14:33,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 909. [2019-09-10 08:14:33,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:14:33,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1252 transitions. [2019-09-10 08:14:33,594 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1252 transitions. Word has length 96 [2019-09-10 08:14:33,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:33,595 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1252 transitions. [2019-09-10 08:14:33,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:33,595 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1252 transitions. [2019-09-10 08:14:33,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 08:14:33,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:33,620 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] [2019-09-10 08:14:33,621 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:33,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:33,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1545982347, now seen corresponding path program 1 times [2019-09-10 08:14:33,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:33,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:33,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:33,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:33,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:33,848 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:14:33,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:33,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:33,849 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:33,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:33,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:33,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:33,850 INFO L87 Difference]: Start difference. First operand 909 states and 1252 transitions. Second operand 9 states. [2019-09-10 08:14:35,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:35,944 INFO L93 Difference]: Finished difference Result 1730 states and 2429 transitions. [2019-09-10 08:14:35,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:35,945 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-10 08:14:35,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:35,953 INFO L225 Difference]: With dead ends: 1730 [2019-09-10 08:14:35,953 INFO L226 Difference]: Without dead ends: 1730 [2019-09-10 08:14:35,954 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:14:35,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2019-09-10 08:14:35,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 909. [2019-09-10 08:14:35,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:14:35,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1250 transitions. [2019-09-10 08:14:35,975 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1250 transitions. Word has length 96 [2019-09-10 08:14:35,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:35,976 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1250 transitions. [2019-09-10 08:14:35,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:35,976 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1250 transitions. [2019-09-10 08:14:35,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 08:14:35,978 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:35,978 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] [2019-09-10 08:14:35,979 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:35,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:35,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1428928273, now seen corresponding path program 1 times [2019-09-10 08:14:35,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:35,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:35,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:35,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:35,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:36,177 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:14:36,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:36,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:36,177 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:36,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:36,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:36,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:36,179 INFO L87 Difference]: Start difference. First operand 909 states and 1250 transitions. Second operand 9 states. [2019-09-10 08:14:38,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:38,170 INFO L93 Difference]: Finished difference Result 1286 states and 1809 transitions. [2019-09-10 08:14:38,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:14:38,170 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-10 08:14:38,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:38,176 INFO L225 Difference]: With dead ends: 1286 [2019-09-10 08:14:38,176 INFO L226 Difference]: Without dead ends: 1286 [2019-09-10 08:14:38,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:14:38,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2019-09-10 08:14:38,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 909. [2019-09-10 08:14:38,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:14:38,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1248 transitions. [2019-09-10 08:14:38,195 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1248 transitions. Word has length 96 [2019-09-10 08:14:38,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:38,196 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1248 transitions. [2019-09-10 08:14:38,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:38,196 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1248 transitions. [2019-09-10 08:14:38,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 08:14:38,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:38,198 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] [2019-09-10 08:14:38,199 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:38,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:38,199 INFO L82 PathProgramCache]: Analyzing trace with hash -2085599014, now seen corresponding path program 1 times [2019-09-10 08:14:38,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:38,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:38,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:38,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:38,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:38,375 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:14:38,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:38,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:38,376 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:38,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:38,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:38,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:38,377 INFO L87 Difference]: Start difference. First operand 909 states and 1248 transitions. Second operand 9 states. [2019-09-10 08:14:40,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:40,664 INFO L93 Difference]: Finished difference Result 1703 states and 2380 transitions. [2019-09-10 08:14:40,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:40,665 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-10 08:14:40,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:40,673 INFO L225 Difference]: With dead ends: 1703 [2019-09-10 08:14:40,673 INFO L226 Difference]: Without dead ends: 1703 [2019-09-10 08:14:40,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:14:40,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2019-09-10 08:14:40,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 909. [2019-09-10 08:14:40,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:14:40,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1247 transitions. [2019-09-10 08:14:40,692 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1247 transitions. Word has length 96 [2019-09-10 08:14:40,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:40,693 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1247 transitions. [2019-09-10 08:14:40,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:40,693 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1247 transitions. [2019-09-10 08:14:40,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 08:14:40,695 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:40,696 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] [2019-09-10 08:14:40,696 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:40,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:40,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1937383278, now seen corresponding path program 1 times [2019-09-10 08:14:40,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:40,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:40,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:40,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:40,698 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:40,869 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:14:40,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:40,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:40,870 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:40,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:40,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:40,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:40,871 INFO L87 Difference]: Start difference. First operand 909 states and 1247 transitions. Second operand 9 states. [2019-09-10 08:14:43,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:43,373 INFO L93 Difference]: Finished difference Result 1730 states and 2423 transitions. [2019-09-10 08:14:43,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:43,374 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-10 08:14:43,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:43,380 INFO L225 Difference]: With dead ends: 1730 [2019-09-10 08:14:43,380 INFO L226 Difference]: Without dead ends: 1730 [2019-09-10 08:14:43,381 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:14:43,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2019-09-10 08:14:43,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 909. [2019-09-10 08:14:43,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:14:43,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1246 transitions. [2019-09-10 08:14:43,400 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1246 transitions. Word has length 96 [2019-09-10 08:14:43,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:43,400 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1246 transitions. [2019-09-10 08:14:43,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:43,400 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1246 transitions. [2019-09-10 08:14:43,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 08:14:43,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:43,403 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] [2019-09-10 08:14:43,403 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:43,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:43,404 INFO L82 PathProgramCache]: Analyzing trace with hash -320032428, now seen corresponding path program 1 times [2019-09-10 08:14:43,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:43,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:43,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:43,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:43,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:43,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:43,600 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:14:43,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:43,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:43,601 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:43,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:43,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:43,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:43,602 INFO L87 Difference]: Start difference. First operand 909 states and 1246 transitions. Second operand 9 states. [2019-09-10 08:14:46,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:46,062 INFO L93 Difference]: Finished difference Result 1703 states and 2377 transitions. [2019-09-10 08:14:46,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:46,063 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-10 08:14:46,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:46,069 INFO L225 Difference]: With dead ends: 1703 [2019-09-10 08:14:46,070 INFO L226 Difference]: Without dead ends: 1703 [2019-09-10 08:14:46,070 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:14:46,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2019-09-10 08:14:46,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 909. [2019-09-10 08:14:46,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:14:46,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1245 transitions. [2019-09-10 08:14:46,087 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1245 transitions. Word has length 96 [2019-09-10 08:14:46,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:46,088 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1245 transitions. [2019-09-10 08:14:46,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:46,088 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1245 transitions. [2019-09-10 08:14:46,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 08:14:46,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:46,090 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] [2019-09-10 08:14:46,091 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:46,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:46,091 INFO L82 PathProgramCache]: Analyzing trace with hash -891007590, now seen corresponding path program 1 times [2019-09-10 08:14:46,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:46,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:46,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:46,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:46,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:46,264 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:14:46,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:46,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:46,267 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:46,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:46,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:46,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:46,268 INFO L87 Difference]: Start difference. First operand 909 states and 1245 transitions. Second operand 9 states. [2019-09-10 08:14:48,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:48,591 INFO L93 Difference]: Finished difference Result 1703 states and 2376 transitions. [2019-09-10 08:14:48,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:48,592 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-10 08:14:48,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:48,599 INFO L225 Difference]: With dead ends: 1703 [2019-09-10 08:14:48,599 INFO L226 Difference]: Without dead ends: 1703 [2019-09-10 08:14:48,600 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:14:48,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2019-09-10 08:14:48,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 909. [2019-09-10 08:14:48,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:14:48,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1244 transitions. [2019-09-10 08:14:48,618 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1244 transitions. Word has length 96 [2019-09-10 08:14:48,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:48,618 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1244 transitions. [2019-09-10 08:14:48,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:48,618 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1244 transitions. [2019-09-10 08:14:48,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:14:48,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:48,621 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:48,622 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:48,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:48,622 INFO L82 PathProgramCache]: Analyzing trace with hash -354416756, now seen corresponding path program 1 times [2019-09-10 08:14:48,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:48,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:48,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:48,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:48,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:48,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:14:48,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:48,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:48,811 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:48,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:48,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:48,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:48,812 INFO L87 Difference]: Start difference. First operand 909 states and 1244 transitions. Second operand 9 states. [2019-09-10 08:14:51,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:51,103 INFO L93 Difference]: Finished difference Result 1703 states and 2374 transitions. [2019-09-10 08:14:51,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:51,103 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:14:51,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:51,111 INFO L225 Difference]: With dead ends: 1703 [2019-09-10 08:14:51,111 INFO L226 Difference]: Without dead ends: 1703 [2019-09-10 08:14:51,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:14:51,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2019-09-10 08:14:51,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 909. [2019-09-10 08:14:51,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:14:51,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1242 transitions. [2019-09-10 08:14:51,129 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1242 transitions. Word has length 98 [2019-09-10 08:14:51,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:51,129 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1242 transitions. [2019-09-10 08:14:51,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:51,129 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1242 transitions. [2019-09-10 08:14:51,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:14:51,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:51,132 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:51,132 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:51,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:51,133 INFO L82 PathProgramCache]: Analyzing trace with hash 350263078, now seen corresponding path program 1 times [2019-09-10 08:14:51,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:51,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:51,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:51,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:51,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:51,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:51,317 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:14:51,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:51,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:51,318 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:51,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:51,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:51,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:51,319 INFO L87 Difference]: Start difference. First operand 909 states and 1242 transitions. Second operand 9 states. [2019-09-10 08:14:53,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:53,629 INFO L93 Difference]: Finished difference Result 1679 states and 2331 transitions. [2019-09-10 08:14:53,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:53,629 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:14:53,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:53,635 INFO L225 Difference]: With dead ends: 1679 [2019-09-10 08:14:53,635 INFO L226 Difference]: Without dead ends: 1679 [2019-09-10 08:14:53,636 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:14:53,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2019-09-10 08:14:53,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 909. [2019-09-10 08:14:53,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:14:53,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1240 transitions. [2019-09-10 08:14:53,652 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1240 transitions. Word has length 98 [2019-09-10 08:14:53,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:53,653 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1240 transitions. [2019-09-10 08:14:53,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:53,653 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1240 transitions. [2019-09-10 08:14:53,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:14:53,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:53,655 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:53,656 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:53,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:53,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1857278271, now seen corresponding path program 1 times [2019-09-10 08:14:53,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:53,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:53,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:53,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:53,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:53,821 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:14:53,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:53,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:53,821 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:53,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:53,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:53,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:53,822 INFO L87 Difference]: Start difference. First operand 909 states and 1240 transitions. Second operand 9 states. [2019-09-10 08:14:56,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:56,280 INFO L93 Difference]: Finished difference Result 1730 states and 2409 transitions. [2019-09-10 08:14:56,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:56,281 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:14:56,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:56,285 INFO L225 Difference]: With dead ends: 1730 [2019-09-10 08:14:56,285 INFO L226 Difference]: Without dead ends: 1730 [2019-09-10 08:14:56,286 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:14:56,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2019-09-10 08:14:56,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 909. [2019-09-10 08:14:56,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:14:56,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1238 transitions. [2019-09-10 08:14:56,302 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1238 transitions. Word has length 98 [2019-09-10 08:14:56,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:56,302 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1238 transitions. [2019-09-10 08:14:56,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:56,303 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1238 transitions. [2019-09-10 08:14:56,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:14:56,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:56,305 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:56,306 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:56,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:56,306 INFO L82 PathProgramCache]: Analyzing trace with hash 647290032, now seen corresponding path program 1 times [2019-09-10 08:14:56,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:56,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:56,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:56,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:56,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:56,481 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:14:56,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:56,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:56,482 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:56,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:56,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:56,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:56,483 INFO L87 Difference]: Start difference. First operand 909 states and 1238 transitions. Second operand 9 states. [2019-09-10 08:14:58,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:58,749 INFO L93 Difference]: Finished difference Result 1679 states and 2327 transitions. [2019-09-10 08:14:58,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:58,749 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:14:58,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:58,754 INFO L225 Difference]: With dead ends: 1679 [2019-09-10 08:14:58,754 INFO L226 Difference]: Without dead ends: 1679 [2019-09-10 08:14:58,754 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:14:58,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2019-09-10 08:14:58,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 909. [2019-09-10 08:14:58,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:14:58,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1236 transitions. [2019-09-10 08:14:58,769 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1236 transitions. Word has length 98 [2019-09-10 08:14:58,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:58,770 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1236 transitions. [2019-09-10 08:14:58,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:14:58,770 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1236 transitions. [2019-09-10 08:14:58,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:14:58,772 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:58,772 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:58,772 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:58,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:58,773 INFO L82 PathProgramCache]: Analyzing trace with hash -427429475, now seen corresponding path program 1 times [2019-09-10 08:14:58,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:58,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:58,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:58,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:58,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:58,989 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:14:58,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:58,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:14:58,990 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:58,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:14:58,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:14:58,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:14:58,991 INFO L87 Difference]: Start difference. First operand 909 states and 1236 transitions. Second operand 9 states. [2019-09-10 08:15:01,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:01,470 INFO L93 Difference]: Finished difference Result 1703 states and 2362 transitions. [2019-09-10 08:15:01,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:15:01,470 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:15:01,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:01,475 INFO L225 Difference]: With dead ends: 1703 [2019-09-10 08:15:01,475 INFO L226 Difference]: Without dead ends: 1703 [2019-09-10 08:15:01,476 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:15:01,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2019-09-10 08:15:01,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 909. [2019-09-10 08:15:01,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:15:01,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1234 transitions. [2019-09-10 08:15:01,487 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1234 transitions. Word has length 98 [2019-09-10 08:15:01,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:01,487 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1234 transitions. [2019-09-10 08:15:01,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:15:01,487 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1234 transitions. [2019-09-10 08:15:01,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:15:01,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:01,489 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:01,490 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:01,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:01,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1254444936, now seen corresponding path program 1 times [2019-09-10 08:15:01,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:01,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:01,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:01,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:01,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:01,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:01,654 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:15:01,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:01,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:15:01,655 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:01,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:15:01,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:15:01,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:15:01,657 INFO L87 Difference]: Start difference. First operand 909 states and 1234 transitions. Second operand 9 states. [2019-09-10 08:15:04,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:04,085 INFO L93 Difference]: Finished difference Result 1679 states and 2321 transitions. [2019-09-10 08:15:04,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:15:04,087 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:15:04,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:04,090 INFO L225 Difference]: With dead ends: 1679 [2019-09-10 08:15:04,090 INFO L226 Difference]: Without dead ends: 1679 [2019-09-10 08:15:04,091 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:15:04,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2019-09-10 08:15:04,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 909. [2019-09-10 08:15:04,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:15:04,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1232 transitions. [2019-09-10 08:15:04,105 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1232 transitions. Word has length 98 [2019-09-10 08:15:04,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:04,105 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1232 transitions. [2019-09-10 08:15:04,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:15:04,105 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1232 transitions. [2019-09-10 08:15:04,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:15:04,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:04,107 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:04,108 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:04,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:04,108 INFO L82 PathProgramCache]: Analyzing trace with hash 398268857, now seen corresponding path program 1 times [2019-09-10 08:15:04,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:04,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:04,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:04,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:04,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:04,293 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:15:04,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:04,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:15:04,294 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:04,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:15:04,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:15:04,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:15:04,295 INFO L87 Difference]: Start difference. First operand 909 states and 1232 transitions. Second operand 9 states. [2019-09-10 08:15:06,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:06,595 INFO L93 Difference]: Finished difference Result 1679 states and 2319 transitions. [2019-09-10 08:15:06,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:15:06,596 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:15:06,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:06,600 INFO L225 Difference]: With dead ends: 1679 [2019-09-10 08:15:06,600 INFO L226 Difference]: Without dead ends: 1679 [2019-09-10 08:15:06,601 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:15:06,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2019-09-10 08:15:06,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 909. [2019-09-10 08:15:06,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:15:06,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1230 transitions. [2019-09-10 08:15:06,615 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1230 transitions. Word has length 98 [2019-09-10 08:15:06,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:06,616 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1230 transitions. [2019-09-10 08:15:06,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:15:06,616 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1230 transitions. [2019-09-10 08:15:06,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:15:06,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:06,618 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:06,619 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:06,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:06,619 INFO L82 PathProgramCache]: Analyzing trace with hash -285032083, now seen corresponding path program 1 times [2019-09-10 08:15:06,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:06,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:06,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:06,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:06,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:06,814 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:15:06,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:06,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:15:06,816 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:06,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:15:06,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:15:06,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:15:06,822 INFO L87 Difference]: Start difference. First operand 909 states and 1230 transitions. Second operand 9 states. [2019-09-10 08:15:09,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:09,158 INFO L93 Difference]: Finished difference Result 1679 states and 2318 transitions. [2019-09-10 08:15:09,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:15:09,159 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:15:09,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:09,163 INFO L225 Difference]: With dead ends: 1679 [2019-09-10 08:15:09,163 INFO L226 Difference]: Without dead ends: 1679 [2019-09-10 08:15:09,164 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:15:09,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2019-09-10 08:15:09,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 909. [2019-09-10 08:15:09,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:15:09,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1229 transitions. [2019-09-10 08:15:09,178 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1229 transitions. Word has length 98 [2019-09-10 08:15:09,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:09,178 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1229 transitions. [2019-09-10 08:15:09,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:15:09,179 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1229 transitions. [2019-09-10 08:15:09,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:15:09,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:09,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] [2019-09-10 08:15:09,181 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:09,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:09,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1992031926, now seen corresponding path program 1 times [2019-09-10 08:15:09,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:09,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:09,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:09,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:09,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:09,364 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:15:09,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:09,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:15:09,364 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:09,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:15:09,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:15:09,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:15:09,365 INFO L87 Difference]: Start difference. First operand 909 states and 1229 transitions. Second operand 9 states. [2019-09-10 08:15:11,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:11,836 INFO L93 Difference]: Finished difference Result 1703 states and 2354 transitions. [2019-09-10 08:15:11,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:15:11,836 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:15:11,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:11,841 INFO L225 Difference]: With dead ends: 1703 [2019-09-10 08:15:11,841 INFO L226 Difference]: Without dead ends: 1703 [2019-09-10 08:15:11,842 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:15:11,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2019-09-10 08:15:11,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 909. [2019-09-10 08:15:11,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:15:11,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1228 transitions. [2019-09-10 08:15:11,856 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1228 transitions. Word has length 98 [2019-09-10 08:15:11,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:11,856 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1228 transitions. [2019-09-10 08:15:11,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:15:11,856 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1228 transitions. [2019-09-10 08:15:11,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:15:11,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:11,858 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:11,858 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:11,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:11,859 INFO L82 PathProgramCache]: Analyzing trace with hash 310929269, now seen corresponding path program 1 times [2019-09-10 08:15:11,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:11,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:11,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:11,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:11,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:11,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:12,032 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:15:12,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:12,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:15:12,033 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:12,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:15:12,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:15:12,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:15:12,036 INFO L87 Difference]: Start difference. First operand 909 states and 1228 transitions. Second operand 9 states. [2019-09-10 08:15:14,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:14,292 INFO L93 Difference]: Finished difference Result 1679 states and 2315 transitions. [2019-09-10 08:15:14,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:15:14,292 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:15:14,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:14,296 INFO L225 Difference]: With dead ends: 1679 [2019-09-10 08:15:14,296 INFO L226 Difference]: Without dead ends: 1679 [2019-09-10 08:15:14,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:15:14,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2019-09-10 08:15:14,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 909. [2019-09-10 08:15:14,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:15:14,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1227 transitions. [2019-09-10 08:15:14,311 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1227 transitions. Word has length 98 [2019-09-10 08:15:14,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:14,311 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1227 transitions. [2019-09-10 08:15:14,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:15:14,311 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1227 transitions. [2019-09-10 08:15:14,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:15:14,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:14,313 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:14,313 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:14,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:14,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1777266353, now seen corresponding path program 1 times [2019-09-10 08:15:14,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:14,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:14,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:14,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:14,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:14,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:14,480 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:15:14,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:14,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:15:14,481 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:14,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:15:14,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:15:14,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:15:14,482 INFO L87 Difference]: Start difference. First operand 909 states and 1227 transitions. Second operand 9 states. [2019-09-10 08:15:16,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:16,804 INFO L93 Difference]: Finished difference Result 1679 states and 2314 transitions. [2019-09-10 08:15:16,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:15:16,804 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:15:16,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:16,807 INFO L225 Difference]: With dead ends: 1679 [2019-09-10 08:15:16,807 INFO L226 Difference]: Without dead ends: 1679 [2019-09-10 08:15:16,808 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:15:16,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2019-09-10 08:15:16,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 909. [2019-09-10 08:15:16,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:15:16,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1226 transitions. [2019-09-10 08:15:16,821 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1226 transitions. Word has length 98 [2019-09-10 08:15:16,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:16,822 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1226 transitions. [2019-09-10 08:15:16,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:15:16,822 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1226 transitions. [2019-09-10 08:15:16,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:15:16,823 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:16,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:16,824 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:16,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:16,824 INFO L82 PathProgramCache]: Analyzing trace with hash 2141043087, now seen corresponding path program 1 times [2019-09-10 08:15:16,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:16,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:16,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:16,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:16,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:17,009 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:15:17,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:17,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:15:17,010 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:17,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:15:17,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:15:17,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:15:17,011 INFO L87 Difference]: Start difference. First operand 909 states and 1226 transitions. Second operand 9 states. [2019-09-10 08:15:19,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:19,477 INFO L93 Difference]: Finished difference Result 1679 states and 2312 transitions. [2019-09-10 08:15:19,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:15:19,477 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:15:19,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:19,479 INFO L225 Difference]: With dead ends: 1679 [2019-09-10 08:15:19,480 INFO L226 Difference]: Without dead ends: 1679 [2019-09-10 08:15:19,480 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:15:19,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2019-09-10 08:15:19,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 909. [2019-09-10 08:15:19,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:15:19,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1225 transitions. [2019-09-10 08:15:19,493 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1225 transitions. Word has length 98 [2019-09-10 08:15:19,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:19,493 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1225 transitions. [2019-09-10 08:15:19,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:15:19,493 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1225 transitions. [2019-09-10 08:15:19,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:15:19,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:19,495 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:19,495 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:19,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:19,496 INFO L82 PathProgramCache]: Analyzing trace with hash 600616519, now seen corresponding path program 1 times [2019-09-10 08:15:19,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:19,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:19,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:19,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:19,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:19,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:19,656 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:15:19,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:19,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:15:19,657 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:19,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:15:19,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:15:19,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:15:19,658 INFO L87 Difference]: Start difference. First operand 909 states and 1225 transitions. Second operand 9 states. [2019-09-10 08:15:22,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:22,042 INFO L93 Difference]: Finished difference Result 1679 states and 2311 transitions. [2019-09-10 08:15:22,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:15:22,042 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:15:22,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:22,045 INFO L225 Difference]: With dead ends: 1679 [2019-09-10 08:15:22,045 INFO L226 Difference]: Without dead ends: 1679 [2019-09-10 08:15:22,045 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:15:22,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2019-09-10 08:15:22,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 909. [2019-09-10 08:15:22,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:15:22,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1224 transitions. [2019-09-10 08:15:22,059 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1224 transitions. Word has length 98 [2019-09-10 08:15:22,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:22,059 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1224 transitions. [2019-09-10 08:15:22,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:15:22,060 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1224 transitions. [2019-09-10 08:15:22,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:15:22,061 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:22,061 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:22,062 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:22,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:22,062 INFO L82 PathProgramCache]: Analyzing trace with hash 513414431, now seen corresponding path program 1 times [2019-09-10 08:15:22,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:22,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:22,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:22,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:22,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:22,218 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:15:22,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:22,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:15:22,219 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:22,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:15:22,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:15:22,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:15:22,220 INFO L87 Difference]: Start difference. First operand 909 states and 1224 transitions. Second operand 9 states. [2019-09-10 08:15:24,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:24,584 INFO L93 Difference]: Finished difference Result 1679 states and 2309 transitions. [2019-09-10 08:15:24,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:15:24,585 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:15:24,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:24,587 INFO L225 Difference]: With dead ends: 1679 [2019-09-10 08:15:24,587 INFO L226 Difference]: Without dead ends: 1679 [2019-09-10 08:15:24,588 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:15:24,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2019-09-10 08:15:24,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 909. [2019-09-10 08:15:24,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:15:24,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1223 transitions. [2019-09-10 08:15:24,597 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1223 transitions. Word has length 98 [2019-09-10 08:15:24,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:24,597 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1223 transitions. [2019-09-10 08:15:24,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:15:24,598 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1223 transitions. [2019-09-10 08:15:24,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:15:24,599 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:24,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] [2019-09-10 08:15:24,600 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:24,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:24,600 INFO L82 PathProgramCache]: Analyzing trace with hash 309455156, now seen corresponding path program 1 times [2019-09-10 08:15:24,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:24,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:24,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:24,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:24,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:24,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:15:24,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:24,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:15:24,786 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:24,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:15:24,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:15:24,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:15:24,788 INFO L87 Difference]: Start difference. First operand 909 states and 1223 transitions. Second operand 9 states. [2019-09-10 08:15:26,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:26,932 INFO L93 Difference]: Finished difference Result 1679 states and 2308 transitions. [2019-09-10 08:15:26,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:15:26,933 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:15:26,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:26,935 INFO L225 Difference]: With dead ends: 1679 [2019-09-10 08:15:26,935 INFO L226 Difference]: Without dead ends: 1679 [2019-09-10 08:15:26,936 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:15:26,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2019-09-10 08:15:26,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 909. [2019-09-10 08:15:26,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:15:26,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1222 transitions. [2019-09-10 08:15:26,945 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1222 transitions. Word has length 99 [2019-09-10 08:15:26,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:26,945 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1222 transitions. [2019-09-10 08:15:26,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:15:26,946 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1222 transitions. [2019-09-10 08:15:26,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:15:26,947 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:26,947 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:26,947 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:26,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:26,948 INFO L82 PathProgramCache]: Analyzing trace with hash 291193798, now seen corresponding path program 1 times [2019-09-10 08:15:26,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:26,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:26,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:26,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:26,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:27,117 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:15:27,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:27,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:15:27,117 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:27,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:15:27,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:15:27,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:15:27,118 INFO L87 Difference]: Start difference. First operand 909 states and 1222 transitions. Second operand 9 states. [2019-09-10 08:15:29,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:29,413 INFO L93 Difference]: Finished difference Result 1703 states and 2342 transitions. [2019-09-10 08:15:29,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:15:29,414 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:15:29,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:29,416 INFO L225 Difference]: With dead ends: 1703 [2019-09-10 08:15:29,417 INFO L226 Difference]: Without dead ends: 1703 [2019-09-10 08:15:29,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:15:29,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2019-09-10 08:15:29,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 909. [2019-09-10 08:15:29,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:15:29,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1220 transitions. [2019-09-10 08:15:29,429 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1220 transitions. Word has length 100 [2019-09-10 08:15:29,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:29,430 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1220 transitions. [2019-09-10 08:15:29,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:15:29,430 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1220 transitions. [2019-09-10 08:15:29,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:15:29,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:29,432 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:29,432 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:29,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:29,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1700395306, now seen corresponding path program 1 times [2019-09-10 08:15:29,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:29,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:29,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:29,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:29,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:29,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:29,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:15:29,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:29,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:15:29,613 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:29,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:15:29,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:15:29,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:15:29,614 INFO L87 Difference]: Start difference. First operand 909 states and 1220 transitions. Second operand 9 states. [2019-09-10 08:15:31,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:31,840 INFO L93 Difference]: Finished difference Result 1631 states and 2225 transitions. [2019-09-10 08:15:31,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:15:31,840 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:15:31,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:31,843 INFO L225 Difference]: With dead ends: 1631 [2019-09-10 08:15:31,843 INFO L226 Difference]: Without dead ends: 1631 [2019-09-10 08:15:31,844 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:15:31,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-10 08:15:31,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 909. [2019-09-10 08:15:31,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:15:31,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1218 transitions. [2019-09-10 08:15:31,853 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1218 transitions. Word has length 100 [2019-09-10 08:15:31,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:31,854 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1218 transitions. [2019-09-10 08:15:31,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:15:31,854 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1218 transitions. [2019-09-10 08:15:31,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:15:31,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:31,855 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:31,856 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:31,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:31,856 INFO L82 PathProgramCache]: Analyzing trace with hash -10584466, now seen corresponding path program 1 times [2019-09-10 08:15:31,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:31,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:31,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:31,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:31,857 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:32,044 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:15:32,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:32,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:15:32,044 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:32,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:15:32,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:15:32,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:15:32,045 INFO L87 Difference]: Start difference. First operand 909 states and 1218 transitions. Second operand 9 states. [2019-09-10 08:15:34,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:34,129 INFO L93 Difference]: Finished difference Result 1679 states and 2302 transitions. [2019-09-10 08:15:34,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:15:34,130 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:15:34,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:34,132 INFO L225 Difference]: With dead ends: 1679 [2019-09-10 08:15:34,132 INFO L226 Difference]: Without dead ends: 1679 [2019-09-10 08:15:34,133 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:15:34,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2019-09-10 08:15:34,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 909. [2019-09-10 08:15:34,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:15:34,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1216 transitions. [2019-09-10 08:15:34,142 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1216 transitions. Word has length 100 [2019-09-10 08:15:34,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:34,142 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1216 transitions. [2019-09-10 08:15:34,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:15:34,142 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1216 transitions. [2019-09-10 08:15:34,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:15:34,144 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:34,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:34,145 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:34,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:34,146 INFO L82 PathProgramCache]: Analyzing trace with hash -906258735, now seen corresponding path program 1 times [2019-09-10 08:15:34,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:34,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:34,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:34,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:34,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:34,325 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:15:34,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:34,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:15:34,325 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:34,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:15:34,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:15:34,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:15:34,326 INFO L87 Difference]: Start difference. First operand 909 states and 1216 transitions. Second operand 9 states. [2019-09-10 08:15:36,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:36,475 INFO L93 Difference]: Finished difference Result 1679 states and 2298 transitions. [2019-09-10 08:15:36,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:15:36,476 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:15:36,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:36,477 INFO L225 Difference]: With dead ends: 1679 [2019-09-10 08:15:36,478 INFO L226 Difference]: Without dead ends: 1679 [2019-09-10 08:15:36,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:15:36,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2019-09-10 08:15:36,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 909. [2019-09-10 08:15:36,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:15:36,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1214 transitions. [2019-09-10 08:15:36,488 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1214 transitions. Word has length 100 [2019-09-10 08:15:36,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:36,488 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1214 transitions. [2019-09-10 08:15:36,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:15:36,488 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1214 transitions. [2019-09-10 08:15:36,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:15:36,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:36,490 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:36,490 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:36,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:36,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1698897721, now seen corresponding path program 1 times [2019-09-10 08:15:36,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:36,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:36,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:36,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:36,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:36,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:36,672 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:15:36,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:36,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:15:36,673 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:36,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:15:36,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:15:36,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:15:36,675 INFO L87 Difference]: Start difference. First operand 909 states and 1214 transitions. Second operand 9 states. [2019-09-10 08:15:39,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:39,012 INFO L93 Difference]: Finished difference Result 1631 states and 2219 transitions. [2019-09-10 08:15:39,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:15:39,012 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:15:39,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:39,015 INFO L225 Difference]: With dead ends: 1631 [2019-09-10 08:15:39,015 INFO L226 Difference]: Without dead ends: 1631 [2019-09-10 08:15:39,015 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:15:39,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-10 08:15:39,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 909. [2019-09-10 08:15:39,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:15:39,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1212 transitions. [2019-09-10 08:15:39,027 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1212 transitions. Word has length 100 [2019-09-10 08:15:39,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:39,027 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1212 transitions. [2019-09-10 08:15:39,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:15:39,027 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1212 transitions. [2019-09-10 08:15:39,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:15:39,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:39,029 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:39,029 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:39,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:39,030 INFO L82 PathProgramCache]: Analyzing trace with hash -483952406, now seen corresponding path program 1 times [2019-09-10 08:15:39,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:39,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:39,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:39,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:39,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:39,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:39,321 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:15:39,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:39,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:15:39,323 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:39,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:15:39,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:15:39,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:15:39,324 INFO L87 Difference]: Start difference. First operand 909 states and 1212 transitions. Second operand 9 states. [2019-09-10 08:15:41,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:41,552 INFO L93 Difference]: Finished difference Result 1631 states and 2217 transitions. [2019-09-10 08:15:41,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:15:41,553 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:15:41,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:41,555 INFO L225 Difference]: With dead ends: 1631 [2019-09-10 08:15:41,555 INFO L226 Difference]: Without dead ends: 1631 [2019-09-10 08:15:41,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:15:41,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-10 08:15:41,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 909. [2019-09-10 08:15:41,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:15:41,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1210 transitions. [2019-09-10 08:15:41,566 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1210 transitions. Word has length 100 [2019-09-10 08:15:41,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:41,566 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1210 transitions. [2019-09-10 08:15:41,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:15:41,566 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1210 transitions. [2019-09-10 08:15:41,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:15:41,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:41,568 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:41,568 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:41,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:41,569 INFO L82 PathProgramCache]: Analyzing trace with hash -18890581, now seen corresponding path program 1 times [2019-09-10 08:15:41,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:41,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:41,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:41,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:41,570 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:41,720 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:15:41,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:41,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:15:41,721 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:41,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:15:41,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:15:41,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:15:41,722 INFO L87 Difference]: Start difference. First operand 909 states and 1210 transitions. Second operand 9 states. [2019-09-10 08:15:44,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:44,067 INFO L93 Difference]: Finished difference Result 1631 states and 2213 transitions. [2019-09-10 08:15:44,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:15:44,068 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:15:44,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:44,070 INFO L225 Difference]: With dead ends: 1631 [2019-09-10 08:15:44,070 INFO L226 Difference]: Without dead ends: 1631 [2019-09-10 08:15:44,070 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:15:44,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-10 08:15:44,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 909. [2019-09-10 08:15:44,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:15:44,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1208 transitions. [2019-09-10 08:15:44,080 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1208 transitions. Word has length 100 [2019-09-10 08:15:44,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:44,080 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1208 transitions. [2019-09-10 08:15:44,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:15:44,080 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1208 transitions. [2019-09-10 08:15:44,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:15:44,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:44,081 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:44,081 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:44,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:44,082 INFO L82 PathProgramCache]: Analyzing trace with hash 827980610, now seen corresponding path program 1 times [2019-09-10 08:15:44,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:44,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:44,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:44,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:44,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:44,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:44,242 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:15:44,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:44,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:15:44,243 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:44,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:15:44,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:15:44,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:15:44,244 INFO L87 Difference]: Start difference. First operand 909 states and 1208 transitions. Second operand 9 states. [2019-09-10 08:15:46,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:46,461 INFO L93 Difference]: Finished difference Result 1631 states and 2211 transitions. [2019-09-10 08:15:46,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:15:46,462 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:15:46,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:46,464 INFO L225 Difference]: With dead ends: 1631 [2019-09-10 08:15:46,464 INFO L226 Difference]: Without dead ends: 1631 [2019-09-10 08:15:46,465 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:15:46,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-10 08:15:46,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 909. [2019-09-10 08:15:46,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:15:46,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1206 transitions. [2019-09-10 08:15:46,476 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1206 transitions. Word has length 100 [2019-09-10 08:15:46,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:46,476 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1206 transitions. [2019-09-10 08:15:46,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:15:46,477 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1206 transitions. [2019-09-10 08:15:46,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:15:46,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:46,478 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:46,478 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:46,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:46,479 INFO L82 PathProgramCache]: Analyzing trace with hash -142106022, now seen corresponding path program 1 times [2019-09-10 08:15:46,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:46,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:46,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:46,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:46,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:46,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:46,617 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:15:46,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:46,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:15:46,617 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:46,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:15:46,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:15:46,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:15:46,618 INFO L87 Difference]: Start difference. First operand 909 states and 1206 transitions. Second operand 9 states. [2019-09-10 08:15:49,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:49,023 INFO L93 Difference]: Finished difference Result 1679 states and 2282 transitions. [2019-09-10 08:15:49,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:15:49,024 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:15:49,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:49,026 INFO L225 Difference]: With dead ends: 1679 [2019-09-10 08:15:49,026 INFO L226 Difference]: Without dead ends: 1679 [2019-09-10 08:15:49,027 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:15:49,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2019-09-10 08:15:49,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 909. [2019-09-10 08:15:49,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:15:49,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1204 transitions. [2019-09-10 08:15:49,036 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1204 transitions. Word has length 100 [2019-09-10 08:15:49,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:49,036 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1204 transitions. [2019-09-10 08:15:49,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:15:49,036 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1204 transitions. [2019-09-10 08:15:49,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:15:49,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:49,037 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:49,038 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:49,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:49,038 INFO L82 PathProgramCache]: Analyzing trace with hash 2085388437, now seen corresponding path program 1 times [2019-09-10 08:15:49,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:49,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:49,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:49,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:49,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:49,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:49,182 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:15:49,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:49,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:15:49,183 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:49,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:15:49,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:15:49,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:15:49,183 INFO L87 Difference]: Start difference. First operand 909 states and 1204 transitions. Second operand 9 states. [2019-09-10 08:15:51,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:51,558 INFO L93 Difference]: Finished difference Result 1631 states and 2205 transitions. [2019-09-10 08:15:51,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:15:51,558 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:15:51,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:51,561 INFO L225 Difference]: With dead ends: 1631 [2019-09-10 08:15:51,561 INFO L226 Difference]: Without dead ends: 1631 [2019-09-10 08:15:51,561 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:15:51,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-10 08:15:51,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 909. [2019-09-10 08:15:51,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:15:51,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1202 transitions. [2019-09-10 08:15:51,571 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1202 transitions. Word has length 100 [2019-09-10 08:15:51,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:51,571 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1202 transitions. [2019-09-10 08:15:51,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:15:51,571 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1202 transitions. [2019-09-10 08:15:51,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:15:51,573 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:51,573 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:51,573 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:51,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:51,573 INFO L82 PathProgramCache]: Analyzing trace with hash -209751473, now seen corresponding path program 1 times [2019-09-10 08:15:51,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:51,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:51,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:51,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:51,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:51,728 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:15:51,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:51,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:15:51,729 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:51,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:15:51,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:15:51,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:15:51,730 INFO L87 Difference]: Start difference. First operand 909 states and 1202 transitions. Second operand 9 states. [2019-09-10 08:15:53,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:53,674 INFO L93 Difference]: Finished difference Result 1631 states and 2203 transitions. [2019-09-10 08:15:53,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:15:53,674 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:15:53,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:53,677 INFO L225 Difference]: With dead ends: 1631 [2019-09-10 08:15:53,677 INFO L226 Difference]: Without dead ends: 1631 [2019-09-10 08:15:53,678 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:15:53,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-10 08:15:53,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 909. [2019-09-10 08:15:53,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:15:53,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1200 transitions. [2019-09-10 08:15:53,690 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1200 transitions. Word has length 100 [2019-09-10 08:15:53,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:53,690 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1200 transitions. [2019-09-10 08:15:53,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:15:53,691 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1200 transitions. [2019-09-10 08:15:53,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:15:53,692 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:53,692 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:53,693 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:53,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:53,693 INFO L82 PathProgramCache]: Analyzing trace with hash -120851267, now seen corresponding path program 1 times [2019-09-10 08:15:53,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:53,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:53,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:53,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:53,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:53,843 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:15:53,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:53,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:15:53,844 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:53,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:15:53,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:15:53,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:15:53,845 INFO L87 Difference]: Start difference. First operand 909 states and 1200 transitions. Second operand 9 states. [2019-09-10 08:15:56,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:56,149 INFO L93 Difference]: Finished difference Result 1631 states and 2199 transitions. [2019-09-10 08:15:56,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:15:56,149 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:15:56,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:56,151 INFO L225 Difference]: With dead ends: 1631 [2019-09-10 08:15:56,152 INFO L226 Difference]: Without dead ends: 1631 [2019-09-10 08:15:56,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:15:56,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-10 08:15:56,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 909. [2019-09-10 08:15:56,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:15:56,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1198 transitions. [2019-09-10 08:15:56,162 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1198 transitions. Word has length 100 [2019-09-10 08:15:56,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:56,162 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1198 transitions. [2019-09-10 08:15:56,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:15:56,162 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1198 transitions. [2019-09-10 08:15:56,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:15:56,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:56,164 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:56,164 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:56,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:56,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1880101188, now seen corresponding path program 1 times [2019-09-10 08:15:56,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:56,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:56,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:56,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:56,166 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:56,310 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:15:56,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:56,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:15:56,310 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:56,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:15:56,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:15:56,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:15:56,311 INFO L87 Difference]: Start difference. First operand 909 states and 1198 transitions. Second operand 9 states. [2019-09-10 08:15:58,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:58,470 INFO L93 Difference]: Finished difference Result 1631 states and 2197 transitions. [2019-09-10 08:15:58,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:15:58,470 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:15:58,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:58,472 INFO L225 Difference]: With dead ends: 1631 [2019-09-10 08:15:58,473 INFO L226 Difference]: Without dead ends: 1631 [2019-09-10 08:15:58,473 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:15:58,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-10 08:15:58,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 909. [2019-09-10 08:15:58,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:15:58,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1196 transitions. [2019-09-10 08:15:58,484 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1196 transitions. Word has length 100 [2019-09-10 08:15:58,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:58,484 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1196 transitions. [2019-09-10 08:15:58,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:15:58,485 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1196 transitions. [2019-09-10 08:15:58,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:15:58,485 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:58,486 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:58,486 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:58,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:58,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1432903500, now seen corresponding path program 1 times [2019-09-10 08:15:58,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:58,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:58,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:58,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:58,487 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:58,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:58,625 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:15:58,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:58,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:15:58,625 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:58,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:15:58,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:15:58,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:15:58,626 INFO L87 Difference]: Start difference. First operand 909 states and 1196 transitions. Second operand 9 states. [2019-09-10 08:16:00,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:00,775 INFO L93 Difference]: Finished difference Result 1631 states and 2193 transitions. [2019-09-10 08:16:00,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:16:00,776 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:16:00,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:00,778 INFO L225 Difference]: With dead ends: 1631 [2019-09-10 08:16:00,778 INFO L226 Difference]: Without dead ends: 1631 [2019-09-10 08:16:00,779 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:16:00,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-10 08:16:00,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 909. [2019-09-10 08:16:00,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:16:00,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1194 transitions. [2019-09-10 08:16:00,791 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1194 transitions. Word has length 100 [2019-09-10 08:16:00,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:00,791 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1194 transitions. [2019-09-10 08:16:00,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:16:00,792 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1194 transitions. [2019-09-10 08:16:00,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:16:00,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:00,793 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:00,793 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:00,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:00,794 INFO L82 PathProgramCache]: Analyzing trace with hash 53028367, now seen corresponding path program 1 times [2019-09-10 08:16:00,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:00,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:00,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:00,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:00,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:00,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:00,944 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:16:00,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:00,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:16:00,944 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:00,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:16:00,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:16:00,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:16:00,945 INFO L87 Difference]: Start difference. First operand 909 states and 1194 transitions. Second operand 9 states. [2019-09-10 08:16:03,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:03,165 INFO L93 Difference]: Finished difference Result 1631 states and 2192 transitions. [2019-09-10 08:16:03,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:16:03,166 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:16:03,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:03,168 INFO L225 Difference]: With dead ends: 1631 [2019-09-10 08:16:03,168 INFO L226 Difference]: Without dead ends: 1631 [2019-09-10 08:16:03,168 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:16:03,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-10 08:16:03,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 909. [2019-09-10 08:16:03,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:16:03,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1193 transitions. [2019-09-10 08:16:03,178 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1193 transitions. Word has length 100 [2019-09-10 08:16:03,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:03,178 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1193 transitions. [2019-09-10 08:16:03,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:16:03,178 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1193 transitions. [2019-09-10 08:16:03,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:16:03,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:03,180 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:03,180 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:03,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:03,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1991382183, now seen corresponding path program 1 times [2019-09-10 08:16:03,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:03,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:03,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:03,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:03,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:03,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:16:03,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:03,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:16:03,299 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:03,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:16:03,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:16:03,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:16:03,300 INFO L87 Difference]: Start difference. First operand 909 states and 1193 transitions. Second operand 9 states. [2019-09-10 08:16:05,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:05,679 INFO L93 Difference]: Finished difference Result 1679 states and 2264 transitions. [2019-09-10 08:16:05,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:16:05,679 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:16:05,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:05,682 INFO L225 Difference]: With dead ends: 1679 [2019-09-10 08:16:05,682 INFO L226 Difference]: Without dead ends: 1679 [2019-09-10 08:16:05,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:16:05,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2019-09-10 08:16:05,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 909. [2019-09-10 08:16:05,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:16:05,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1192 transitions. [2019-09-10 08:16:05,692 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1192 transitions. Word has length 100 [2019-09-10 08:16:05,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:05,692 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1192 transitions. [2019-09-10 08:16:05,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:16:05,692 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1192 transitions. [2019-09-10 08:16:05,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:16:05,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:05,694 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:05,694 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:05,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:05,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1942716530, now seen corresponding path program 1 times [2019-09-10 08:16:05,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:05,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:05,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:05,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:05,696 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:05,838 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:16:05,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:05,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:16:05,839 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:05,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:16:05,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:16:05,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:16:05,840 INFO L87 Difference]: Start difference. First operand 909 states and 1192 transitions. Second operand 9 states. [2019-09-10 08:16:08,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:08,448 INFO L93 Difference]: Finished difference Result 1631 states and 2189 transitions. [2019-09-10 08:16:08,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:16:08,448 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:16:08,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:08,450 INFO L225 Difference]: With dead ends: 1631 [2019-09-10 08:16:08,451 INFO L226 Difference]: Without dead ends: 1631 [2019-09-10 08:16:08,451 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:16:08,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-10 08:16:08,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 909. [2019-09-10 08:16:08,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:16:08,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1191 transitions. [2019-09-10 08:16:08,463 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1191 transitions. Word has length 100 [2019-09-10 08:16:08,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:08,464 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1191 transitions. [2019-09-10 08:16:08,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:16:08,464 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1191 transitions. [2019-09-10 08:16:08,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:16:08,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:08,465 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:08,466 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:08,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:08,466 INFO L82 PathProgramCache]: Analyzing trace with hash -899406943, now seen corresponding path program 1 times [2019-09-10 08:16:08,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:08,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:08,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:08,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:08,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:08,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:08,617 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:16:08,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:08,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:16:08,617 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:08,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:16:08,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:16:08,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:16:08,618 INFO L87 Difference]: Start difference. First operand 909 states and 1191 transitions. Second operand 9 states. [2019-09-10 08:16:10,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:10,693 INFO L93 Difference]: Finished difference Result 1631 states and 2188 transitions. [2019-09-10 08:16:10,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:16:10,694 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:16:10,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:10,696 INFO L225 Difference]: With dead ends: 1631 [2019-09-10 08:16:10,697 INFO L226 Difference]: Without dead ends: 1631 [2019-09-10 08:16:10,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:16:10,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-10 08:16:10,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 909. [2019-09-10 08:16:10,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:16:10,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1190 transitions. [2019-09-10 08:16:10,706 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1190 transitions. Word has length 100 [2019-09-10 08:16:10,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:10,706 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1190 transitions. [2019-09-10 08:16:10,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:16:10,706 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1190 transitions. [2019-09-10 08:16:10,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:16:10,707 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:10,707 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:10,708 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:10,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:10,708 INFO L82 PathProgramCache]: Analyzing trace with hash 410796862, now seen corresponding path program 1 times [2019-09-10 08:16:10,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:10,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:10,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:10,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:10,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:10,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:10,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:16:10,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:10,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:16:10,858 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:10,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:16:10,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:16:10,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:16:10,862 INFO L87 Difference]: Start difference. First operand 909 states and 1190 transitions. Second operand 9 states. [2019-09-10 08:16:12,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:12,868 INFO L93 Difference]: Finished difference Result 1631 states and 2187 transitions. [2019-09-10 08:16:12,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:16:12,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:16:12,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:12,870 INFO L225 Difference]: With dead ends: 1631 [2019-09-10 08:16:12,871 INFO L226 Difference]: Without dead ends: 1631 [2019-09-10 08:16:12,871 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:16:12,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-10 08:16:12,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 909. [2019-09-10 08:16:12,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:16:12,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1189 transitions. [2019-09-10 08:16:12,883 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1189 transitions. Word has length 100 [2019-09-10 08:16:12,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:12,884 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1189 transitions. [2019-09-10 08:16:12,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:16:12,884 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1189 transitions. [2019-09-10 08:16:12,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:16:12,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:12,885 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:12,886 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:12,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:12,886 INFO L82 PathProgramCache]: Analyzing trace with hash -279511526, now seen corresponding path program 1 times [2019-09-10 08:16:12,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:12,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:12,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:12,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:12,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:13,015 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:16:13,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:13,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:16:13,016 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:13,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:16:13,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:16:13,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:16:13,017 INFO L87 Difference]: Start difference. First operand 909 states and 1189 transitions. Second operand 9 states. [2019-09-10 08:16:15,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:15,394 INFO L93 Difference]: Finished difference Result 1631 states and 2185 transitions. [2019-09-10 08:16:15,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:16:15,395 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:16:15,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:15,397 INFO L225 Difference]: With dead ends: 1631 [2019-09-10 08:16:15,398 INFO L226 Difference]: Without dead ends: 1631 [2019-09-10 08:16:15,398 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:16:15,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-10 08:16:15,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 909. [2019-09-10 08:16:15,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:16:15,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1188 transitions. [2019-09-10 08:16:15,407 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1188 transitions. Word has length 100 [2019-09-10 08:16:15,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:15,408 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1188 transitions. [2019-09-10 08:16:15,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:16:15,408 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1188 transitions. [2019-09-10 08:16:15,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:16:15,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:15,410 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:15,410 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:15,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:15,410 INFO L82 PathProgramCache]: Analyzing trace with hash -188121012, now seen corresponding path program 1 times [2019-09-10 08:16:15,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:15,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:15,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:15,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:15,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:15,561 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:16:15,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:15,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:16:15,561 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:15,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:16:15,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:16:15,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:16:15,562 INFO L87 Difference]: Start difference. First operand 909 states and 1188 transitions. Second operand 9 states. [2019-09-10 08:16:17,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:17,853 INFO L93 Difference]: Finished difference Result 1631 states and 2183 transitions. [2019-09-10 08:16:17,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:16:17,853 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:16:17,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:17,855 INFO L225 Difference]: With dead ends: 1631 [2019-09-10 08:16:17,856 INFO L226 Difference]: Without dead ends: 1631 [2019-09-10 08:16:17,856 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:16:17,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-10 08:16:17,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 909. [2019-09-10 08:16:17,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:16:17,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1187 transitions. [2019-09-10 08:16:17,869 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1187 transitions. Word has length 100 [2019-09-10 08:16:17,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:17,870 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1187 transitions. [2019-09-10 08:16:17,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:16:17,870 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1187 transitions. [2019-09-10 08:16:17,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:16:17,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:17,871 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:17,872 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:17,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:17,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1783081460, now seen corresponding path program 1 times [2019-09-10 08:16:17,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:17,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:17,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:17,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:17,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:17,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:18,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:16:18,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:18,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:16:18,030 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:18,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:16:18,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:16:18,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:16:18,031 INFO L87 Difference]: Start difference. First operand 909 states and 1187 transitions. Second operand 9 states. [2019-09-10 08:16:20,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:20,366 INFO L93 Difference]: Finished difference Result 1631 states and 2181 transitions. [2019-09-10 08:16:20,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:16:20,366 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:16:20,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:20,368 INFO L225 Difference]: With dead ends: 1631 [2019-09-10 08:16:20,368 INFO L226 Difference]: Without dead ends: 1631 [2019-09-10 08:16:20,369 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:16:20,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-10 08:16:20,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 909. [2019-09-10 08:16:20,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:16:20,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1186 transitions. [2019-09-10 08:16:20,379 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1186 transitions. Word has length 100 [2019-09-10 08:16:20,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:20,379 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1186 transitions. [2019-09-10 08:16:20,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:16:20,379 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1186 transitions. [2019-09-10 08:16:20,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:16:20,380 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:20,380 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:20,381 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:20,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:20,381 INFO L82 PathProgramCache]: Analyzing trace with hash -902270955, now seen corresponding path program 1 times [2019-09-10 08:16:20,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:20,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:20,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:20,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:20,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:20,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:16:20,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:20,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:16:20,546 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:20,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:16:20,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:16:20,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:16:20,547 INFO L87 Difference]: Start difference. First operand 909 states and 1186 transitions. Second operand 9 states. [2019-09-10 08:16:22,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:22,809 INFO L93 Difference]: Finished difference Result 1631 states and 2180 transitions. [2019-09-10 08:16:22,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:16:22,810 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:16:22,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:22,812 INFO L225 Difference]: With dead ends: 1631 [2019-09-10 08:16:22,812 INFO L226 Difference]: Without dead ends: 1631 [2019-09-10 08:16:22,812 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:16:22,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-10 08:16:22,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 909. [2019-09-10 08:16:22,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:16:22,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1185 transitions. [2019-09-10 08:16:22,822 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1185 transitions. Word has length 100 [2019-09-10 08:16:22,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:22,823 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1185 transitions. [2019-09-10 08:16:22,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:16:22,823 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1185 transitions. [2019-09-10 08:16:22,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:16:22,824 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:22,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:22,824 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:22,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:22,824 INFO L82 PathProgramCache]: Analyzing trace with hash 535576962, now seen corresponding path program 1 times [2019-09-10 08:16:22,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:22,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:22,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:22,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:22,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:22,969 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:16:22,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:22,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:16:22,970 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:22,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:16:22,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:16:22,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:16:22,971 INFO L87 Difference]: Start difference. First operand 909 states and 1185 transitions. Second operand 9 states. [2019-09-10 08:16:25,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:25,052 INFO L93 Difference]: Finished difference Result 1631 states and 2178 transitions. [2019-09-10 08:16:25,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:16:25,055 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:16:25,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:25,057 INFO L225 Difference]: With dead ends: 1631 [2019-09-10 08:16:25,057 INFO L226 Difference]: Without dead ends: 1631 [2019-09-10 08:16:25,057 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:16:25,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-10 08:16:25,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 909. [2019-09-10 08:16:25,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:16:25,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1184 transitions. [2019-09-10 08:16:25,067 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1184 transitions. Word has length 100 [2019-09-10 08:16:25,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:25,067 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1184 transitions. [2019-09-10 08:16:25,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:16:25,067 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1184 transitions. [2019-09-10 08:16:25,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:16:25,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:25,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:25,069 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:25,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:25,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1553613818, now seen corresponding path program 1 times [2019-09-10 08:16:25,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:25,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:25,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:25,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:25,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:25,233 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:16:25,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:25,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:16:25,233 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:25,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:16:25,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:16:25,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:16:25,234 INFO L87 Difference]: Start difference. First operand 909 states and 1184 transitions. Second operand 9 states. [2019-09-10 08:16:27,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:27,194 INFO L93 Difference]: Finished difference Result 1631 states and 2176 transitions. [2019-09-10 08:16:27,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:16:27,195 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:16:27,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:27,197 INFO L225 Difference]: With dead ends: 1631 [2019-09-10 08:16:27,197 INFO L226 Difference]: Without dead ends: 1631 [2019-09-10 08:16:27,197 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:16:27,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-10 08:16:27,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 909. [2019-09-10 08:16:27,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:16:27,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1183 transitions. [2019-09-10 08:16:27,207 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1183 transitions. Word has length 100 [2019-09-10 08:16:27,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:27,208 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1183 transitions. [2019-09-10 08:16:27,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:16:27,208 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1183 transitions. [2019-09-10 08:16:27,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:16:27,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:27,209 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:27,210 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:27,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:27,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1511064327, now seen corresponding path program 1 times [2019-09-10 08:16:27,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:27,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:27,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:27,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:27,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:27,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:27,354 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:16:27,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:27,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:16:27,355 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:27,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:16:27,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:16:27,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:16:27,356 INFO L87 Difference]: Start difference. First operand 909 states and 1183 transitions. Second operand 9 states. [2019-09-10 08:16:29,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:29,511 INFO L93 Difference]: Finished difference Result 1629 states and 2172 transitions. [2019-09-10 08:16:29,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:16:29,512 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:16:29,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:29,514 INFO L225 Difference]: With dead ends: 1629 [2019-09-10 08:16:29,514 INFO L226 Difference]: Without dead ends: 1629 [2019-09-10 08:16:29,515 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:16:29,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2019-09-10 08:16:29,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 907. [2019-09-10 08:16:29,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2019-09-10 08:16:29,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1179 transitions. [2019-09-10 08:16:29,524 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1179 transitions. Word has length 101 [2019-09-10 08:16:29,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:29,524 INFO L475 AbstractCegarLoop]: Abstraction has 907 states and 1179 transitions. [2019-09-10 08:16:29,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:16:29,524 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1179 transitions. [2019-09-10 08:16:29,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:16:29,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:29,525 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:29,525 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:29,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:29,526 INFO L82 PathProgramCache]: Analyzing trace with hash 2123623915, now seen corresponding path program 1 times [2019-09-10 08:16:29,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:29,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:29,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:29,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:29,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:29,669 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:16:29,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:29,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:16:29,669 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:29,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:16:29,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:16:29,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:16:29,670 INFO L87 Difference]: Start difference. First operand 907 states and 1179 transitions. Second operand 9 states. [2019-09-10 08:16:31,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:31,833 INFO L93 Difference]: Finished difference Result 1629 states and 2171 transitions. [2019-09-10 08:16:31,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:16:31,834 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:16:31,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:31,836 INFO L225 Difference]: With dead ends: 1629 [2019-09-10 08:16:31,836 INFO L226 Difference]: Without dead ends: 1629 [2019-09-10 08:16:31,836 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:16:31,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2019-09-10 08:16:31,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 907. [2019-09-10 08:16:31,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2019-09-10 08:16:31,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1178 transitions. [2019-09-10 08:16:31,846 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1178 transitions. Word has length 101 [2019-09-10 08:16:31,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:31,846 INFO L475 AbstractCegarLoop]: Abstraction has 907 states and 1178 transitions. [2019-09-10 08:16:31,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:16:31,846 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1178 transitions. [2019-09-10 08:16:31,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:16:31,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:31,848 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:31,848 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:31,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:31,848 INFO L82 PathProgramCache]: Analyzing trace with hash -686829505, now seen corresponding path program 1 times [2019-09-10 08:16:31,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:31,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:31,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:31,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:31,849 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:31,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:31,982 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:16:31,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:31,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:16:31,983 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:31,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:16:31,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:16:31,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:16:31,984 INFO L87 Difference]: Start difference. First operand 907 states and 1178 transitions. Second operand 9 states. [2019-09-10 08:16:34,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:34,231 INFO L93 Difference]: Finished difference Result 1628 states and 2169 transitions. [2019-09-10 08:16:34,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:16:34,232 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:16:34,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:34,234 INFO L225 Difference]: With dead ends: 1628 [2019-09-10 08:16:34,234 INFO L226 Difference]: Without dead ends: 1628 [2019-09-10 08:16:34,235 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:16:34,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2019-09-10 08:16:34,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 906. [2019-09-10 08:16:34,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-09-10 08:16:34,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1176 transitions. [2019-09-10 08:16:34,244 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1176 transitions. Word has length 101 [2019-09-10 08:16:34,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:34,245 INFO L475 AbstractCegarLoop]: Abstraction has 906 states and 1176 transitions. [2019-09-10 08:16:34,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:16:34,245 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1176 transitions. [2019-09-10 08:16:34,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:16:34,246 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:34,246 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:34,246 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:34,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:34,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1381337777, now seen corresponding path program 1 times [2019-09-10 08:16:34,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:34,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:34,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:34,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:34,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:34,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:16:34,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:34,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:16:34,367 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:34,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:16:34,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:16:34,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:16:34,368 INFO L87 Difference]: Start difference. First operand 906 states and 1176 transitions. Second operand 9 states. [2019-09-10 08:16:36,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:36,603 INFO L93 Difference]: Finished difference Result 1626 states and 2165 transitions. [2019-09-10 08:16:36,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:16:36,603 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:16:36,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:36,606 INFO L225 Difference]: With dead ends: 1626 [2019-09-10 08:16:36,606 INFO L226 Difference]: Without dead ends: 1626 [2019-09-10 08:16:36,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:16:36,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-10 08:16:36,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-10 08:16:36,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:16:36,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1174 transitions. [2019-09-10 08:16:36,615 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1174 transitions. Word has length 101 [2019-09-10 08:16:36,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:36,615 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1174 transitions. [2019-09-10 08:16:36,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:16:36,615 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1174 transitions. [2019-09-10 08:16:36,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:16:36,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:36,616 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:36,617 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:36,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:36,617 INFO L82 PathProgramCache]: Analyzing trace with hash -312727000, now seen corresponding path program 1 times [2019-09-10 08:16:36,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:36,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:36,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:36,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:36,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:36,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:36,759 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:16:36,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:36,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:16:36,760 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:36,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:16:36,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:16:36,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:16:36,761 INFO L87 Difference]: Start difference. First operand 905 states and 1174 transitions. Second operand 9 states. [2019-09-10 08:16:38,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:38,897 INFO L93 Difference]: Finished difference Result 1626 states and 2164 transitions. [2019-09-10 08:16:38,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:16:38,898 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:16:38,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:38,900 INFO L225 Difference]: With dead ends: 1626 [2019-09-10 08:16:38,900 INFO L226 Difference]: Without dead ends: 1626 [2019-09-10 08:16:38,900 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:16:38,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-10 08:16:38,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-10 08:16:38,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-10 08:16:38,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1173 transitions. [2019-09-10 08:16:38,910 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1173 transitions. Word has length 101 [2019-09-10 08:16:38,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:38,910 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1173 transitions. [2019-09-10 08:16:38,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:16:38,910 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1173 transitions. [2019-09-10 08:16:38,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:16:38,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:38,911 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:38,912 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:38,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:38,912 INFO L82 PathProgramCache]: Analyzing trace with hash -69019033, now seen corresponding path program 1 times [2019-09-10 08:16:38,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:38,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:38,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:38,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:38,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:39,023 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:16:39,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:39,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:16:39,023 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:39,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:16:39,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:16:39,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:16:39,024 INFO L87 Difference]: Start difference. First operand 905 states and 1173 transitions. Second operand 9 states. [2019-09-10 08:16:41,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:41,205 INFO L93 Difference]: Finished difference Result 1625 states and 2162 transitions. [2019-09-10 08:16:41,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:16:41,206 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:16:41,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:41,208 INFO L225 Difference]: With dead ends: 1625 [2019-09-10 08:16:41,209 INFO L226 Difference]: Without dead ends: 1625 [2019-09-10 08:16:41,209 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:16:41,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2019-09-10 08:16:41,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 904. [2019-09-10 08:16:41,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-09-10 08:16:41,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1171 transitions. [2019-09-10 08:16:41,221 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1171 transitions. Word has length 101 [2019-09-10 08:16:41,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:41,221 INFO L475 AbstractCegarLoop]: Abstraction has 904 states and 1171 transitions. [2019-09-10 08:16:41,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:16:41,221 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1171 transitions. [2019-09-10 08:16:41,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:16:41,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:41,223 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:41,223 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:41,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:41,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1147136159, now seen corresponding path program 1 times [2019-09-10 08:16:41,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:41,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:41,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:41,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:41,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:42,318 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 08:16:42,469 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:16:42,612 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 08:16:44,015 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:16:44,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:44,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-10 08:16:44,015 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:44,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 08:16:44,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 08:16:44,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=847, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:16:44,016 INFO L87 Difference]: Start difference. First operand 904 states and 1171 transitions. Second operand 31 states. [2019-09-10 08:16:44,214 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-10 08:16:45,293 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 08:16:45,465 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 08:16:45,913 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 08:16:46,210 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-09-10 08:16:46,555 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 75 [2019-09-10 08:16:46,919 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 82 [2019-09-10 08:16:47,458 WARN L188 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 102 [2019-09-10 08:16:47,738 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-09-10 08:16:47,995 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-09-10 08:16:48,329 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-10 08:16:58,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:58,350 INFO L93 Difference]: Finished difference Result 1227 states and 1589 transitions. [2019-09-10 08:16:58,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 08:16:58,351 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 102 [2019-09-10 08:16:58,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:58,352 INFO L225 Difference]: With dead ends: 1227 [2019-09-10 08:16:58,352 INFO L226 Difference]: Without dead ends: 1227 [2019-09-10 08:16:58,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=475, Invalid=1975, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 08:16:58,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2019-09-10 08:16:58,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 924. [2019-09-10 08:16:58,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 924 states. [2019-09-10 08:16:58,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1198 transitions. [2019-09-10 08:16:58,361 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1198 transitions. Word has length 102 [2019-09-10 08:16:58,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:58,361 INFO L475 AbstractCegarLoop]: Abstraction has 924 states and 1198 transitions. [2019-09-10 08:16:58,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 08:16:58,362 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1198 transitions. [2019-09-10 08:16:58,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:16:58,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:58,363 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:58,363 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:58,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:58,364 INFO L82 PathProgramCache]: Analyzing trace with hash -80543799, now seen corresponding path program 1 times [2019-09-10 08:16:58,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:58,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:58,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:58,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:58,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:59,037 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:16:59,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:59,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:16:59,038 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:59,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:16:59,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:16:59,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:16:59,039 INFO L87 Difference]: Start difference. First operand 924 states and 1198 transitions. Second operand 17 states. [2019-09-10 08:16:59,613 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 08:17:02,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:02,705 INFO L93 Difference]: Finished difference Result 1825 states and 2427 transitions. [2019-09-10 08:17:02,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:17:02,706 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 102 [2019-09-10 08:17:02,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:02,708 INFO L225 Difference]: With dead ends: 1825 [2019-09-10 08:17:02,709 INFO L226 Difference]: Without dead ends: 1825 [2019-09-10 08:17:02,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:17:02,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1825 states. [2019-09-10 08:17:02,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1825 to 904. [2019-09-10 08:17:02,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-09-10 08:17:02,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1169 transitions. [2019-09-10 08:17:02,719 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1169 transitions. Word has length 102 [2019-09-10 08:17:02,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:02,720 INFO L475 AbstractCegarLoop]: Abstraction has 904 states and 1169 transitions. [2019-09-10 08:17:02,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:17:02,720 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1169 transitions. [2019-09-10 08:17:02,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:17:02,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:02,721 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:02,722 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:02,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:02,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1830092596, now seen corresponding path program 1 times [2019-09-10 08:17:02,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:02,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:02,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:02,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:02,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:02,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:03,946 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:17:03,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:03,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:17:03,946 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:03,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:17:03,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:17:03,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:17:03,947 INFO L87 Difference]: Start difference. First operand 904 states and 1169 transitions. Second operand 22 states. [2019-09-10 08:17:04,957 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-09-10 08:17:05,216 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2019-09-10 08:17:05,533 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2019-09-10 08:17:05,697 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-10 08:17:06,089 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2019-09-10 08:17:06,831 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2019-09-10 08:17:10,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:10,811 INFO L93 Difference]: Finished difference Result 1806 states and 2370 transitions. [2019-09-10 08:17:10,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:17:10,812 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 102 [2019-09-10 08:17:10,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:10,814 INFO L225 Difference]: With dead ends: 1806 [2019-09-10 08:17:10,814 INFO L226 Difference]: Without dead ends: 1806 [2019-09-10 08:17:10,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:17:10,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2019-09-10 08:17:10,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 916. [2019-09-10 08:17:10,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-09-10 08:17:10,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1181 transitions. [2019-09-10 08:17:10,825 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1181 transitions. Word has length 102 [2019-09-10 08:17:10,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:10,825 INFO L475 AbstractCegarLoop]: Abstraction has 916 states and 1181 transitions. [2019-09-10 08:17:10,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:17:10,825 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1181 transitions. [2019-09-10 08:17:10,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:17:10,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:10,827 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:10,827 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:10,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:10,827 INFO L82 PathProgramCache]: Analyzing trace with hash 562528111, now seen corresponding path program 1 times [2019-09-10 08:17:10,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:10,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:10,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:10,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:10,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:11,472 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-09-10 08:17:11,640 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-09-10 08:17:12,920 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:17:12,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:12,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 08:17:12,921 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:12,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 08:17:12,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 08:17:12,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:17:12,922 INFO L87 Difference]: Start difference. First operand 916 states and 1181 transitions. Second operand 26 states. [2019-09-10 08:17:13,066 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 08:17:14,054 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 08:17:14,335 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2019-09-10 08:17:14,702 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 101 [2019-09-10 08:17:15,266 WARN L188 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 122 [2019-09-10 08:17:15,474 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-09-10 08:17:15,681 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-09-10 08:17:16,012 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-09-10 08:17:24,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:24,680 INFO L93 Difference]: Finished difference Result 1986 states and 2635 transitions. [2019-09-10 08:17:24,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 08:17:24,680 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 102 [2019-09-10 08:17:24,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:24,683 INFO L225 Difference]: With dead ends: 1986 [2019-09-10 08:17:24,683 INFO L226 Difference]: Without dead ends: 1986 [2019-09-10 08:17:24,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=404, Invalid=1948, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 08:17:24,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1986 states. [2019-09-10 08:17:24,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1986 to 929. [2019-09-10 08:17:24,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 929 states. [2019-09-10 08:17:24,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1199 transitions. [2019-09-10 08:17:24,694 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1199 transitions. Word has length 102 [2019-09-10 08:17:24,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:24,694 INFO L475 AbstractCegarLoop]: Abstraction has 929 states and 1199 transitions. [2019-09-10 08:17:24,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 08:17:24,694 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1199 transitions. [2019-09-10 08:17:24,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:17:24,696 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:24,696 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:24,696 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:24,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:24,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1027137318, now seen corresponding path program 1 times [2019-09-10 08:17:24,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:24,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:24,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:24,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:24,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:25,412 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:17:25,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:25,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:17:25,412 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:25,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:17:25,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:17:25,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:17:25,413 INFO L87 Difference]: Start difference. First operand 929 states and 1199 transitions. Second operand 17 states. [2019-09-10 08:17:25,987 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 08:17:28,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:28,892 INFO L93 Difference]: Finished difference Result 1794 states and 2382 transitions. [2019-09-10 08:17:28,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:17:28,893 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 102 [2019-09-10 08:17:28,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:28,895 INFO L225 Difference]: With dead ends: 1794 [2019-09-10 08:17:28,895 INFO L226 Difference]: Without dead ends: 1794 [2019-09-10 08:17:28,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:17:28,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1794 states. [2019-09-10 08:17:28,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1794 to 902. [2019-09-10 08:17:28,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2019-09-10 08:17:28,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1159 transitions. [2019-09-10 08:17:28,907 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1159 transitions. Word has length 102 [2019-09-10 08:17:28,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:28,907 INFO L475 AbstractCegarLoop]: Abstraction has 902 states and 1159 transitions. [2019-09-10 08:17:28,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:17:28,908 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1159 transitions. [2019-09-10 08:17:28,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:17:28,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:28,909 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:28,910 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:28,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:28,910 INFO L82 PathProgramCache]: Analyzing trace with hash 372185749, now seen corresponding path program 1 times [2019-09-10 08:17:28,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:28,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:28,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:28,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:28,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:29,619 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:17:29,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:29,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:17:29,619 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:29,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:17:29,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:17:29,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:17:29,620 INFO L87 Difference]: Start difference. First operand 902 states and 1159 transitions. Second operand 16 states. [2019-09-10 08:17:30,258 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-10 08:17:30,509 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 08:17:33,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:33,636 INFO L93 Difference]: Finished difference Result 1390 states and 1757 transitions. [2019-09-10 08:17:33,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:17:33,636 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 102 [2019-09-10 08:17:33,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:33,638 INFO L225 Difference]: With dead ends: 1390 [2019-09-10 08:17:33,638 INFO L226 Difference]: Without dead ends: 1390 [2019-09-10 08:17:33,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:17:33,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2019-09-10 08:17:33,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 908. [2019-09-10 08:17:33,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 908 states. [2019-09-10 08:17:33,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1167 transitions. [2019-09-10 08:17:33,649 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1167 transitions. Word has length 102 [2019-09-10 08:17:33,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:33,649 INFO L475 AbstractCegarLoop]: Abstraction has 908 states and 1167 transitions. [2019-09-10 08:17:33,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:17:33,650 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1167 transitions. [2019-09-10 08:17:33,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:17:33,651 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:33,651 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:33,651 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:33,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:33,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1173487299, now seen corresponding path program 1 times [2019-09-10 08:17:33,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:33,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:33,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:33,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:33,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:34,924 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:17:34,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:34,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:17:34,924 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:34,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:17:34,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:17:34,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:17:34,925 INFO L87 Difference]: Start difference. First operand 908 states and 1167 transitions. Second operand 22 states. [2019-09-10 08:17:35,916 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 75 [2019-09-10 08:17:36,155 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-09-10 08:17:36,459 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 82 [2019-09-10 08:17:36,633 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-09-10 08:17:39,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:39,284 INFO L93 Difference]: Finished difference Result 1364 states and 1786 transitions. [2019-09-10 08:17:39,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:17:39,285 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 102 [2019-09-10 08:17:39,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:39,287 INFO L225 Difference]: With dead ends: 1364 [2019-09-10 08:17:39,287 INFO L226 Difference]: Without dead ends: 1364 [2019-09-10 08:17:39,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=204, Invalid=788, Unknown=0, NotChecked=0, Total=992 [2019-09-10 08:17:39,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2019-09-10 08:17:39,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 920. [2019-09-10 08:17:39,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 920 states. [2019-09-10 08:17:39,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1179 transitions. [2019-09-10 08:17:39,296 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1179 transitions. Word has length 102 [2019-09-10 08:17:39,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:39,296 INFO L475 AbstractCegarLoop]: Abstraction has 920 states and 1179 transitions. [2019-09-10 08:17:39,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:17:39,296 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1179 transitions. [2019-09-10 08:17:39,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:17:39,297 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:39,297 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:39,298 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:39,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:39,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1827059128, now seen corresponding path program 1 times [2019-09-10 08:17:39,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:39,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:39,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:39,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:39,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:40,614 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-09-10 08:17:41,863 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:17:41,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:41,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-10 08:17:41,863 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:41,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 08:17:41,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 08:17:41,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=838, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:17:41,864 INFO L87 Difference]: Start difference. First operand 920 states and 1179 transitions. Second operand 31 states. [2019-09-10 08:17:42,079 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-09-10 08:17:43,183 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 42 [2019-09-10 08:17:43,376 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2019-09-10 08:17:43,665 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-10 08:17:44,099 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-09-10 08:17:44,478 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 87 [2019-09-10 08:17:44,955 WARN L188 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 98 [2019-09-10 08:17:45,664 WARN L188 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 123 [2019-09-10 08:17:45,962 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 78 [2019-09-10 08:17:46,242 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 78 [2019-09-10 08:17:46,567 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 81 [2019-09-10 08:17:46,910 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 83 [2019-09-10 08:17:47,512 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-09-10 08:17:47,930 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2019-09-10 08:17:48,302 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-09-10 08:17:48,671 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-09-10 08:17:49,407 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-09-10 08:18:00,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:00,074 INFO L93 Difference]: Finished difference Result 1935 states and 2467 transitions. [2019-09-10 08:18:00,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 08:18:00,075 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 102 [2019-09-10 08:18:00,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:00,077 INFO L225 Difference]: With dead ends: 1935 [2019-09-10 08:18:00,077 INFO L226 Difference]: Without dead ends: 1935 [2019-09-10 08:18:00,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=707, Invalid=2599, Unknown=0, NotChecked=0, Total=3306 [2019-09-10 08:18:00,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2019-09-10 08:18:00,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 931. [2019-09-10 08:18:00,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2019-09-10 08:18:00,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1191 transitions. [2019-09-10 08:18:00,087 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1191 transitions. Word has length 102 [2019-09-10 08:18:00,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:00,087 INFO L475 AbstractCegarLoop]: Abstraction has 931 states and 1191 transitions. [2019-09-10 08:18:00,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 08:18:00,088 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1191 transitions. [2019-09-10 08:18:00,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:18:00,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:00,089 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:18:00,089 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:00,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:00,089 INFO L82 PathProgramCache]: Analyzing trace with hash -337214839, now seen corresponding path program 1 times [2019-09-10 08:18:00,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:00,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:00,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:00,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:00,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:00,802 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:18:00,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:00,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:18:00,802 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:00,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:18:00,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:18:00,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:18:00,803 INFO L87 Difference]: Start difference. First operand 931 states and 1191 transitions. Second operand 17 states. [2019-09-10 08:18:01,430 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:18:03,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:03,545 INFO L93 Difference]: Finished difference Result 1772 states and 2344 transitions. [2019-09-10 08:18:03,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:18:03,545 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 102 [2019-09-10 08:18:03,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:03,548 INFO L225 Difference]: With dead ends: 1772 [2019-09-10 08:18:03,548 INFO L226 Difference]: Without dead ends: 1772 [2019-09-10 08:18:03,548 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:18:03,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1772 states. [2019-09-10 08:18:03,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1772 to 884. [2019-09-10 08:18:03,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 884 states. [2019-09-10 08:18:03,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1127 transitions. [2019-09-10 08:18:03,558 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1127 transitions. Word has length 102 [2019-09-10 08:18:03,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:03,558 INFO L475 AbstractCegarLoop]: Abstraction has 884 states and 1127 transitions. [2019-09-10 08:18:03,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:18:03,559 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1127 transitions. [2019-09-10 08:18:03,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:18:03,560 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:03,560 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:18:03,560 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:03,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:03,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1275780606, now seen corresponding path program 1 times [2019-09-10 08:18:03,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:03,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:03,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:03,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:03,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:03,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:04,498 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:18:04,648 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-09-10 08:18:04,836 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-10 08:18:06,202 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:18:06,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:06,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2019-09-10 08:18:06,203 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:06,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-10 08:18:06,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-10 08:18:06,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-09-10 08:18:06,204 INFO L87 Difference]: Start difference. First operand 884 states and 1127 transitions. Second operand 30 states. [2019-09-10 08:18:06,398 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-09-10 08:18:07,479 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-09-10 08:18:07,748 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-10 08:18:08,162 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2019-09-10 08:18:08,472 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 78 [2019-09-10 08:18:08,852 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 86 [2019-09-10 08:18:09,298 WARN L188 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 94 [2019-09-10 08:18:09,571 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-09-10 08:18:09,840 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-09-10 08:18:10,103 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-09-10 08:18:10,349 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-09-10 08:18:10,591 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-09-10 08:18:11,005 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2019-09-10 08:18:20,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:20,624 INFO L93 Difference]: Finished difference Result 1459 states and 1899 transitions. [2019-09-10 08:18:20,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 08:18:20,625 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 102 [2019-09-10 08:18:20,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:20,627 INFO L225 Difference]: With dead ends: 1459 [2019-09-10 08:18:20,627 INFO L226 Difference]: Without dead ends: 1459 [2019-09-10 08:18:20,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=549, Invalid=2001, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 08:18:20,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2019-09-10 08:18:20,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 900. [2019-09-10 08:18:20,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2019-09-10 08:18:20,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1145 transitions. [2019-09-10 08:18:20,638 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1145 transitions. Word has length 102 [2019-09-10 08:18:20,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:20,638 INFO L475 AbstractCegarLoop]: Abstraction has 900 states and 1145 transitions. [2019-09-10 08:18:20,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-10 08:18:20,638 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1145 transitions. [2019-09-10 08:18:20,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:18:20,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:20,640 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:18:20,641 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:20,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:20,641 INFO L82 PathProgramCache]: Analyzing trace with hash 818309933, now seen corresponding path program 1 times [2019-09-10 08:18:20,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:20,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:20,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:20,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:20,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:21,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:18:21,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:21,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 08:18:21,613 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:21,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:18:21,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:18:21,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:18:21,614 INFO L87 Difference]: Start difference. First operand 900 states and 1145 transitions. Second operand 20 states. [2019-09-10 08:18:22,518 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-09-10 08:18:22,743 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 67 [2019-09-10 08:18:22,915 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-09-10 08:18:23,085 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-09-10 08:18:23,244 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-10 08:18:23,394 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-10 08:18:23,533 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-10 08:18:23,753 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-09-10 08:18:26,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:26,268 INFO L93 Difference]: Finished difference Result 1304 states and 1705 transitions. [2019-09-10 08:18:26,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 08:18:26,269 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 102 [2019-09-10 08:18:26,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:26,271 INFO L225 Difference]: With dead ends: 1304 [2019-09-10 08:18:26,271 INFO L226 Difference]: Without dead ends: 1304 [2019-09-10 08:18:26,271 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=297, Invalid=893, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 08:18:26,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2019-09-10 08:18:26,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 890. [2019-09-10 08:18:26,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2019-09-10 08:18:26,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1133 transitions. [2019-09-10 08:18:26,280 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1133 transitions. Word has length 102 [2019-09-10 08:18:26,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:26,280 INFO L475 AbstractCegarLoop]: Abstraction has 890 states and 1133 transitions. [2019-09-10 08:18:26,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 08:18:26,280 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1133 transitions. [2019-09-10 08:18:26,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:18:26,281 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:26,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:18:26,281 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:26,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:26,282 INFO L82 PathProgramCache]: Analyzing trace with hash 2057276911, now seen corresponding path program 1 times [2019-09-10 08:18:26,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:26,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:26,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:26,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:26,283 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:26,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:27,398 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 08:18:27,548 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:18:27,708 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 08:18:27,860 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-10 08:18:29,174 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:18:29,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:29,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2019-09-10 08:18:29,174 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:29,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-10 08:18:29,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-10 08:18:29,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=895, Unknown=0, NotChecked=0, Total=992 [2019-09-10 08:18:29,175 INFO L87 Difference]: Start difference. First operand 890 states and 1133 transitions. Second operand 32 states. [2019-09-10 08:18:29,377 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 44 [2019-09-10 08:18:30,520 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 42 [2019-09-10 08:18:30,746 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 47 [2019-09-10 08:18:31,427 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 97 [2019-09-10 08:18:31,834 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 86 [2019-09-10 08:18:32,337 WARN L188 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 100 [2019-09-10 08:18:32,939 WARN L188 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 113 [2019-09-10 08:18:33,636 WARN L188 SmtUtils]: Spent 621.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 128 [2019-09-10 08:18:33,935 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 76 [2019-09-10 08:18:34,275 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 68 [2019-09-10 08:18:34,587 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 67 [2019-09-10 08:18:34,883 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 64 [2019-09-10 08:18:35,167 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 64 [2019-09-10 08:18:35,596 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 57 [2019-09-10 08:18:43,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:43,981 INFO L93 Difference]: Finished difference Result 1166 states and 1489 transitions. [2019-09-10 08:18:43,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 08:18:43,982 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 102 [2019-09-10 08:18:43,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:43,983 INFO L225 Difference]: With dead ends: 1166 [2019-09-10 08:18:43,983 INFO L226 Difference]: Without dead ends: 1166 [2019-09-10 08:18:43,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=572, Invalid=2184, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 08:18:43,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2019-09-10 08:18:43,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 906. [2019-09-10 08:18:43,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-09-10 08:18:43,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1151 transitions. [2019-09-10 08:18:43,991 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1151 transitions. Word has length 102 [2019-09-10 08:18:43,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:43,991 INFO L475 AbstractCegarLoop]: Abstraction has 906 states and 1151 transitions. [2019-09-10 08:18:43,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-10 08:18:43,992 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1151 transitions. [2019-09-10 08:18:43,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:18:43,993 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:43,993 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:18:43,993 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:43,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:43,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1985149574, now seen corresponding path program 1 times [2019-09-10 08:18:43,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:43,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:43,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:43,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:43,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:44,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:44,690 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:18:44,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:44,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:18:44,691 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:44,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:18:44,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:18:44,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:18:44,692 INFO L87 Difference]: Start difference. First operand 906 states and 1151 transitions. Second operand 17 states. [2019-09-10 08:18:45,320 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 08:18:48,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:48,970 INFO L93 Difference]: Finished difference Result 1676 states and 2209 transitions. [2019-09-10 08:18:48,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:18:48,971 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 102 [2019-09-10 08:18:48,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:48,973 INFO L225 Difference]: With dead ends: 1676 [2019-09-10 08:18:48,973 INFO L226 Difference]: Without dead ends: 1676 [2019-09-10 08:18:48,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:18:48,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2019-09-10 08:18:48,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 906. [2019-09-10 08:18:48,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-09-10 08:18:48,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1149 transitions. [2019-09-10 08:18:48,983 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1149 transitions. Word has length 102 [2019-09-10 08:18:48,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:48,984 INFO L475 AbstractCegarLoop]: Abstraction has 906 states and 1149 transitions. [2019-09-10 08:18:48,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:18:48,984 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1149 transitions. [2019-09-10 08:18:48,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:18:48,985 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:48,985 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:18:48,985 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:48,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:48,985 INFO L82 PathProgramCache]: Analyzing trace with hash 578828359, now seen corresponding path program 1 times [2019-09-10 08:18:48,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:48,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:48,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:48,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:48,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:49,702 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:18:49,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:49,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:18:49,703 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:49,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:18:49,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:18:49,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:18:49,703 INFO L87 Difference]: Start difference. First operand 906 states and 1149 transitions. Second operand 17 states. [2019-09-10 08:18:50,257 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 08:18:51,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:51,687 INFO L93 Difference]: Finished difference Result 1209 states and 1594 transitions. [2019-09-10 08:18:51,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:18:51,688 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 102 [2019-09-10 08:18:51,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:51,689 INFO L225 Difference]: With dead ends: 1209 [2019-09-10 08:18:51,690 INFO L226 Difference]: Without dead ends: 1209 [2019-09-10 08:18:51,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:18:51,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2019-09-10 08:18:51,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 850. [2019-09-10 08:18:51,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2019-09-10 08:18:51,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1075 transitions. [2019-09-10 08:18:51,697 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1075 transitions. Word has length 102 [2019-09-10 08:18:51,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:51,697 INFO L475 AbstractCegarLoop]: Abstraction has 850 states and 1075 transitions. [2019-09-10 08:18:51,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:18:51,698 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1075 transitions. [2019-09-10 08:18:51,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:18:51,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:51,699 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] [2019-09-10 08:18:51,699 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:51,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:51,699 INFO L82 PathProgramCache]: Analyzing trace with hash 2017856453, now seen corresponding path program 1 times [2019-09-10 08:18:51,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:51,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:51,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:51,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:51,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:51,859 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:18:51,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:51,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:51,860 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:51,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:51,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:51,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:51,861 INFO L87 Difference]: Start difference. First operand 850 states and 1075 transitions. Second operand 9 states. [2019-09-10 08:18:53,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:53,662 INFO L93 Difference]: Finished difference Result 1527 states and 2017 transitions. [2019-09-10 08:18:53,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:53,663 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-10 08:18:53,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:53,665 INFO L225 Difference]: With dead ends: 1527 [2019-09-10 08:18:53,665 INFO L226 Difference]: Without dead ends: 1527 [2019-09-10 08:18:53,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:18:53,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2019-09-10 08:18:53,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 850. [2019-09-10 08:18:53,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2019-09-10 08:18:53,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1072 transitions. [2019-09-10 08:18:53,675 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1072 transitions. Word has length 103 [2019-09-10 08:18:53,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:53,676 INFO L475 AbstractCegarLoop]: Abstraction has 850 states and 1072 transitions. [2019-09-10 08:18:53,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:53,676 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1072 transitions. [2019-09-10 08:18:53,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:18:53,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:53,677 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] [2019-09-10 08:18:53,677 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:53,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:53,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1724675309, now seen corresponding path program 1 times [2019-09-10 08:18:53,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:53,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:53,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:53,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:53,679 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:53,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:18:53,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:53,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:53,968 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:53,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:53,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:53,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:53,969 INFO L87 Difference]: Start difference. First operand 850 states and 1072 transitions. Second operand 9 states. [2019-09-10 08:18:55,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:55,792 INFO L93 Difference]: Finished difference Result 1493 states and 1965 transitions. [2019-09-10 08:18:55,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:55,793 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-10 08:18:55,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:55,795 INFO L225 Difference]: With dead ends: 1493 [2019-09-10 08:18:55,795 INFO L226 Difference]: Without dead ends: 1493 [2019-09-10 08:18:55,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:18:55,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2019-09-10 08:18:55,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 850. [2019-09-10 08:18:55,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2019-09-10 08:18:55,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1069 transitions. [2019-09-10 08:18:55,804 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1069 transitions. Word has length 103 [2019-09-10 08:18:55,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:55,804 INFO L475 AbstractCegarLoop]: Abstraction has 850 states and 1069 transitions. [2019-09-10 08:18:55,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:55,804 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1069 transitions. [2019-09-10 08:18:55,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:18:55,805 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:55,805 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] [2019-09-10 08:18:55,805 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:55,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:55,806 INFO L82 PathProgramCache]: Analyzing trace with hash -193101075, now seen corresponding path program 1 times [2019-09-10 08:18:55,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:55,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:55,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:55,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:55,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:56,239 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:18:56,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:56,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:18:56,239 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:56,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:18:56,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:18:56,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:18:56,240 INFO L87 Difference]: Start difference. First operand 850 states and 1069 transitions. Second operand 12 states. [2019-09-10 08:18:56,642 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2019-09-10 08:18:56,758 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2019-09-10 08:18:57,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:57,634 INFO L93 Difference]: Finished difference Result 1873 states and 2519 transitions. [2019-09-10 08:18:57,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:18:57,634 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 103 [2019-09-10 08:18:57,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:57,636 INFO L225 Difference]: With dead ends: 1873 [2019-09-10 08:18:57,636 INFO L226 Difference]: Without dead ends: 1873 [2019-09-10 08:18:57,636 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:18:57,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2019-09-10 08:18:57,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 816. [2019-09-10 08:18:57,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816 states. [2019-09-10 08:18:57,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1027 transitions. [2019-09-10 08:18:57,644 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1027 transitions. Word has length 103 [2019-09-10 08:18:57,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:57,645 INFO L475 AbstractCegarLoop]: Abstraction has 816 states and 1027 transitions. [2019-09-10 08:18:57,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:18:57,645 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1027 transitions. [2019-09-10 08:18:57,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:18:57,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:57,646 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] [2019-09-10 08:18:57,646 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:57,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:57,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1298823277, now seen corresponding path program 1 times [2019-09-10 08:18:57,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:57,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:57,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:57,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:57,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:57,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:57,973 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:18:57,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:57,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 08:18:57,973 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:57,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 08:18:57,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 08:18:57,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:18:57,974 INFO L87 Difference]: Start difference. First operand 816 states and 1027 transitions. Second operand 11 states. [2019-09-10 08:18:59,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:59,229 INFO L93 Difference]: Finished difference Result 2231 states and 3074 transitions. [2019-09-10 08:18:59,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:59,229 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 103 [2019-09-10 08:18:59,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:59,232 INFO L225 Difference]: With dead ends: 2231 [2019-09-10 08:18:59,232 INFO L226 Difference]: Without dead ends: 2231 [2019-09-10 08:18:59,233 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:18:59,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2019-09-10 08:18:59,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 774. [2019-09-10 08:18:59,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-09-10 08:18:59,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 974 transitions. [2019-09-10 08:18:59,243 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 974 transitions. Word has length 103 [2019-09-10 08:18:59,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:59,243 INFO L475 AbstractCegarLoop]: Abstraction has 774 states and 974 transitions. [2019-09-10 08:18:59,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 08:18:59,243 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 974 transitions. [2019-09-10 08:18:59,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:18:59,244 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:59,244 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:59,245 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:59,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:59,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1405459957, now seen corresponding path program 1 times [2019-09-10 08:18:59,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:59,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:59,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:59,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:59,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:59,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:59,990 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:18:59,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:59,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:18:59,991 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:59,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:18:59,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:18:59,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:18:59,992 INFO L87 Difference]: Start difference. First operand 774 states and 974 transitions. Second operand 17 states. [2019-09-10 08:19:00,574 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-10 08:19:00,727 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:19:02,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:02,458 INFO L93 Difference]: Finished difference Result 1425 states and 1890 transitions. [2019-09-10 08:19:02,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:19:02,459 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 103 [2019-09-10 08:19:02,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:02,461 INFO L225 Difference]: With dead ends: 1425 [2019-09-10 08:19:02,461 INFO L226 Difference]: Without dead ends: 1425 [2019-09-10 08:19:02,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:19:02,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2019-09-10 08:19:02,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 730. [2019-09-10 08:19:02,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2019-09-10 08:19:02,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 921 transitions. [2019-09-10 08:19:02,470 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 921 transitions. Word has length 103 [2019-09-10 08:19:02,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:02,470 INFO L475 AbstractCegarLoop]: Abstraction has 730 states and 921 transitions. [2019-09-10 08:19:02,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:19:02,470 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 921 transitions. [2019-09-10 08:19:02,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:19:02,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:02,471 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] [2019-09-10 08:19:02,471 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:02,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:02,471 INFO L82 PathProgramCache]: Analyzing trace with hash -2048395954, now seen corresponding path program 1 times [2019-09-10 08:19:02,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:02,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:02,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:02,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:02,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:03,702 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:19:03,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:03,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:19:03,702 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:03,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:19:03,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:19:03,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:19:03,703 INFO L87 Difference]: Start difference. First operand 730 states and 921 transitions. Second operand 21 states. [2019-09-10 08:19:04,760 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 41 [2019-09-10 08:19:05,017 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 64 [2019-09-10 08:19:05,210 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-09-10 08:19:05,396 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-09-10 08:19:09,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:09,177 INFO L93 Difference]: Finished difference Result 946 states and 1190 transitions. [2019-09-10 08:19:09,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:19:09,177 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 103 [2019-09-10 08:19:09,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:09,179 INFO L225 Difference]: With dead ends: 946 [2019-09-10 08:19:09,179 INFO L226 Difference]: Without dead ends: 946 [2019-09-10 08:19:09,179 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=227, Invalid=1033, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 08:19:09,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2019-09-10 08:19:09,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 752. [2019-09-10 08:19:09,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2019-09-10 08:19:09,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 949 transitions. [2019-09-10 08:19:09,185 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 949 transitions. Word has length 103 [2019-09-10 08:19:09,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:09,185 INFO L475 AbstractCegarLoop]: Abstraction has 752 states and 949 transitions. [2019-09-10 08:19:09,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:19:09,186 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 949 transitions. [2019-09-10 08:19:09,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:19:09,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:09,187 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] [2019-09-10 08:19:09,187 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:09,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:09,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1914956223, now seen corresponding path program 1 times [2019-09-10 08:19:09,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:09,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:09,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:09,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:09,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:09,518 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:19:09,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:09,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 08:19:09,519 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:09,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 08:19:09,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 08:19:09,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:19:09,519 INFO L87 Difference]: Start difference. First operand 752 states and 949 transitions. Second operand 11 states. [2019-09-10 08:19:10,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:10,630 INFO L93 Difference]: Finished difference Result 2115 states and 2936 transitions. [2019-09-10 08:19:10,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:19:10,630 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 103 [2019-09-10 08:19:10,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:10,633 INFO L225 Difference]: With dead ends: 2115 [2019-09-10 08:19:10,633 INFO L226 Difference]: Without dead ends: 2115 [2019-09-10 08:19:10,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:19:10,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2115 states. [2019-09-10 08:19:10,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2115 to 732. [2019-09-10 08:19:10,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2019-09-10 08:19:10,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 921 transitions. [2019-09-10 08:19:10,643 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 921 transitions. Word has length 103 [2019-09-10 08:19:10,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:10,644 INFO L475 AbstractCegarLoop]: Abstraction has 732 states and 921 transitions. [2019-09-10 08:19:10,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 08:19:10,644 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 921 transitions. [2019-09-10 08:19:10,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:19:10,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:10,644 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] [2019-09-10 08:19:10,645 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:10,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:10,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1049847790, now seen corresponding path program 1 times [2019-09-10 08:19:10,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:10,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:10,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:10,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:10,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:10,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:11,338 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:19:11,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:11,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:19:11,338 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:11,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:19:11,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:19:11,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:19:11,339 INFO L87 Difference]: Start difference. First operand 732 states and 921 transitions. Second operand 17 states. [2019-09-10 08:19:11,895 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 08:19:12,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:12,819 INFO L93 Difference]: Finished difference Result 954 states and 1252 transitions. [2019-09-10 08:19:12,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 08:19:12,819 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 103 [2019-09-10 08:19:12,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:12,821 INFO L225 Difference]: With dead ends: 954 [2019-09-10 08:19:12,821 INFO L226 Difference]: Without dead ends: 954 [2019-09-10 08:19:12,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:19:12,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2019-09-10 08:19:12,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 666. [2019-09-10 08:19:12,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2019-09-10 08:19:12,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 840 transitions. [2019-09-10 08:19:12,828 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 840 transitions. Word has length 103 [2019-09-10 08:19:12,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:12,828 INFO L475 AbstractCegarLoop]: Abstraction has 666 states and 840 transitions. [2019-09-10 08:19:12,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:19:12,828 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 840 transitions. [2019-09-10 08:19:12,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:19:12,829 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:12,829 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] [2019-09-10 08:19:12,829 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:12,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:12,830 INFO L82 PathProgramCache]: Analyzing trace with hash 407007842, now seen corresponding path program 1 times [2019-09-10 08:19:12,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:12,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:12,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:12,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:12,831 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:13,893 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:19:13,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:13,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:19:13,894 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:13,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:19:13,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:19:13,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:19:13,895 INFO L87 Difference]: Start difference. First operand 666 states and 840 transitions. Second operand 21 states. [2019-09-10 08:19:14,894 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-10 08:19:15,190 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-09-10 08:19:15,351 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 08:19:15,502 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 08:19:15,652 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 08:19:17,306 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-10 08:19:20,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:20,198 INFO L93 Difference]: Finished difference Result 1331 states and 1690 transitions. [2019-09-10 08:19:20,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:19:20,198 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 103 [2019-09-10 08:19:20,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:20,200 INFO L225 Difference]: With dead ends: 1331 [2019-09-10 08:19:20,200 INFO L226 Difference]: Without dead ends: 1331 [2019-09-10 08:19:20,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=340, Invalid=1066, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 08:19:20,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2019-09-10 08:19:20,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 665. [2019-09-10 08:19:20,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2019-09-10 08:19:20,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 837 transitions. [2019-09-10 08:19:20,209 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 837 transitions. Word has length 103 [2019-09-10 08:19:20,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:20,209 INFO L475 AbstractCegarLoop]: Abstraction has 665 states and 837 transitions. [2019-09-10 08:19:20,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:19:20,210 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 837 transitions. [2019-09-10 08:19:20,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:19:20,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:20,211 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] [2019-09-10 08:19:20,211 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:20,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:20,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1890101845, now seen corresponding path program 1 times [2019-09-10 08:19:20,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:20,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:20,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:20,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:20,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:20,913 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:19:20,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:20,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:19:20,913 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:20,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:19:20,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:19:20,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:19:20,914 INFO L87 Difference]: Start difference. First operand 665 states and 837 transitions. Second operand 16 states. [2019-09-10 08:19:21,697 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-10 08:19:21,825 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-09-10 08:19:22,033 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-09-10 08:19:22,238 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-10 08:19:23,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:23,942 INFO L93 Difference]: Finished difference Result 1559 states and 2124 transitions. [2019-09-10 08:19:23,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:19:23,943 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 103 [2019-09-10 08:19:23,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:23,945 INFO L225 Difference]: With dead ends: 1559 [2019-09-10 08:19:23,945 INFO L226 Difference]: Without dead ends: 1559 [2019-09-10 08:19:23,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:19:23,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2019-09-10 08:19:23,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 623. [2019-09-10 08:19:23,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-09-10 08:19:23,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 782 transitions. [2019-09-10 08:19:23,955 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 782 transitions. Word has length 103 [2019-09-10 08:19:23,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:23,955 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 782 transitions. [2019-09-10 08:19:23,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:19:23,955 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 782 transitions. [2019-09-10 08:19:23,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:19:23,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:23,957 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] [2019-09-10 08:19:23,957 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:23,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:23,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1989632252, now seen corresponding path program 1 times [2019-09-10 08:19:23,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:23,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:23,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:23,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:23,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:24,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:19:24,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:24,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 08:19:24,500 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:24,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 08:19:24,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 08:19:24,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:19:24,501 INFO L87 Difference]: Start difference. First operand 623 states and 782 transitions. Second operand 15 states. [2019-09-10 08:19:25,033 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 08:19:26,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:26,303 INFO L93 Difference]: Finished difference Result 893 states and 1184 transitions. [2019-09-10 08:19:26,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:19:26,303 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 103 [2019-09-10 08:19:26,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:26,305 INFO L225 Difference]: With dead ends: 893 [2019-09-10 08:19:26,305 INFO L226 Difference]: Without dead ends: 893 [2019-09-10 08:19:26,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:19:26,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2019-09-10 08:19:26,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 563. [2019-09-10 08:19:26,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-09-10 08:19:26,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 709 transitions. [2019-09-10 08:19:26,312 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 709 transitions. Word has length 103 [2019-09-10 08:19:26,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:26,312 INFO L475 AbstractCegarLoop]: Abstraction has 563 states and 709 transitions. [2019-09-10 08:19:26,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 08:19:26,312 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 709 transitions. [2019-09-10 08:19:26,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:19:26,312 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:26,313 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] [2019-09-10 08:19:26,313 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:26,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:26,313 INFO L82 PathProgramCache]: Analyzing trace with hash -57079179, now seen corresponding path program 1 times [2019-09-10 08:19:26,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:26,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:26,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:26,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:26,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:26,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:26,673 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:19:26,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:26,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 08:19:26,673 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:26,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 08:19:26,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 08:19:26,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:19:26,674 INFO L87 Difference]: Start difference. First operand 563 states and 709 transitions. Second operand 11 states. [2019-09-10 08:19:27,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:27,762 INFO L93 Difference]: Finished difference Result 1034 states and 1398 transitions. [2019-09-10 08:19:27,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:19:27,763 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 103 [2019-09-10 08:19:27,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:27,765 INFO L225 Difference]: With dead ends: 1034 [2019-09-10 08:19:27,765 INFO L226 Difference]: Without dead ends: 1034 [2019-09-10 08:19:27,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:19:27,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2019-09-10 08:19:27,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 440. [2019-09-10 08:19:27,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-09-10 08:19:27,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 555 transitions. [2019-09-10 08:19:27,771 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 555 transitions. Word has length 103 [2019-09-10 08:19:27,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:27,772 INFO L475 AbstractCegarLoop]: Abstraction has 440 states and 555 transitions. [2019-09-10 08:19:27,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 08:19:27,772 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 555 transitions. [2019-09-10 08:19:27,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:19:27,772 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:27,772 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] [2019-09-10 08:19:27,773 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:27,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:27,773 INFO L82 PathProgramCache]: Analyzing trace with hash -444576202, now seen corresponding path program 1 times [2019-09-10 08:19:27,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:27,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:27,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:27,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:27,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:27,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:27,892 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:19:27,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:27,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:19:27,892 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:27,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:19:27,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:19:27,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:19:27,893 INFO L87 Difference]: Start difference. First operand 440 states and 555 transitions. Second operand 9 states. [2019-09-10 08:19:28,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:28,934 INFO L93 Difference]: Finished difference Result 974 states and 1321 transitions. [2019-09-10 08:19:28,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:19:28,935 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-10 08:19:28,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:28,936 INFO L225 Difference]: With dead ends: 974 [2019-09-10 08:19:28,936 INFO L226 Difference]: Without dead ends: 974 [2019-09-10 08:19:28,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:19:28,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-09-10 08:19:28,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 440. [2019-09-10 08:19:28,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-09-10 08:19:28,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 552 transitions. [2019-09-10 08:19:28,941 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 552 transitions. Word has length 104 [2019-09-10 08:19:28,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:28,942 INFO L475 AbstractCegarLoop]: Abstraction has 440 states and 552 transitions. [2019-09-10 08:19:28,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:19:28,942 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 552 transitions. [2019-09-10 08:19:28,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:19:28,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:28,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] [2019-09-10 08:19:28,943 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:28,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:28,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1911918420, now seen corresponding path program 1 times [2019-09-10 08:19:28,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:28,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:28,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:28,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:28,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:29,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:29,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:29,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:19:29,076 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:29,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:19:29,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:19:29,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:19:29,077 INFO L87 Difference]: Start difference. First operand 440 states and 552 transitions. Second operand 9 states. [2019-09-10 08:19:29,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:29,950 INFO L93 Difference]: Finished difference Result 678 states and 873 transitions. [2019-09-10 08:19:29,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 08:19:29,951 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-10 08:19:29,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:29,952 INFO L225 Difference]: With dead ends: 678 [2019-09-10 08:19:29,952 INFO L226 Difference]: Without dead ends: 678 [2019-09-10 08:19:29,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:19:29,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2019-09-10 08:19:29,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 440. [2019-09-10 08:19:29,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-09-10 08:19:29,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 550 transitions. [2019-09-10 08:19:29,957 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 550 transitions. Word has length 104 [2019-09-10 08:19:29,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:29,957 INFO L475 AbstractCegarLoop]: Abstraction has 440 states and 550 transitions. [2019-09-10 08:19:29,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:19:29,957 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 550 transitions. [2019-09-10 08:19:29,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:19:29,957 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:29,958 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] [2019-09-10 08:19:29,958 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:29,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:29,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1218168555, now seen corresponding path program 1 times [2019-09-10 08:19:29,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:29,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:29,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:29,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:29,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:30,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:19:30,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:30,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:19:30,457 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:30,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:19:30,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:19:30,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:19:30,457 INFO L87 Difference]: Start difference. First operand 440 states and 550 transitions. Second operand 13 states. [2019-09-10 08:19:31,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:31,140 INFO L93 Difference]: Finished difference Result 605 states and 792 transitions. [2019-09-10 08:19:31,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 08:19:31,140 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 104 [2019-09-10 08:19:31,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:31,141 INFO L225 Difference]: With dead ends: 605 [2019-09-10 08:19:31,141 INFO L226 Difference]: Without dead ends: 605 [2019-09-10 08:19:31,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:19:31,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-09-10 08:19:31,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 369. [2019-09-10 08:19:31,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-09-10 08:19:31,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 469 transitions. [2019-09-10 08:19:31,146 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 469 transitions. Word has length 104 [2019-09-10 08:19:31,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:31,146 INFO L475 AbstractCegarLoop]: Abstraction has 369 states and 469 transitions. [2019-09-10 08:19:31,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:19:31,146 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 469 transitions. [2019-09-10 08:19:31,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:19:31,147 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:31,147 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] [2019-09-10 08:19:31,147 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:31,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:31,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1690908129, now seen corresponding path program 1 times [2019-09-10 08:19:31,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:31,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:31,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:31,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:31,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:31,505 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:19:31,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:31,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 08:19:31,505 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:31,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 08:19:31,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 08:19:31,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:19:31,506 INFO L87 Difference]: Start difference. First operand 369 states and 469 transitions. Second operand 11 states. [2019-09-10 08:19:31,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:31,999 INFO L93 Difference]: Finished difference Result 919 states and 1258 transitions. [2019-09-10 08:19:31,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 08:19:32,000 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 104 [2019-09-10 08:19:32,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:32,001 INFO L225 Difference]: With dead ends: 919 [2019-09-10 08:19:32,001 INFO L226 Difference]: Without dead ends: 919 [2019-09-10 08:19:32,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:19:32,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2019-09-10 08:19:32,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 301. [2019-09-10 08:19:32,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-09-10 08:19:32,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 389 transitions. [2019-09-10 08:19:32,007 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 389 transitions. Word has length 104 [2019-09-10 08:19:32,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:32,008 INFO L475 AbstractCegarLoop]: Abstraction has 301 states and 389 transitions. [2019-09-10 08:19:32,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 08:19:32,008 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 389 transitions. [2019-09-10 08:19:32,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:19:32,009 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:32,009 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] [2019-09-10 08:19:32,009 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:32,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:32,009 INFO L82 PathProgramCache]: Analyzing trace with hash -450268320, now seen corresponding path program 1 times [2019-09-10 08:19:32,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:32,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:32,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:32,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:32,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:33,526 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:19:33,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:33,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2019-09-10 08:19:33,527 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:33,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-10 08:19:33,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-10 08:19:33,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=948, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 08:19:33,528 INFO L87 Difference]: Start difference. First operand 301 states and 389 transitions. Second operand 33 states. [2019-09-10 08:19:34,021 WARN L188 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 117 [2019-09-10 08:19:35,424 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-10 08:19:35,659 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2019-09-10 08:19:35,957 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-10 08:19:36,313 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-09-10 08:19:36,740 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 95 [2019-09-10 08:19:36,959 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-09-10 08:19:37,173 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-09-10 08:19:39,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:39,704 INFO L93 Difference]: Finished difference Result 1098 states and 1561 transitions. [2019-09-10 08:19:39,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 08:19:39,704 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 105 [2019-09-10 08:19:39,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:39,706 INFO L225 Difference]: With dead ends: 1098 [2019-09-10 08:19:39,706 INFO L226 Difference]: Without dead ends: 1098 [2019-09-10 08:19:39,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=592, Invalid=3190, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 08:19:39,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2019-09-10 08:19:39,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 322. [2019-09-10 08:19:39,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-09-10 08:19:39,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 415 transitions. [2019-09-10 08:19:39,713 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 415 transitions. Word has length 105 [2019-09-10 08:19:39,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:39,713 INFO L475 AbstractCegarLoop]: Abstraction has 322 states and 415 transitions. [2019-09-10 08:19:39,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-10 08:19:39,713 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 415 transitions. [2019-09-10 08:19:39,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:19:39,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:39,714 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] [2019-09-10 08:19:39,714 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:39,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:39,714 INFO L82 PathProgramCache]: Analyzing trace with hash -2121176506, now seen corresponding path program 1 times [2019-09-10 08:19:39,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:39,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:39,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:39,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:39,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:40,354 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:19:40,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:40,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:19:40,355 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:40,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:19:40,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:19:40,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:19:40,356 INFO L87 Difference]: Start difference. First operand 322 states and 415 transitions. Second operand 16 states. [2019-09-10 08:19:41,506 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-10 08:19:42,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:42,563 INFO L93 Difference]: Finished difference Result 996 states and 1395 transitions. [2019-09-10 08:19:42,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:19:42,563 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 106 [2019-09-10 08:19:42,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:42,565 INFO L225 Difference]: With dead ends: 996 [2019-09-10 08:19:42,565 INFO L226 Difference]: Without dead ends: 996 [2019-09-10 08:19:42,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=172, Invalid=584, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:19:42,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2019-09-10 08:19:42,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 328. [2019-09-10 08:19:42,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-09-10 08:19:42,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 423 transitions. [2019-09-10 08:19:42,570 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 423 transitions. Word has length 106 [2019-09-10 08:19:42,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:42,571 INFO L475 AbstractCegarLoop]: Abstraction has 328 states and 423 transitions. [2019-09-10 08:19:42,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:19:42,571 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 423 transitions. [2019-09-10 08:19:42,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:19:42,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:42,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, 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:19:42,572 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:42,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:42,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1287854380, now seen corresponding path program 1 times [2019-09-10 08:19:42,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:42,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:42,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:42,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:42,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:44,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:19:44,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:44,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 08:19:44,334 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:44,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 08:19:44,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 08:19:44,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:19:44,334 INFO L87 Difference]: Start difference. First operand 328 states and 423 transitions. Second operand 26 states. [2019-09-10 08:19:44,492 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2019-09-10 08:19:45,657 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-09-10 08:19:45,923 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-09-10 08:19:46,217 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 68 [2019-09-10 08:19:46,597 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2019-09-10 08:19:46,831 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2019-09-10 08:19:47,059 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2019-09-10 08:19:48,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:48,721 INFO L93 Difference]: Finished difference Result 677 states and 927 transitions. [2019-09-10 08:19:48,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:19:48,722 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 106 [2019-09-10 08:19:48,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:48,723 INFO L225 Difference]: With dead ends: 677 [2019-09-10 08:19:48,723 INFO L226 Difference]: Without dead ends: 677 [2019-09-10 08:19:48,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=321, Invalid=1319, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 08:19:48,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-09-10 08:19:48,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 329. [2019-09-10 08:19:48,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-09-10 08:19:48,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 424 transitions. [2019-09-10 08:19:48,728 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 424 transitions. Word has length 106 [2019-09-10 08:19:48,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:48,728 INFO L475 AbstractCegarLoop]: Abstraction has 329 states and 424 transitions. [2019-09-10 08:19:48,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 08:19:48,729 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 424 transitions. [2019-09-10 08:19:48,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:19:48,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:48,729 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] [2019-09-10 08:19:48,729 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:48,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:48,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1850721926, now seen corresponding path program 1 times [2019-09-10 08:19:48,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:48,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:48,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:48,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:48,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:49,869 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:19:49,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:49,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:19:49,869 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:49,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:19:49,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:19:49,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:19:49,870 INFO L87 Difference]: Start difference. First operand 329 states and 424 transitions. Second operand 21 states. [2019-09-10 08:19:50,925 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-09-10 08:19:51,201 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 71 [2019-09-10 08:19:51,385 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-10 08:19:51,553 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-10 08:19:52,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:52,488 INFO L93 Difference]: Finished difference Result 665 states and 914 transitions. [2019-09-10 08:19:52,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 08:19:52,489 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 106 [2019-09-10 08:19:52,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:52,490 INFO L225 Difference]: With dead ends: 665 [2019-09-10 08:19:52,491 INFO L226 Difference]: Without dead ends: 665 [2019-09-10 08:19:52,491 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=219, Invalid=837, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 08:19:52,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2019-09-10 08:19:52,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 330. [2019-09-10 08:19:52,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-09-10 08:19:52,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 425 transitions. [2019-09-10 08:19:52,496 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 425 transitions. Word has length 106 [2019-09-10 08:19:52,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:52,496 INFO L475 AbstractCegarLoop]: Abstraction has 330 states and 425 transitions. [2019-09-10 08:19:52,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:19:52,496 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 425 transitions. [2019-09-10 08:19:52,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:19:52,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:52,497 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] [2019-09-10 08:19:52,497 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:52,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:52,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1866671309, now seen corresponding path program 1 times [2019-09-10 08:19:52,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:52,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:52,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:52,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:52,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:52,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:53,136 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:19:53,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:53,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:19:53,136 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:53,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:19:53,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:19:53,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:19:53,137 INFO L87 Difference]: Start difference. First operand 330 states and 425 transitions. Second operand 16 states. [2019-09-10 08:19:53,805 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-10 08:19:55,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:55,259 INFO L93 Difference]: Finished difference Result 1105 states and 1571 transitions. [2019-09-10 08:19:55,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:19:55,259 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 106 [2019-09-10 08:19:55,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:55,260 INFO L225 Difference]: With dead ends: 1105 [2019-09-10 08:19:55,260 INFO L226 Difference]: Without dead ends: 1105 [2019-09-10 08:19:55,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:19:55,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2019-09-10 08:19:55,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 307. [2019-09-10 08:19:55,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-09-10 08:19:55,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 396 transitions. [2019-09-10 08:19:55,265 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 396 transitions. Word has length 106 [2019-09-10 08:19:55,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:55,265 INFO L475 AbstractCegarLoop]: Abstraction has 307 states and 396 transitions. [2019-09-10 08:19:55,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:19:55,265 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 396 transitions. [2019-09-10 08:19:55,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:19:55,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:55,266 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] [2019-09-10 08:19:55,266 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:55,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:55,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1064534923, now seen corresponding path program 1 times [2019-09-10 08:19:55,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:55,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:55,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:55,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:55,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:57,046 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:19:57,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:57,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-09-10 08:19:57,046 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:57,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 08:19:57,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 08:19:57,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=690, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:19:57,047 INFO L87 Difference]: Start difference. First operand 307 states and 396 transitions. Second operand 28 states. [2019-09-10 08:19:58,366 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:19:58,632 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 08:19:58,953 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2019-09-10 08:19:59,338 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 82 [2019-09-10 08:19:59,791 WARN L188 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 94 [2019-09-10 08:19:59,994 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-10 08:20:00,201 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-10 08:20:02,533 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-09-10 08:20:03,615 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-10 08:20:09,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:09,864 INFO L93 Difference]: Finished difference Result 2299 states and 3268 transitions. [2019-09-10 08:20:09,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 08:20:09,864 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 106 [2019-09-10 08:20:09,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:09,866 INFO L225 Difference]: With dead ends: 2299 [2019-09-10 08:20:09,866 INFO L226 Difference]: Without dead ends: 2299 [2019-09-10 08:20:09,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=442, Invalid=2638, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 08:20:09,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2299 states. [2019-09-10 08:20:09,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2299 to 322. [2019-09-10 08:20:09,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-09-10 08:20:09,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 414 transitions. [2019-09-10 08:20:09,873 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 414 transitions. Word has length 106 [2019-09-10 08:20:09,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:09,873 INFO L475 AbstractCegarLoop]: Abstraction has 322 states and 414 transitions. [2019-09-10 08:20:09,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 08:20:09,873 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 414 transitions. [2019-09-10 08:20:09,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:20:09,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:09,874 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] [2019-09-10 08:20:09,874 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:09,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:09,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1144717407, now seen corresponding path program 1 times [2019-09-10 08:20:09,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:09,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:09,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:09,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:09,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:10,419 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:20:10,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:10,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:20:10,419 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:10,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:20:10,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:20:10,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:20:10,420 INFO L87 Difference]: Start difference. First operand 322 states and 414 transitions. Second operand 13 states. [2019-09-10 08:20:11,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:11,505 INFO L93 Difference]: Finished difference Result 808 states and 1126 transitions. [2019-09-10 08:20:11,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:20:11,505 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 107 [2019-09-10 08:20:11,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:11,507 INFO L225 Difference]: With dead ends: 808 [2019-09-10 08:20:11,507 INFO L226 Difference]: Without dead ends: 808 [2019-09-10 08:20:11,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:20:11,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2019-09-10 08:20:11,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 295. [2019-09-10 08:20:11,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-09-10 08:20:11,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 382 transitions. [2019-09-10 08:20:11,511 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 382 transitions. Word has length 107 [2019-09-10 08:20:11,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:11,512 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 382 transitions. [2019-09-10 08:20:11,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:20:11,512 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 382 transitions. [2019-09-10 08:20:11,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:20:11,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:11,513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:11,513 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:11,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:11,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1232495127, now seen corresponding path program 1 times [2019-09-10 08:20:11,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:11,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:11,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:11,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:11,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:11,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:11,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:11,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:11,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:20:11,581 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:11,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:20:11,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:20:11,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:20:11,582 INFO L87 Difference]: Start difference. First operand 295 states and 382 transitions. Second operand 3 states. [2019-09-10 08:20:11,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:11,613 INFO L93 Difference]: Finished difference Result 433 states and 584 transitions. [2019-09-10 08:20:11,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:20:11,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-10 08:20:11,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:11,614 INFO L225 Difference]: With dead ends: 433 [2019-09-10 08:20:11,614 INFO L226 Difference]: Without dead ends: 433 [2019-09-10 08:20:11,614 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:20:11,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-09-10 08:20:11,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 431. [2019-09-10 08:20:11,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-09-10 08:20:11,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 583 transitions. [2019-09-10 08:20:11,618 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 583 transitions. Word has length 136 [2019-09-10 08:20:11,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:11,619 INFO L475 AbstractCegarLoop]: Abstraction has 431 states and 583 transitions. [2019-09-10 08:20:11,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:20:11,619 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 583 transitions. [2019-09-10 08:20:11,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:20:11,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:11,619 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:11,620 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:11,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:11,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1599493294, now seen corresponding path program 1 times [2019-09-10 08:20:11,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:11,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:11,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:11,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:11,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:11,722 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:20:11,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:11,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:20:11,722 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:11,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:20:11,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:20:11,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:20:11,723 INFO L87 Difference]: Start difference. First operand 431 states and 583 transitions. Second operand 7 states. [2019-09-10 08:20:12,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:12,186 INFO L93 Difference]: Finished difference Result 1301 states and 1854 transitions. [2019-09-10 08:20:12,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:20:12,187 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 138 [2019-09-10 08:20:12,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:12,188 INFO L225 Difference]: With dead ends: 1301 [2019-09-10 08:20:12,188 INFO L226 Difference]: Without dead ends: 1301 [2019-09-10 08:20:12,188 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:20:12,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2019-09-10 08:20:12,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 751. [2019-09-10 08:20:12,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2019-09-10 08:20:12,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1059 transitions. [2019-09-10 08:20:12,196 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1059 transitions. Word has length 138 [2019-09-10 08:20:12,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:12,196 INFO L475 AbstractCegarLoop]: Abstraction has 751 states and 1059 transitions. [2019-09-10 08:20:12,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:20:12,196 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1059 transitions. [2019-09-10 08:20:12,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:20:12,197 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:12,197 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:12,197 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:12,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:12,197 INFO L82 PathProgramCache]: Analyzing trace with hash 948532047, now seen corresponding path program 1 times [2019-09-10 08:20:12,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:12,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:12,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:12,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:12,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:12,272 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:20:12,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:12,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:20:12,273 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:12,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:20:12,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:20:12,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:20:12,273 INFO L87 Difference]: Start difference. First operand 751 states and 1059 transitions. Second operand 3 states. [2019-09-10 08:20:12,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:12,313 INFO L93 Difference]: Finished difference Result 1061 states and 1514 transitions. [2019-09-10 08:20:12,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:20:12,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-10 08:20:12,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:12,314 INFO L225 Difference]: With dead ends: 1061 [2019-09-10 08:20:12,315 INFO L226 Difference]: Without dead ends: 1061 [2019-09-10 08:20:12,315 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:20:12,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2019-09-10 08:20:12,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 1059. [2019-09-10 08:20:12,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1059 states. [2019-09-10 08:20:12,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1513 transitions. [2019-09-10 08:20:12,322 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1513 transitions. Word has length 138 [2019-09-10 08:20:12,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:12,323 INFO L475 AbstractCegarLoop]: Abstraction has 1059 states and 1513 transitions. [2019-09-10 08:20:12,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:20:12,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1513 transitions. [2019-09-10 08:20:12,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:20:12,323 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:12,323 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:12,324 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:12,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:12,324 INFO L82 PathProgramCache]: Analyzing trace with hash 882038535, now seen corresponding path program 1 times [2019-09-10 08:20:12,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:12,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:12,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:12,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:12,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:12,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:12,387 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:20:12,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:12,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:20:12,387 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:12,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:20:12,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:20:12,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:20:12,388 INFO L87 Difference]: Start difference. First operand 1059 states and 1513 transitions. Second operand 3 states. [2019-09-10 08:20:12,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:12,432 INFO L93 Difference]: Finished difference Result 1901 states and 2724 transitions. [2019-09-10 08:20:12,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:20:12,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-10 08:20:12,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:12,435 INFO L225 Difference]: With dead ends: 1901 [2019-09-10 08:20:12,435 INFO L226 Difference]: Without dead ends: 1901 [2019-09-10 08:20:12,436 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:20:12,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2019-09-10 08:20:12,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1887. [2019-09-10 08:20:12,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1887 states. [2019-09-10 08:20:12,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1887 states to 1887 states and 2711 transitions. [2019-09-10 08:20:12,448 INFO L78 Accepts]: Start accepts. Automaton has 1887 states and 2711 transitions. Word has length 138 [2019-09-10 08:20:12,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:12,448 INFO L475 AbstractCegarLoop]: Abstraction has 1887 states and 2711 transitions. [2019-09-10 08:20:12,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:20:12,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 2711 transitions. [2019-09-10 08:20:12,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:20:12,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:12,449 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:12,450 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:12,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:12,450 INFO L82 PathProgramCache]: Analyzing trace with hash -820324690, now seen corresponding path program 1 times [2019-09-10 08:20:12,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:12,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:12,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:12,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:12,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:12,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:12,539 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:20:12,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:12,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:20:12,540 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:12,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:20:12,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:20:12,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:20:12,541 INFO L87 Difference]: Start difference. First operand 1887 states and 2711 transitions. Second operand 7 states. [2019-09-10 08:20:13,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:13,034 INFO L93 Difference]: Finished difference Result 6037 states and 8674 transitions. [2019-09-10 08:20:13,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:20:13,034 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 138 [2019-09-10 08:20:13,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:13,040 INFO L225 Difference]: With dead ends: 6037 [2019-09-10 08:20:13,040 INFO L226 Difference]: Without dead ends: 6037 [2019-09-10 08:20:13,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:20:13,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6037 states. [2019-09-10 08:20:13,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6037 to 3863. [2019-09-10 08:20:13,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3863 states. [2019-09-10 08:20:13,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3863 states to 3863 states and 5595 transitions. [2019-09-10 08:20:13,094 INFO L78 Accepts]: Start accepts. Automaton has 3863 states and 5595 transitions. Word has length 138 [2019-09-10 08:20:13,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:13,095 INFO L475 AbstractCegarLoop]: Abstraction has 3863 states and 5595 transitions. [2019-09-10 08:20:13,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:20:13,095 INFO L276 IsEmpty]: Start isEmpty. Operand 3863 states and 5595 transitions. [2019-09-10 08:20:13,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:20:13,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:13,096 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:13,097 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:13,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:13,097 INFO L82 PathProgramCache]: Analyzing trace with hash -456238930, now seen corresponding path program 1 times [2019-09-10 08:20:13,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:13,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:13,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:13,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:13,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:13,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:13,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:13,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:13,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:20:13,200 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:13,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:20:13,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:20:13,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:20:13,200 INFO L87 Difference]: Start difference. First operand 3863 states and 5595 transitions. Second operand 7 states. [2019-09-10 08:20:13,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:13,697 INFO L93 Difference]: Finished difference Result 13357 states and 19246 transitions. [2019-09-10 08:20:13,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:20:13,697 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 138 [2019-09-10 08:20:13,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:13,710 INFO L225 Difference]: With dead ends: 13357 [2019-09-10 08:20:13,710 INFO L226 Difference]: Without dead ends: 13357 [2019-09-10 08:20:13,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:20:13,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13357 states. [2019-09-10 08:20:13,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13357 to 8055. [2019-09-10 08:20:13,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8055 states. [2019-09-10 08:20:13,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8055 states to 8055 states and 11699 transitions. [2019-09-10 08:20:13,783 INFO L78 Accepts]: Start accepts. Automaton has 8055 states and 11699 transitions. Word has length 138 [2019-09-10 08:20:13,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:13,783 INFO L475 AbstractCegarLoop]: Abstraction has 8055 states and 11699 transitions. [2019-09-10 08:20:13,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:20:13,783 INFO L276 IsEmpty]: Start isEmpty. Operand 8055 states and 11699 transitions. [2019-09-10 08:20:13,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:20:13,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:13,785 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:13,785 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:13,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:13,785 INFO L82 PathProgramCache]: Analyzing trace with hash 284220078, now seen corresponding path program 1 times [2019-09-10 08:20:13,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:13,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:13,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:13,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:13,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:13,874 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:20:13,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:13,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:20:13,874 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:13,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:20:13,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:20:13,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:20:13,875 INFO L87 Difference]: Start difference. First operand 8055 states and 11699 transitions. Second operand 7 states. [2019-09-10 08:20:14,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:14,397 INFO L93 Difference]: Finished difference Result 29437 states and 42454 transitions. [2019-09-10 08:20:14,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:20:14,397 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 138 [2019-09-10 08:20:14,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:14,422 INFO L225 Difference]: With dead ends: 29437 [2019-09-10 08:20:14,422 INFO L226 Difference]: Without dead ends: 29437 [2019-09-10 08:20:14,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:20:14,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29437 states. [2019-09-10 08:20:14,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29437 to 16919. [2019-09-10 08:20:14,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16919 states. [2019-09-10 08:20:14,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16919 states to 16919 states and 24579 transitions. [2019-09-10 08:20:14,663 INFO L78 Accepts]: Start accepts. Automaton has 16919 states and 24579 transitions. Word has length 138 [2019-09-10 08:20:14,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:14,663 INFO L475 AbstractCegarLoop]: Abstraction has 16919 states and 24579 transitions. [2019-09-10 08:20:14,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:20:14,663 INFO L276 IsEmpty]: Start isEmpty. Operand 16919 states and 24579 transitions. [2019-09-10 08:20:14,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:20:14,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:14,666 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:14,666 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:14,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:14,666 INFO L82 PathProgramCache]: Analyzing trace with hash -2080219986, now seen corresponding path program 1 times [2019-09-10 08:20:14,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:14,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:14,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:14,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:14,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:14,763 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:20:14,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:14,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:20:14,763 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:14,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:20:14,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:20:14,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:20:14,764 INFO L87 Difference]: Start difference. First operand 16919 states and 24579 transitions. Second operand 7 states. [2019-09-10 08:20:15,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:15,425 INFO L93 Difference]: Finished difference Result 49161 states and 71016 transitions. [2019-09-10 08:20:15,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:20:15,426 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 138 [2019-09-10 08:20:15,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:15,468 INFO L225 Difference]: With dead ends: 49161 [2019-09-10 08:20:15,468 INFO L226 Difference]: Without dead ends: 49161 [2019-09-10 08:20:15,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:20:15,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49161 states. [2019-09-10 08:20:15,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49161 to 27575. [2019-09-10 08:20:15,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27575 states. [2019-09-10 08:20:15,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27575 states to 27575 states and 40083 transitions. [2019-09-10 08:20:15,772 INFO L78 Accepts]: Start accepts. Automaton has 27575 states and 40083 transitions. Word has length 138 [2019-09-10 08:20:15,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:15,772 INFO L475 AbstractCegarLoop]: Abstraction has 27575 states and 40083 transitions. [2019-09-10 08:20:15,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:20:15,772 INFO L276 IsEmpty]: Start isEmpty. Operand 27575 states and 40083 transitions. [2019-09-10 08:20:15,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 08:20:15,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:15,775 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:15,775 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:15,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:15,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1106690548, now seen corresponding path program 1 times [2019-09-10 08:20:15,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:15,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:15,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:15,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:15,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:15,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:15,861 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:20:15,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:15,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:20:15,861 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:15,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:20:15,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:20:15,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:20:15,862 INFO L87 Difference]: Start difference. First operand 27575 states and 40083 transitions. Second operand 6 states. [2019-09-10 08:20:16,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:16,549 INFO L93 Difference]: Finished difference Result 49517 states and 70910 transitions. [2019-09-10 08:20:16,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:20:16,549 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2019-09-10 08:20:16,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:16,593 INFO L225 Difference]: With dead ends: 49517 [2019-09-10 08:20:16,593 INFO L226 Difference]: Without dead ends: 49517 [2019-09-10 08:20:16,593 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:20:16,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49517 states. [2019-09-10 08:20:16,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49517 to 27959. [2019-09-10 08:20:16,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27959 states. [2019-09-10 08:20:16,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27959 states to 27959 states and 40403 transitions. [2019-09-10 08:20:16,937 INFO L78 Accepts]: Start accepts. Automaton has 27959 states and 40403 transitions. Word has length 139 [2019-09-10 08:20:16,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:16,938 INFO L475 AbstractCegarLoop]: Abstraction has 27959 states and 40403 transitions. [2019-09-10 08:20:16,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:20:16,938 INFO L276 IsEmpty]: Start isEmpty. Operand 27959 states and 40403 transitions. [2019-09-10 08:20:16,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 08:20:16,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:16,941 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:16,941 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:16,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:16,941 INFO L82 PathProgramCache]: Analyzing trace with hash -475105807, now seen corresponding path program 1 times [2019-09-10 08:20:16,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:16,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:16,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:16,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:16,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:16,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:17,037 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:20:17,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:17,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:20:17,037 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:17,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:20:17,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:20:17,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:20:17,038 INFO L87 Difference]: Start difference. First operand 27959 states and 40403 transitions. Second operand 7 states. [2019-09-10 08:20:17,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:17,540 INFO L93 Difference]: Finished difference Result 58973 states and 84166 transitions. [2019-09-10 08:20:17,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:20:17,541 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 139 [2019-09-10 08:20:17,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:17,592 INFO L225 Difference]: With dead ends: 58973 [2019-09-10 08:20:17,592 INFO L226 Difference]: Without dead ends: 58973 [2019-09-10 08:20:17,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:20:17,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58973 states. [2019-09-10 08:20:18,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58973 to 32535. [2019-09-10 08:20:18,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32535 states. [2019-09-10 08:20:18,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32535 states to 32535 states and 46483 transitions. [2019-09-10 08:20:18,125 INFO L78 Accepts]: Start accepts. Automaton has 32535 states and 46483 transitions. Word has length 139 [2019-09-10 08:20:18,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:18,126 INFO L475 AbstractCegarLoop]: Abstraction has 32535 states and 46483 transitions. [2019-09-10 08:20:18,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:20:18,126 INFO L276 IsEmpty]: Start isEmpty. Operand 32535 states and 46483 transitions. [2019-09-10 08:20:18,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 08:20:18,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:18,129 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:18,130 INFO L418 AbstractCegarLoop]: === Iteration 110 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:18,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:18,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1327747304, now seen corresponding path program 1 times [2019-09-10 08:20:18,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:18,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:18,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:18,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:18,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:18,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:18,214 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:20:18,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:18,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:20:18,214 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:18,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:20:18,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:20:18,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:20:18,215 INFO L87 Difference]: Start difference. First operand 32535 states and 46483 transitions. Second operand 3 states. [2019-09-10 08:20:18,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:18,294 INFO L93 Difference]: Finished difference Result 30809 states and 43604 transitions. [2019-09-10 08:20:18,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:20:18,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-09-10 08:20:18,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:18,320 INFO L225 Difference]: With dead ends: 30809 [2019-09-10 08:20:18,320 INFO L226 Difference]: Without dead ends: 30809 [2019-09-10 08:20:18,320 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:20:18,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30809 states. [2019-09-10 08:20:18,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30809 to 23359. [2019-09-10 08:20:18,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23359 states. [2019-09-10 08:20:18,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23359 states to 23359 states and 33031 transitions. [2019-09-10 08:20:18,515 INFO L78 Accepts]: Start accepts. Automaton has 23359 states and 33031 transitions. Word has length 140 [2019-09-10 08:20:18,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:18,515 INFO L475 AbstractCegarLoop]: Abstraction has 23359 states and 33031 transitions. [2019-09-10 08:20:18,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:20:18,515 INFO L276 IsEmpty]: Start isEmpty. Operand 23359 states and 33031 transitions. [2019-09-10 08:20:18,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 08:20:18,517 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:18,517 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:18,517 INFO L418 AbstractCegarLoop]: === Iteration 111 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:18,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:18,517 INFO L82 PathProgramCache]: Analyzing trace with hash -896093248, now seen corresponding path program 1 times [2019-09-10 08:20:18,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:18,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:18,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:18,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:18,518 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:18,580 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:20:18,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:18,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:20:18,581 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:18,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:20:18,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:20:18,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:20:18,581 INFO L87 Difference]: Start difference. First operand 23359 states and 33031 transitions. Second operand 3 states. [2019-09-10 08:20:18,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:18,630 INFO L93 Difference]: Finished difference Result 22185 states and 31040 transitions. [2019-09-10 08:20:18,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:20:18,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-09-10 08:20:18,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:18,648 INFO L225 Difference]: With dead ends: 22185 [2019-09-10 08:20:18,648 INFO L226 Difference]: Without dead ends: 22185 [2019-09-10 08:20:18,649 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:20:18,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22185 states. [2019-09-10 08:20:18,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22185 to 21007. [2019-09-10 08:20:18,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21007 states. [2019-09-10 08:20:18,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21007 states to 21007 states and 29599 transitions. [2019-09-10 08:20:18,799 INFO L78 Accepts]: Start accepts. Automaton has 21007 states and 29599 transitions. Word has length 141 [2019-09-10 08:20:18,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:18,799 INFO L475 AbstractCegarLoop]: Abstraction has 21007 states and 29599 transitions. [2019-09-10 08:20:18,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:20:18,799 INFO L276 IsEmpty]: Start isEmpty. Operand 21007 states and 29599 transitions. [2019-09-10 08:20:18,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 08:20:18,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:18,804 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:20:18,804 INFO L418 AbstractCegarLoop]: === Iteration 112 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:18,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:18,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1324236212, now seen corresponding path program 1 times [2019-09-10 08:20:18,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:18,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:18,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:18,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:18,805 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:19,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:19,625 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:19,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:19,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:20:19,626 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:19,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:20:19,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:20:19,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:20:19,626 INFO L87 Difference]: Start difference. First operand 21007 states and 29599 transitions. Second operand 3 states. [2019-09-10 08:20:19,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:19,675 INFO L93 Difference]: Finished difference Result 19713 states and 27440 transitions. [2019-09-10 08:20:19,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:20:19,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-09-10 08:20:19,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:19,691 INFO L225 Difference]: With dead ends: 19713 [2019-09-10 08:20:19,691 INFO L226 Difference]: Without dead ends: 19713 [2019-09-10 08:20:19,691 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:20:19,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19713 states. [2019-09-10 08:20:19,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19713 to 14983. [2019-09-10 08:20:19,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14983 states. [2019-09-10 08:20:19,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14983 states to 14983 states and 20836 transitions. [2019-09-10 08:20:19,818 INFO L78 Accepts]: Start accepts. Automaton has 14983 states and 20836 transitions. Word has length 173 [2019-09-10 08:20:19,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:19,818 INFO L475 AbstractCegarLoop]: Abstraction has 14983 states and 20836 transitions. [2019-09-10 08:20:19,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:20:19,818 INFO L276 IsEmpty]: Start isEmpty. Operand 14983 states and 20836 transitions. [2019-09-10 08:20:19,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-10 08:20:19,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:19,821 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:19,822 INFO L418 AbstractCegarLoop]: === Iteration 113 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:19,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:19,822 INFO L82 PathProgramCache]: Analyzing trace with hash -527870386, now seen corresponding path program 1 times [2019-09-10 08:20:19,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:19,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:19,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:19,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:19,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:19,905 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 08:20:19,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:19,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:20:19,906 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:19,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:20:19,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:20:19,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:20:19,906 INFO L87 Difference]: Start difference. First operand 14983 states and 20836 transitions. Second operand 3 states. [2019-09-10 08:20:19,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:19,949 INFO L93 Difference]: Finished difference Result 18615 states and 25682 transitions. [2019-09-10 08:20:19,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:20:19,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-10 08:20:19,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:19,965 INFO L225 Difference]: With dead ends: 18615 [2019-09-10 08:20:19,965 INFO L226 Difference]: Without dead ends: 18615 [2019-09-10 08:20:19,965 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:20:19,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18615 states. [2019-09-10 08:20:20,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18615 to 18037. [2019-09-10 08:20:20,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18037 states. [2019-09-10 08:20:20,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18037 states to 18037 states and 24961 transitions. [2019-09-10 08:20:20,092 INFO L78 Accepts]: Start accepts. Automaton has 18037 states and 24961 transitions. Word has length 174 [2019-09-10 08:20:20,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:20,092 INFO L475 AbstractCegarLoop]: Abstraction has 18037 states and 24961 transitions. [2019-09-10 08:20:20,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:20:20,092 INFO L276 IsEmpty]: Start isEmpty. Operand 18037 states and 24961 transitions. [2019-09-10 08:20:20,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-10 08:20:20,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:20,096 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:20,096 INFO L418 AbstractCegarLoop]: === Iteration 114 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:20,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:20,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1451413664, now seen corresponding path program 1 times [2019-09-10 08:20:20,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:20,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:20,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:20,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:20,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:20,168 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:20,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:20,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:20:20,168 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:20,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:20:20,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:20:20,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:20:20,169 INFO L87 Difference]: Start difference. First operand 18037 states and 24961 transitions. Second operand 3 states. [2019-09-10 08:20:20,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:20,234 INFO L93 Difference]: Finished difference Result 30717 states and 42056 transitions. [2019-09-10 08:20:20,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:20:20,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-09-10 08:20:20,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:20,260 INFO L225 Difference]: With dead ends: 30717 [2019-09-10 08:20:20,260 INFO L226 Difference]: Without dead ends: 30717 [2019-09-10 08:20:20,261 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:20:20,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30717 states. [2019-09-10 08:20:20,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30717 to 28987. [2019-09-10 08:20:20,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28987 states. [2019-09-10 08:20:20,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28987 states to 28987 states and 39967 transitions. [2019-09-10 08:20:20,604 INFO L78 Accepts]: Start accepts. Automaton has 28987 states and 39967 transitions. Word has length 175 [2019-09-10 08:20:20,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:20,605 INFO L475 AbstractCegarLoop]: Abstraction has 28987 states and 39967 transitions. [2019-09-10 08:20:20,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:20:20,605 INFO L276 IsEmpty]: Start isEmpty. Operand 28987 states and 39967 transitions. [2019-09-10 08:20:20,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 08:20:20,610 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:20,610 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:20,610 INFO L418 AbstractCegarLoop]: === Iteration 115 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:20,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:20,611 INFO L82 PathProgramCache]: Analyzing trace with hash 663466126, now seen corresponding path program 1 times [2019-09-10 08:20:20,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:20,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:20,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:20,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:20,612 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:20,914 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:20,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:20:20,914 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:20:20,915 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 177 with the following transitions: [2019-09-10 08:20:20,917 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], [99], [102], [105], [108], [111], [114], [117], [120], [123], [127], [130], [133], [137], [140], [143], [147], [150], [153], [157], [160], [163], [167], [170], [173], [177], [180], [183], [186], [190], [193], [196], [200], [203], [207], [210], [213], [331], [371], [374], [377], [380], [477], [4906], [4909], [4912], [4915], [4990], [7014], [7016], [7019], [7024], [7027], [7031], [7044], [7046], [7134], [7137], [7140], [7143], [7200], [8112], [8115], [8116], [8118], [8208], [8211], [8214], [8217], [8258], [8727], [8730], [8764], [8978], [8981], [8985], [8988], [8991], [8995], [8997], [9026], [9029], [9044], [9046], [9048], [9051], [9066], [9068], [9070], [9073], [9088], [9090], [9092], [9095], [9110], [9112], [9114], [9117], [9120], [9125], [9128], [9134], [9137], [9140], [9143], [9151], [9153], [9156], [9159], [9167], [9185], [9188], [9191], [9199], [9201], [9204], [9207], [9215], [9217], [9220], [9223], [9231], [9287], [9288], [9292], [9293], [9294] [2019-09-10 08:20:20,959 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:20:20,959 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:20:21,206 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:20:22,367 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:20:22,370 INFO L272 AbstractInterpreter]: Visited 159 different actions 761 times. Merged at 55 different actions 539 times. Widened at 22 different actions 89 times. Performed 2898 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2898 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 47 fixpoints after 13 different actions. Largest state had 388 variables. [2019-09-10 08:20:22,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:22,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:20:22,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:20:22,377 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) [2019-09-10 08:20:22,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:22,403 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:20:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:22,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 2153 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-10 08:20:22,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:20:23,005 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 08:20:23,005 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:20:23,205 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 08:20:23,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:20:23,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [12, 8] total 23 [2019-09-10 08:20:23,216 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:23,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:20:23,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:20:23,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:20:23,218 INFO L87 Difference]: Start difference. First operand 28987 states and 39967 transitions. Second operand 8 states. [2019-09-10 08:20:24,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:24,015 INFO L93 Difference]: Finished difference Result 164669 states and 226980 transitions. [2019-09-10 08:20:24,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:20:24,015 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 176 [2019-09-10 08:20:24,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:24,329 INFO L225 Difference]: With dead ends: 164669 [2019-09-10 08:20:24,329 INFO L226 Difference]: Without dead ends: 164669 [2019-09-10 08:20:24,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 341 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:20:24,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164669 states. [2019-09-10 08:20:26,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164669 to 49027. [2019-09-10 08:20:26,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49027 states. [2019-09-10 08:20:26,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49027 states to 49027 states and 67471 transitions. [2019-09-10 08:20:26,916 INFO L78 Accepts]: Start accepts. Automaton has 49027 states and 67471 transitions. Word has length 176 [2019-09-10 08:20:26,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:26,917 INFO L475 AbstractCegarLoop]: Abstraction has 49027 states and 67471 transitions. [2019-09-10 08:20:26,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:20:26,917 INFO L276 IsEmpty]: Start isEmpty. Operand 49027 states and 67471 transitions. [2019-09-10 08:20:26,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 08:20:26,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:26,926 INFO L399 BasicCegarLoop]: trace histogram [2, 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, 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:20:26,926 INFO L418 AbstractCegarLoop]: === Iteration 116 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:26,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:26,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1392266098, now seen corresponding path program 1 times [2019-09-10 08:20:26,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:26,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:26,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:26,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:26,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:27,073 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:27,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:27,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:20:27,074 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:27,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:20:27,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:20:27,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:20:27,076 INFO L87 Difference]: Start difference. First operand 49027 states and 67471 transitions. Second operand 3 states. [2019-09-10 08:20:27,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:27,215 INFO L93 Difference]: Finished difference Result 45605 states and 61776 transitions. [2019-09-10 08:20:27,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:20:27,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-10 08:20:27,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:27,283 INFO L225 Difference]: With dead ends: 45605 [2019-09-10 08:20:27,283 INFO L226 Difference]: Without dead ends: 45605 [2019-09-10 08:20:27,284 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:20:27,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45605 states. [2019-09-10 08:20:27,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45605 to 45603. [2019-09-10 08:20:27,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45603 states. [2019-09-10 08:20:27,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45603 states to 45603 states and 61775 transitions. [2019-09-10 08:20:27,837 INFO L78 Accepts]: Start accepts. Automaton has 45603 states and 61775 transitions. Word has length 176 [2019-09-10 08:20:27,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:27,837 INFO L475 AbstractCegarLoop]: Abstraction has 45603 states and 61775 transitions. [2019-09-10 08:20:27,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:20:27,838 INFO L276 IsEmpty]: Start isEmpty. Operand 45603 states and 61775 transitions. [2019-09-10 08:20:27,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-10 08:20:27,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:27,842 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, 1, 1, 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:20:27,843 INFO L418 AbstractCegarLoop]: === Iteration 117 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:27,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:27,843 INFO L82 PathProgramCache]: Analyzing trace with hash 572823057, now seen corresponding path program 1 times [2019-09-10 08:20:27,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:27,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:27,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:27,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:27,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:28,067 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:20:28,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:28,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:20:28,068 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:28,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:20:28,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:20:28,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:20:28,068 INFO L87 Difference]: Start difference. First operand 45603 states and 61775 transitions. Second operand 8 states. [2019-09-10 08:20:29,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:29,801 INFO L93 Difference]: Finished difference Result 178145 states and 241497 transitions. [2019-09-10 08:20:29,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:20:29,801 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 177 [2019-09-10 08:20:29,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:30,012 INFO L225 Difference]: With dead ends: 178145 [2019-09-10 08:20:30,012 INFO L226 Difference]: Without dead ends: 178145 [2019-09-10 08:20:30,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:20:30,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178145 states. [2019-09-10 08:20:31,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178145 to 74127. [2019-09-10 08:20:31,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74127 states. [2019-09-10 08:20:31,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74127 states to 74127 states and 100271 transitions. [2019-09-10 08:20:31,500 INFO L78 Accepts]: Start accepts. Automaton has 74127 states and 100271 transitions. Word has length 177 [2019-09-10 08:20:31,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:31,501 INFO L475 AbstractCegarLoop]: Abstraction has 74127 states and 100271 transitions. [2019-09-10 08:20:31,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:20:31,501 INFO L276 IsEmpty]: Start isEmpty. Operand 74127 states and 100271 transitions. [2019-09-10 08:20:31,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-10 08:20:31,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:31,504 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:31,505 INFO L418 AbstractCegarLoop]: === Iteration 118 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:31,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:31,505 INFO L82 PathProgramCache]: Analyzing trace with hash -663744495, now seen corresponding path program 1 times [2019-09-10 08:20:31,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:31,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:31,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:31,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:31,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:31,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:31,609 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:31,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:31,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:20:31,610 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:31,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:20:31,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:20:31,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:20:31,611 INFO L87 Difference]: Start difference. First operand 74127 states and 100271 transitions. Second operand 3 states. [2019-09-10 08:20:31,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:31,873 INFO L93 Difference]: Finished difference Result 90837 states and 121040 transitions. [2019-09-10 08:20:31,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:20:31,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-09-10 08:20:31,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:31,987 INFO L225 Difference]: With dead ends: 90837 [2019-09-10 08:20:31,988 INFO L226 Difference]: Without dead ends: 90837 [2019-09-10 08:20:31,988 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:20:32,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90837 states. [2019-09-10 08:20:32,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90837 to 87123. [2019-09-10 08:20:32,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87123 states. [2019-09-10 08:20:33,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87123 states to 87123 states and 116583 transitions. [2019-09-10 08:20:33,013 INFO L78 Accepts]: Start accepts. Automaton has 87123 states and 116583 transitions. Word has length 177 [2019-09-10 08:20:33,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:33,013 INFO L475 AbstractCegarLoop]: Abstraction has 87123 states and 116583 transitions. [2019-09-10 08:20:33,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:20:33,013 INFO L276 IsEmpty]: Start isEmpty. Operand 87123 states and 116583 transitions. [2019-09-10 08:20:33,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 08:20:33,017 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:33,018 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, 1, 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:20:33,018 INFO L418 AbstractCegarLoop]: === Iteration 119 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:33,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:33,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1194682881, now seen corresponding path program 1 times [2019-09-10 08:20:33,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:33,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:33,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:33,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:33,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:33,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:33,779 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:33,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:20:33,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:20:33,780 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 179 with the following transitions: [2019-09-10 08:20:33,781 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], [99], [102], [105], [108], [111], [114], [117], [120], [123], [127], [130], [133], [137], [140], [143], [147], [150], [153], [157], [160], [163], [167], [170], [173], [177], [180], [183], [186], [190], [193], [196], [200], [203], [207], [210], [213], [331], [371], [374], [377], [380], [477], [4906], [4909], [4912], [4915], [4990], [7014], [7016], [7019], [7024], [7027], [7031], [7044], [7046], [7134], [7137], [7140], [7143], [7200], [8112], [8115], [8116], [8118], [8208], [8211], [8214], [8217], [8258], [8727], [8730], [8764], [8978], [8981], [8985], [8988], [8991], [8995], [8997], [9000], [9005], [9007], [9022], [9024], [9026], [9029], [9044], [9046], [9048], [9051], [9066], [9068], [9070], [9073], [9088], [9090], [9092], [9095], [9098], [9103], [9106], [9112], [9114], [9117], [9132], [9134], [9137], [9140], [9143], [9151], [9153], [9156], [9159], [9167], [9169], [9172], [9175], [9183], [9185], [9188], [9191], [9199], [9201], [9204], [9207], [9215], [9217], [9220], [9223], [9231], [9287], [9288], [9292], [9293], [9294] [2019-09-10 08:20:33,788 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:20:33,789 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:20:33,902 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:20:35,137 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:20:35,138 INFO L272 AbstractInterpreter]: Visited 168 different actions 1109 times. Merged at 64 different actions 819 times. Widened at 29 different actions 160 times. Performed 4209 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4209 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 98 fixpoints after 21 different actions. Largest state had 389 variables. [2019-09-10 08:20:35,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:35,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:20:35,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:20:35,138 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:20:35,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:35,155 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:20:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:35,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 2156 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-10 08:20:35,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:20:35,715 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:20:35,716 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:20:35,886 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:20:35,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:20:35,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [12, 8] total 23 [2019-09-10 08:20:35,891 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:35,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:20:35,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:20:35,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:20:35,892 INFO L87 Difference]: Start difference. First operand 87123 states and 116583 transitions. Second operand 8 states. [2019-09-10 08:20:36,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:36,719 INFO L93 Difference]: Finished difference Result 232527 states and 311709 transitions. [2019-09-10 08:20:36,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:20:36,719 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 178 [2019-09-10 08:20:36,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:36,931 INFO L225 Difference]: With dead ends: 232527 [2019-09-10 08:20:36,931 INFO L226 Difference]: Without dead ends: 232527 [2019-09-10 08:20:36,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 345 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:20:37,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232527 states. [2019-09-10 08:20:38,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232527 to 109715. [2019-09-10 08:20:38,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109715 states. [2019-09-10 08:20:38,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109715 states to 109715 states and 146791 transitions. [2019-09-10 08:20:38,846 INFO L78 Accepts]: Start accepts. Automaton has 109715 states and 146791 transitions. Word has length 178 [2019-09-10 08:20:38,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:38,846 INFO L475 AbstractCegarLoop]: Abstraction has 109715 states and 146791 transitions. [2019-09-10 08:20:38,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:20:38,846 INFO L276 IsEmpty]: Start isEmpty. Operand 109715 states and 146791 transitions. [2019-09-10 08:20:38,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 08:20:38,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:38,852 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, 1, 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:20:38,853 INFO L418 AbstractCegarLoop]: === Iteration 120 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:38,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:38,853 INFO L82 PathProgramCache]: Analyzing trace with hash -830597121, now seen corresponding path program 1 times [2019-09-10 08:20:38,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:38,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:38,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:38,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:38,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:38,977 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 08:20:38,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:38,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:20:38,978 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:38,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:20:38,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:20:38,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:20:38,978 INFO L87 Difference]: Start difference. First operand 109715 states and 146791 transitions. Second operand 5 states. [2019-09-10 08:20:39,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:39,268 INFO L93 Difference]: Finished difference Result 134063 states and 179305 transitions. [2019-09-10 08:20:39,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:20:39,269 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 178 [2019-09-10 08:20:39,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:39,400 INFO L225 Difference]: With dead ends: 134063 [2019-09-10 08:20:39,400 INFO L226 Difference]: Without dead ends: 134063 [2019-09-10 08:20:39,400 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:20:39,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134063 states. [2019-09-10 08:20:40,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134063 to 121331. [2019-09-10 08:20:40,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121331 states. [2019-09-10 08:20:40,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121331 states to 121331 states and 162407 transitions. [2019-09-10 08:20:40,872 INFO L78 Accepts]: Start accepts. Automaton has 121331 states and 162407 transitions. Word has length 178 [2019-09-10 08:20:40,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:40,873 INFO L475 AbstractCegarLoop]: Abstraction has 121331 states and 162407 transitions. [2019-09-10 08:20:40,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:20:40,873 INFO L276 IsEmpty]: Start isEmpty. Operand 121331 states and 162407 transitions. [2019-09-10 08:20:40,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 08:20:40,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:40,878 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, 1, 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:20:40,878 INFO L418 AbstractCegarLoop]: === Iteration 121 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:40,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:40,879 INFO L82 PathProgramCache]: Analyzing trace with hash -90138113, now seen corresponding path program 1 times [2019-09-10 08:20:40,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:40,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:40,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:40,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:40,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:41,078 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 08:20:41,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:41,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:20:41,079 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:41,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:20:41,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:20:41,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:20:41,080 INFO L87 Difference]: Start difference. First operand 121331 states and 162407 transitions. Second operand 8 states. [2019-09-10 08:20:42,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:42,258 INFO L93 Difference]: Finished difference Result 292343 states and 392077 transitions. [2019-09-10 08:20:42,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:20:42,259 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 178 [2019-09-10 08:20:42,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:42,536 INFO L225 Difference]: With dead ends: 292343 [2019-09-10 08:20:42,536 INFO L226 Difference]: Without dead ends: 292343 [2019-09-10 08:20:42,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:20:42,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292343 states. [2019-09-10 08:20:47,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292343 to 143923. [2019-09-10 08:20:47,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143923 states. [2019-09-10 08:20:47,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143923 states to 143923 states and 192615 transitions. [2019-09-10 08:20:47,353 INFO L78 Accepts]: Start accepts. Automaton has 143923 states and 192615 transitions. Word has length 178 [2019-09-10 08:20:47,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:47,353 INFO L475 AbstractCegarLoop]: Abstraction has 143923 states and 192615 transitions. [2019-09-10 08:20:47,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:20:47,353 INFO L276 IsEmpty]: Start isEmpty. Operand 143923 states and 192615 transitions. [2019-09-10 08:20:47,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 08:20:47,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:47,358 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, 1, 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:20:47,359 INFO L418 AbstractCegarLoop]: === Iteration 122 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:47,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:47,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1840389119, now seen corresponding path program 1 times [2019-09-10 08:20:47,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:47,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:47,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:47,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:47,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:47,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:47,480 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 08:20:47,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:47,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:20:47,480 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:47,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:20:47,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:20:47,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:20:47,481 INFO L87 Difference]: Start difference. First operand 143923 states and 192615 transitions. Second operand 5 states. [2019-09-10 08:20:47,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:47,895 INFO L93 Difference]: Finished difference Result 210061 states and 281358 transitions. [2019-09-10 08:20:47,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:20:47,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 178 [2019-09-10 08:20:47,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:48,096 INFO L225 Difference]: With dead ends: 210061 [2019-09-10 08:20:48,096 INFO L226 Difference]: Without dead ends: 210061 [2019-09-10 08:20:48,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:20:48,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210061 states. [2019-09-10 08:20:50,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210061 to 208943. [2019-09-10 08:20:50,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208943 states. [2019-09-10 08:20:55,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208943 states to 208943 states and 279851 transitions. [2019-09-10 08:20:55,162 INFO L78 Accepts]: Start accepts. Automaton has 208943 states and 279851 transitions. Word has length 178 [2019-09-10 08:20:55,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:55,162 INFO L475 AbstractCegarLoop]: Abstraction has 208943 states and 279851 transitions. [2019-09-10 08:20:55,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:20:55,163 INFO L276 IsEmpty]: Start isEmpty. Operand 208943 states and 279851 transitions. [2019-09-10 08:20:55,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 08:20:55,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:55,169 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:55,170 INFO L418 AbstractCegarLoop]: === Iteration 123 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:55,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:55,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1423660390, now seen corresponding path program 1 times [2019-09-10 08:20:55,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:55,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:55,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:55,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:55,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:55,539 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:55,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:20:55,540 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:20:55,540 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 180 with the following transitions: [2019-09-10 08:20:55,541 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], [99], [102], [105], [108], [111], [114], [117], [120], [123], [127], [130], [133], [137], [140], [143], [147], [150], [153], [157], [160], [163], [167], [170], [173], [177], [180], [183], [186], [190], [193], [196], [200], [203], [207], [210], [213], [331], [371], [374], [377], [380], [477], [4906], [4909], [4912], [4915], [4990], [7014], [7016], [7019], [7022], [7024], [7027], [7031], [7033], [7038], [7046], [7134], [7137], [7140], [7143], [7200], [8112], [8115], [8116], [8118], [8208], [8211], [8214], [8217], [8258], [8727], [8730], [8764], [8978], [8981], [8985], [8988], [8991], [8995], [8997], [9000], [9005], [9007], [9022], [9024], [9026], [9029], [9044], [9046], [9048], [9051], [9066], [9068], [9070], [9073], [9088], [9090], [9092], [9095], [9110], [9112], [9114], [9117], [9132], [9134], [9137], [9140], [9143], [9151], [9153], [9156], [9159], [9167], [9169], [9172], [9175], [9183], [9185], [9188], [9191], [9199], [9201], [9204], [9207], [9215], [9217], [9220], [9223], [9231], [9287], [9288], [9292], [9293], [9294] [2019-09-10 08:20:55,544 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:20:55,545 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:20:55,646 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:20:56,958 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:20:56,959 INFO L272 AbstractInterpreter]: Visited 168 different actions 1216 times. Merged at 63 different actions 908 times. Widened at 28 different actions 162 times. Performed 4430 root evaluator evaluations with a maximum evaluation depth of 8. Performed 4430 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 144 fixpoints after 24 different actions. Largest state had 389 variables. [2019-09-10 08:20:56,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:56,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:20:56,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:20:56,959 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:20:56,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:56,975 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:20:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:57,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 2155 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 08:20:57,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:20:57,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:57,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:57,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:57,764 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:57,765 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:20:57,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:58,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:58,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:58,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:58,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:21:00,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:21:01,175 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:01,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:21:01,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 30 [2019-09-10 08:21:01,182 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:21:01,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:21:01,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:21:01,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2019-09-10 08:21:01,182 INFO L87 Difference]: Start difference. First operand 208943 states and 279851 transitions. Second operand 21 states. [2019-09-10 08:21:01,788 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2019-09-10 08:21:03,920 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:21:04,631 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:21:05,151 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:21:05,337 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:21:05,754 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:21:05,890 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:21:06,326 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:21:06,606 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:21:06,769 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2019-09-10 08:21:07,015 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:21:07,178 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 08:21:07,329 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:21:07,484 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:21:07,955 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:21:08,135 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 08:21:08,305 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:21:09,880 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:21:10,369 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:21:10,853 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:21:11,024 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:21:11,179 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:21:11,329 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2019-09-10 08:21:11,973 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:21:12,157 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:21:12,315 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:21:12,487 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 08:21:12,731 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:21:12,884 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:21:13,048 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2019-09-10 08:21:13,562 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:21:13,884 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-10 08:21:14,190 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:21:14,402 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:21:14,578 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:21:14,749 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 08:21:14,926 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:21:15,097 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:21:15,235 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:21:15,409 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 08:21:15,959 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:21:16,134 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-10 08:21:16,306 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:21:16,453 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:21:16,919 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:21:17,108 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:21:17,280 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:21:17,457 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 08:21:17,610 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2019-09-10 08:21:17,794 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:21:18,647 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 08:21:18,799 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:21:19,111 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 08:21:19,282 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:21:19,649 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:21:19,802 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:21:20,104 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:21:20,804 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:21:21,117 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-10 08:21:21,707 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:21:21,906 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 08:21:22,208 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:21:22,390 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:21:22,581 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:21:22,739 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:21:23,027 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 08:21:24,459 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2019-09-10 08:21:24,657 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:21:24,848 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:21:25,060 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:21:25,216 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:21:25,380 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:21:25,548 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:21:25,705 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:21:25,854 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:21:26,149 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:21:26,297 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:21:26,475 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:21:26,870 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:21:27,101 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:21:27,252 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:21:27,426 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:21:27,583 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:21:27,766 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:21:27,919 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:21:28,219 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:21:28,368 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:21:28,515 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:21:28,716 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 08:21:28,887 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:21:29,036 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:21:29,361 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:21:29,528 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:21:29,991 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:21:30,181 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:21:30,496 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:21:30,794 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:21:30,951 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:21:31,364 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:21:31,773 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:21:32,221 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:21:32,407 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:21:32,564 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:21:33,180 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-10 08:21:33,604 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:21:33,914 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:21:34,230 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:21:34,381 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:21:34,546 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:21:34,795 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 08:21:38,585 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:21:38,883 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 08:21:39,558 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:21:39,882 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 08:21:40,378 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:21:40,513 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 08:21:41,006 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:21:41,350 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:21:42,476 WARN L188 SmtUtils]: Spent 927.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:21:42,737 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:21:43,044 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 08:21:43,244 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:21:43,545 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:21:44,156 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 08:21:44,317 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:21:44,981 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:21:45,209 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:21:45,771 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 08:21:46,150 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:21:46,416 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:21:46,751 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:21:46,923 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:21:47,545 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:21:47,728 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:21:47,890 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:21:48,170 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:21:48,663 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:21:48,899 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 08:21:49,107 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:21:49,307 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:21:49,859 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:21:50,015 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:21:50,394 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:21:50,558 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:21:50,992 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:21:51,183 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:21:51,519 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:21:51,861 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:21:52,254 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-09-10 08:21:52,445 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:21:53,555 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:21:53,753 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:21:53,913 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:21:54,143 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 08:21:54,339 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:21:55,086 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:21:55,333 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:21:55,527 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:21:55,950 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:21:56,140 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 08:21:56,478 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:21:56,782 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:21:58,838 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:21:59,004 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:22:09,567 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:22:09,718 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:22:09,855 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:22:10,247 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:22:10,438 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:22:10,619 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:22:10,934 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:22:11,089 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:22:11,317 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:22:11,513 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:22:11,663 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 08:22:11,818 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:22:12,130 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:22:34,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:34,787 INFO L93 Difference]: Finished difference Result 4649139 states and 6121400 transitions. [2019-09-10 08:22:34,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 327 states. [2019-09-10 08:22:34,787 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 179 [2019-09-10 08:22:34,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:42,937 INFO L225 Difference]: With dead ends: 4649139 [2019-09-10 08:22:42,937 INFO L226 Difference]: Without dead ends: 4649139 [2019-09-10 08:22:42,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 694 GetRequests, 285 SyntacticMatches, 56 SemanticMatches, 353 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52451 ImplicationChecksByTransitivity, 51.1s TimeCoverageRelationStatistics Valid=15654, Invalid=110016, Unknown=0, NotChecked=0, Total=125670 [2019-09-10 08:22:59,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4649139 states. [2019-09-10 08:23:52,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4649139 to 1028271. [2019-09-10 08:23:52,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1028271 states. [2019-09-10 08:23:56,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028271 states to 1028271 states and 1368895 transitions. [2019-09-10 08:23:56,958 INFO L78 Accepts]: Start accepts. Automaton has 1028271 states and 1368895 transitions. Word has length 179 [2019-09-10 08:23:56,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:56,958 INFO L475 AbstractCegarLoop]: Abstraction has 1028271 states and 1368895 transitions. [2019-09-10 08:23:56,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:23:56,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1028271 states and 1368895 transitions. [2019-09-10 08:23:56,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 08:23:56,993 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:56,993 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, 1, 1, 1, 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:23:56,993 INFO L418 AbstractCegarLoop]: === Iteration 124 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:56,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:56,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1878210198, now seen corresponding path program 1 times [2019-09-10 08:23:56,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:56,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:56,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:56,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:56,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:57,289 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:57,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:23:57,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:23:57,290 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 181 with the following transitions: [2019-09-10 08:23:57,290 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], [99], [102], [105], [108], [111], [114], [117], [120], [123], [127], [130], [133], [137], [140], [143], [147], [150], [153], [157], [160], [163], [167], [170], [173], [177], [180], [183], [186], [190], [193], [196], [200], [203], [207], [210], [213], [331], [371], [374], [377], [380], [477], [4906], [4909], [4912], [4915], [4990], [7014], [7016], [7019], [7024], [7027], [7031], [7044], [7046], [7134], [7137], [7140], [7143], [7200], [8112], [8115], [8116], [8118], [8208], [8211], [8214], [8217], [8258], [8727], [8730], [8764], [8978], [8981], [8985], [8988], [8991], [8995], [8997], [9000], [9005], [9007], [9010], [9015], [9018], [9024], [9026], [9029], [9044], [9046], [9048], [9051], [9066], [9068], [9070], [9073], [9088], [9090], [9092], [9095], [9110], [9112], [9114], [9117], [9120], [9125], [9128], [9134], [9137], [9140], [9143], [9151], [9153], [9156], [9159], [9167], [9169], [9172], [9175], [9183], [9185], [9188], [9191], [9199], [9201], [9204], [9207], [9215], [9217], [9220], [9223], [9231], [9287], [9288], [9292], [9293], [9294] [2019-09-10 08:23:57,295 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:23:57,295 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:23:57,364 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:23:58,649 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:23:58,649 INFO L272 AbstractInterpreter]: Visited 170 different actions 1172 times. Merged at 66 different actions 881 times. Widened at 28 different actions 185 times. Performed 4265 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4265 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 104 fixpoints after 20 different actions. Largest state had 389 variables. [2019-09-10 08:23:58,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:58,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:23:58,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:23:58,650 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:23:58,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:58,660 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:23:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:58,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 2160 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 08:23:58,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:23:59,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:23:59,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:23:59,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:23:59,344 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:23:59,345 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:23:59,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:23:59,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:23:59,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:23:59,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:23:59,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:23:59,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:23:59,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:23:59,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:23:59,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:23:59,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:24:00,707 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:24:00,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:24:00,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 28 [2019-09-10 08:24:00,712 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:24:00,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:24:00,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:24:00,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:24:00,713 INFO L87 Difference]: Start difference. First operand 1028271 states and 1368895 transitions. Second operand 20 states. [2019-09-10 08:24:03,176 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:24:03,913 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:24:04,674 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:24:04,871 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:24:05,299 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:24:05,441 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:24:05,727 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:24:05,874 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:24:06,159 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:24:06,540 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:24:06,708 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:24:06,862 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:24:07,010 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:24:14,568 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:24:15,267 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:24:15,444 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:24:15,597 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:24:15,752 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 08:24:16,264 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 08:24:16,467 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:24:16,660 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:24:16,821 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:24:16,993 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 08:24:17,516 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:24:17,804 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:24:18,034 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:24:18,211 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:24:18,396 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:24:18,574 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:24:18,877 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:24:19,085 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 08:24:19,285 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:24:19,458 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:24:19,620 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 08:24:19,919 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:24:20,245 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:24:20,865 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:24:23,313 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:24:23,491 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:24:23,671 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:24:24,032 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 08:24:24,232 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 08:24:24,442 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:24:24,607 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:24:24,812 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:24:24,966 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:24:25,332 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:24:25,499 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:24:25,849 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:24:26,024 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:24:26,332 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:24:26,816 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:24:26,987 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:24:27,194 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-10 08:24:27,402 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-10 08:24:27,861 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:24:28,128 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:24:28,331 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:24:28,523 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:24:28,683 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:24:28,843 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:24:29,022 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:24:29,196 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:24:29,500 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:24:29,668 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:24:29,819 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:24:30,002 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:24:30,660 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2019-09-10 08:24:30,892 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2019-09-10 08:24:31,205 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 08:24:31,552 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 08:24:31,753 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:24:31,932 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:24:32,141 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 08:24:32,365 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 08:24:32,522 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:24:32,693 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:24:32,876 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:24:33,065 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:24:33,250 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:24:33,425 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:24:33,609 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:24:33,756 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:24:33,970 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-10 08:24:34,125 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 08:24:34,302 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 08:24:34,571 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:24:34,733 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:24:34,881 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:24:35,049 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 08:24:35,216 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:24:35,393 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:24:35,740 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 08:24:35,954 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 08:24:36,108 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:24:36,285 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:24:36,444 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:24:36,610 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:24:36,778 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:24:37,118 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 08:24:37,305 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:24:37,603 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:24:37,767 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:24:38,052 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:24:38,233 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:24:38,430 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:24:38,602 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:24:38,764 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:24:38,925 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:24:39,526 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 08:24:39,682 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:24:39,844 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:24:40,277 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 08:24:40,427 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:24:41,044 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:24:41,358 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:24:41,539 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:24:41,859 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:24:42,893 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:24:43,069 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:24:43,827 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:24:44,302 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:24:44,483 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:24:44,942 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:24:46,891 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:24:47,181 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 08:24:47,465 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:24:47,910 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:24:48,538 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:24:48,834 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 08:24:49,113 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:24:49,700 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:24:50,315 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 08:24:50,659 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-10 08:24:50,985 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:24:51,197 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:24:52,031 WARN L188 SmtUtils]: Spent 617.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:24:52,384 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:24:52,538 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:24:53,220 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:24:53,588 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:24:54,287 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:24:54,695 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-09-10 08:24:54,900 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:24:55,135 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:24:55,537 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:24:55,739 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:24:55,911 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:24:56,141 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 08:24:59,925 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:25:01,327 WARN L188 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:25:01,494 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:25:02,117 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:25:02,311 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:25:02,712 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:25:03,337 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:25:03,513 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:25:03,875 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 08:25:04,372 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:25:04,562 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:25:04,759 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 08:25:04,965 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 08:25:05,193 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:25:05,353 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 08:25:05,668 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 08:25:05,881 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:25:16,634 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64