java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:03:49,312 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:03:49,314 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:03:49,327 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:03:49,327 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:03:49,329 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:03:49,331 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:03:49,343 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:03:49,345 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:03:49,346 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:03:49,350 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:03:49,352 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:03:49,352 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:03:49,356 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:03:49,358 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:03:49,360 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:03:49,361 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:03:49,363 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:03:49,366 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:03:49,370 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:03:49,374 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:03:49,375 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:03:49,377 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:03:49,378 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:03:49,380 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:03:49,380 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:03:49,380 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:03:49,383 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:03:49,384 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:03:49,385 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:03:49,385 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:03:49,387 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:03:49,388 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:03:49,389 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:03:49,390 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:03:49,391 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:03:49,391 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:03:49,391 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:03:49,392 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:03:49,392 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:03:49,393 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:03:49,394 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:03:49,408 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:03:49,408 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:03:49,408 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:03:49,409 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:03:49,409 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:03:49,410 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:03:49,410 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:03:49,410 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:03:49,410 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:03:49,410 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:03:49,411 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:03:49,411 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:03:49,411 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:03:49,412 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:03:49,413 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:03:49,413 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:03:49,414 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:03:49,414 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:03:49,414 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:03:49,414 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:03:49,414 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:03:49,415 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:03:49,415 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:03:49,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:03:49,415 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:03:49,415 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:03:49,416 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:03:49,416 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:03:49,416 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:03:49,416 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:03:49,452 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:03:49,465 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:03:49,468 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:03:49,470 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:03:49,470 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:03:49,471 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-10 08:03:49,529 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03c84fd95/8e40d5f71012481cb69a474f0ab41a45/FLAGe354b68ed [2019-09-10 08:03:50,249 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:03:50,250 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-10 08:03:50,275 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03c84fd95/8e40d5f71012481cb69a474f0ab41a45/FLAGe354b68ed [2019-09-10 08:03:50,363 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03c84fd95/8e40d5f71012481cb69a474f0ab41a45 [2019-09-10 08:03:50,371 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:03:50,372 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:03:50,374 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:03:50,374 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:03:50,377 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:03:50,378 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:03:50" (1/1) ... [2019-09-10 08:03:50,381 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3476d99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:03:50, skipping insertion in model container [2019-09-10 08:03:50,381 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:03:50" (1/1) ... [2019-09-10 08:03:50,389 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:03:50,508 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:03:51,470 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:03:51,494 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:03:51,787 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:03:51,816 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:03:51,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:03:51 WrapperNode [2019-09-10 08:03:51,817 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:03:51,818 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:03:51,818 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:03:51,818 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:03:51,840 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:03:51" (1/1) ... [2019-09-10 08:03:51,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:03:51" (1/1) ... [2019-09-10 08:03:51,903 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:03:51" (1/1) ... [2019-09-10 08:03:51,904 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:03:51" (1/1) ... [2019-09-10 08:03:51,980 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:03:51" (1/1) ... [2019-09-10 08:03:52,028 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:03:51" (1/1) ... [2019-09-10 08:03:52,039 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:03:51" (1/1) ... [2019-09-10 08:03:52,055 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:03:52,055 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:03:52,055 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:03:52,056 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:03:52,057 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:03:51" (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:03:52,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:03:52,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:03:52,143 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:03:52,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:03:52,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:03:52,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:03:52,144 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:03:52,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:03:52,145 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:03:52,145 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:03:52,146 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:03:52,146 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:03:52,146 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:03:52,146 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:03:52,146 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:03:52,147 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:03:52,147 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:03:52,147 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:03:52,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:03:52,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:03:54,865 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:03:54,865 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:03:54,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:03:54 BoogieIcfgContainer [2019-09-10 08:03:54,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:03:54,870 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:03:54,870 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:03:54,874 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:03:54,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:03:50" (1/3) ... [2019-09-10 08:03:54,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@376cf4b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:03:54, skipping insertion in model container [2019-09-10 08:03:54,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:03:51" (2/3) ... [2019-09-10 08:03:54,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@376cf4b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:03:54, skipping insertion in model container [2019-09-10 08:03:54,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:03:54" (3/3) ... [2019-09-10 08:03:54,882 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-10 08:03:54,893 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:03:54,911 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-09-10 08:03:54,928 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-09-10 08:03:54,956 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:03:54,957 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:03:54,957 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:03:54,957 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:03:54,957 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:03:54,957 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:03:54,958 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:03:54,958 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:03:54,988 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states. [2019-09-10 08:03:55,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 08:03:55,011 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:55,012 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:03:55,015 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:55,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:55,021 INFO L82 PathProgramCache]: Analyzing trace with hash 446132065, now seen corresponding path program 1 times [2019-09-10 08:03:55,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:55,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:55,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:55,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:55,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:55,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:03:55,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:03:55,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:03:55,664 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:03:55,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:03:55,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:03:55,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:03:55,687 INFO L87 Difference]: Start difference. First operand 634 states. Second operand 5 states. [2019-09-10 08:03:56,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:56,506 INFO L93 Difference]: Finished difference Result 517 states and 874 transitions. [2019-09-10 08:03:56,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:03:56,510 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-09-10 08:03:56,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:56,538 INFO L225 Difference]: With dead ends: 517 [2019-09-10 08:03:56,538 INFO L226 Difference]: Without dead ends: 505 [2019-09-10 08:03:56,542 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:03:56,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-09-10 08:03:56,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2019-09-10 08:03:56,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-09-10 08:03:56,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 638 transitions. [2019-09-10 08:03:56,642 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 638 transitions. Word has length 76 [2019-09-10 08:03:56,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:56,643 INFO L475 AbstractCegarLoop]: Abstraction has 505 states and 638 transitions. [2019-09-10 08:03:56,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:03:56,643 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 638 transitions. [2019-09-10 08:03:56,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 08:03:56,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:56,653 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:03:56,653 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:56,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:56,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1643184449, now seen corresponding path program 1 times [2019-09-10 08:03:56,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:56,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:56,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:56,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:56,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:56,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:56,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:03:56,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:03:56,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:03:56,833 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:03:56,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:03:56,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:03:56,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:03:56,838 INFO L87 Difference]: Start difference. First operand 505 states and 638 transitions. Second operand 5 states. [2019-09-10 08:03:57,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:57,260 INFO L93 Difference]: Finished difference Result 444 states and 568 transitions. [2019-09-10 08:03:57,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:03:57,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-10 08:03:57,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:57,264 INFO L225 Difference]: With dead ends: 444 [2019-09-10 08:03:57,264 INFO L226 Difference]: Without dead ends: 444 [2019-09-10 08:03:57,265 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:03:57,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-09-10 08:03:57,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2019-09-10 08:03:57,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2019-09-10 08:03:57,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 568 transitions. [2019-09-10 08:03:57,276 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 568 transitions. Word has length 77 [2019-09-10 08:03:57,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:57,276 INFO L475 AbstractCegarLoop]: Abstraction has 444 states and 568 transitions. [2019-09-10 08:03:57,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:03:57,277 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 568 transitions. [2019-09-10 08:03:57,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 08:03:57,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:57,279 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:03:57,279 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:57,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:57,280 INFO L82 PathProgramCache]: Analyzing trace with hash -98932957, now seen corresponding path program 1 times [2019-09-10 08:03:57,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:57,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:57,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:57,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:57,283 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:57,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:03:57,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:03:57,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:03:57,427 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:03:57,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:03:57,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:03:57,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:03:57,429 INFO L87 Difference]: Start difference. First operand 444 states and 568 transitions. Second operand 5 states. [2019-09-10 08:03:57,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:57,951 INFO L93 Difference]: Finished difference Result 418 states and 537 transitions. [2019-09-10 08:03:57,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:03:57,952 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-10 08:03:57,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:57,956 INFO L225 Difference]: With dead ends: 418 [2019-09-10 08:03:57,956 INFO L226 Difference]: Without dead ends: 418 [2019-09-10 08:03:57,956 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:03:57,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-09-10 08:03:57,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2019-09-10 08:03:57,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-09-10 08:03:57,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 537 transitions. [2019-09-10 08:03:57,966 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 537 transitions. Word has length 78 [2019-09-10 08:03:57,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:57,967 INFO L475 AbstractCegarLoop]: Abstraction has 418 states and 537 transitions. [2019-09-10 08:03:57,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:03:57,967 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 537 transitions. [2019-09-10 08:03:57,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 08:03:57,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:57,969 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:03:57,969 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:57,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:57,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1520302037, now seen corresponding path program 1 times [2019-09-10 08:03:57,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:57,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:57,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:57,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:57,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:58,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:58,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:03:58,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:03:58,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:03:58,132 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:03:58,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:03:58,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:03:58,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:03:58,135 INFO L87 Difference]: Start difference. First operand 418 states and 537 transitions. Second operand 5 states. [2019-09-10 08:03:58,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:58,594 INFO L93 Difference]: Finished difference Result 408 states and 524 transitions. [2019-09-10 08:03:58,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:03:58,594 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-09-10 08:03:58,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:58,597 INFO L225 Difference]: With dead ends: 408 [2019-09-10 08:03:58,597 INFO L226 Difference]: Without dead ends: 408 [2019-09-10 08:03:58,597 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:03:58,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-09-10 08:03:58,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2019-09-10 08:03:58,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-09-10 08:03:58,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 524 transitions. [2019-09-10 08:03:58,606 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 524 transitions. Word has length 79 [2019-09-10 08:03:58,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:58,607 INFO L475 AbstractCegarLoop]: Abstraction has 408 states and 524 transitions. [2019-09-10 08:03:58,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:03:58,607 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 524 transitions. [2019-09-10 08:03:58,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 08:03:58,609 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:58,609 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] [2019-09-10 08:03:58,610 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:58,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:58,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1777858629, now seen corresponding path program 1 times [2019-09-10 08:03:58,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:58,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:58,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:58,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:58,612 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:58,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:03:58,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:03:58,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:03:58,749 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:03:58,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:03:58,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:03:58,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:03:58,751 INFO L87 Difference]: Start difference. First operand 408 states and 524 transitions. Second operand 5 states. [2019-09-10 08:03:59,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:59,119 INFO L93 Difference]: Finished difference Result 397 states and 511 transitions. [2019-09-10 08:03:59,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:03:59,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-09-10 08:03:59,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:59,122 INFO L225 Difference]: With dead ends: 397 [2019-09-10 08:03:59,122 INFO L226 Difference]: Without dead ends: 397 [2019-09-10 08:03:59,123 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:03:59,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-09-10 08:03:59,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2019-09-10 08:03:59,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-10 08:03:59,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 511 transitions. [2019-09-10 08:03:59,132 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 511 transitions. Word has length 80 [2019-09-10 08:03:59,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:59,133 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 511 transitions. [2019-09-10 08:03:59,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:03:59,133 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 511 transitions. [2019-09-10 08:03:59,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 08:03:59,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:59,134 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:03:59,135 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:59,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:59,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1690487197, now seen corresponding path program 1 times [2019-09-10 08:03:59,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:59,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:59,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:59,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:59,137 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:59,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:59,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:03:59,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:03:59,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:03:59,434 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:03:59,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:03:59,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:03:59,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:03:59,435 INFO L87 Difference]: Start difference. First operand 397 states and 511 transitions. Second operand 9 states. [2019-09-10 08:04:00,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:00,882 INFO L93 Difference]: Finished difference Result 741 states and 982 transitions. [2019-09-10 08:04:00,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:04:00,883 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-10 08:04:00,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:00,887 INFO L225 Difference]: With dead ends: 741 [2019-09-10 08:04:00,887 INFO L226 Difference]: Without dead ends: 741 [2019-09-10 08:04:00,888 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:04:00,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2019-09-10 08:04:00,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 397. [2019-09-10 08:04:00,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-10 08:04:00,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 510 transitions. [2019-09-10 08:04:00,901 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 510 transitions. Word has length 81 [2019-09-10 08:04:00,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:00,901 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 510 transitions. [2019-09-10 08:04:00,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:04:00,901 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 510 transitions. [2019-09-10 08:04:00,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 08:04:00,903 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:00,903 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:00,904 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:00,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:00,904 INFO L82 PathProgramCache]: Analyzing trace with hash 533330474, now seen corresponding path program 1 times [2019-09-10 08:04:00,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:00,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:00,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:00,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:00,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:00,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:01,093 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:04:01,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:01,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:04:01,094 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:01,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:04:01,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:04:01,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:04:01,095 INFO L87 Difference]: Start difference. First operand 397 states and 510 transitions. Second operand 9 states. [2019-09-10 08:04:02,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:02,541 INFO L93 Difference]: Finished difference Result 745 states and 985 transitions. [2019-09-10 08:04:02,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:04:02,542 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-10 08:04:02,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:02,546 INFO L225 Difference]: With dead ends: 745 [2019-09-10 08:04:02,546 INFO L226 Difference]: Without dead ends: 745 [2019-09-10 08:04:02,547 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:04:02,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2019-09-10 08:04:02,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 397. [2019-09-10 08:04:02,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-10 08:04:02,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 509 transitions. [2019-09-10 08:04:02,563 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 509 transitions. Word has length 81 [2019-09-10 08:04:02,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:02,564 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 509 transitions. [2019-09-10 08:04:02,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:04:02,564 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 509 transitions. [2019-09-10 08:04:02,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 08:04:02,565 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:02,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] [2019-09-10 08:04:02,569 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:02,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:02,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1325711291, now seen corresponding path program 1 times [2019-09-10 08:04:02,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:02,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:02,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:02,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:02,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:02,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:02,756 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:04:02,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:02,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:04:02,756 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:02,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:04:02,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:04:02,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:04:02,758 INFO L87 Difference]: Start difference. First operand 397 states and 509 transitions. Second operand 8 states. [2019-09-10 08:04:03,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:03,660 INFO L93 Difference]: Finished difference Result 551 states and 685 transitions. [2019-09-10 08:04:03,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:04:03,660 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 81 [2019-09-10 08:04:03,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:03,664 INFO L225 Difference]: With dead ends: 551 [2019-09-10 08:04:03,665 INFO L226 Difference]: Without dead ends: 551 [2019-09-10 08:04:03,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:04:03,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-09-10 08:04:03,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 397. [2019-09-10 08:04:03,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-10 08:04:03,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 508 transitions. [2019-09-10 08:04:03,676 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 508 transitions. Word has length 81 [2019-09-10 08:04:03,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:03,676 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 508 transitions. [2019-09-10 08:04:03,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:04:03,676 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 508 transitions. [2019-09-10 08:04:03,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 08:04:03,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:03,678 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:03,678 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:03,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:03,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1670879057, now seen corresponding path program 1 times [2019-09-10 08:04:03,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:03,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:03,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:03,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:03,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:03,872 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:04:03,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:03,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:04:03,873 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:03,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:04:03,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:04:03,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:04:03,875 INFO L87 Difference]: Start difference. First operand 397 states and 508 transitions. Second operand 9 states. [2019-09-10 08:04:05,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:05,558 INFO L93 Difference]: Finished difference Result 733 states and 962 transitions. [2019-09-10 08:04:05,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:04:05,559 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 08:04:05,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:05,566 INFO L225 Difference]: With dead ends: 733 [2019-09-10 08:04:05,566 INFO L226 Difference]: Without dead ends: 733 [2019-09-10 08:04:05,567 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:04:05,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-09-10 08:04:05,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 397. [2019-09-10 08:04:05,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-10 08:04:05,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 507 transitions. [2019-09-10 08:04:05,587 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 507 transitions. Word has length 83 [2019-09-10 08:04:05,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:05,588 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 507 transitions. [2019-09-10 08:04:05,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:04:05,588 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 507 transitions. [2019-09-10 08:04:05,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 08:04:05,590 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:05,591 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:05,592 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:05,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:05,592 INFO L82 PathProgramCache]: Analyzing trace with hash 2064402550, now seen corresponding path program 1 times [2019-09-10 08:04:05,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:05,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:05,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:05,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:05,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:05,910 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:04:05,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:05,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:04:05,911 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:05,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:04:05,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:04:05,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:04:05,912 INFO L87 Difference]: Start difference. First operand 397 states and 507 transitions. Second operand 9 states. [2019-09-10 08:04:07,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:07,501 INFO L93 Difference]: Finished difference Result 733 states and 960 transitions. [2019-09-10 08:04:07,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:04:07,501 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 08:04:07,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:07,505 INFO L225 Difference]: With dead ends: 733 [2019-09-10 08:04:07,506 INFO L226 Difference]: Without dead ends: 733 [2019-09-10 08:04:07,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:04:07,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-09-10 08:04:07,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 397. [2019-09-10 08:04:07,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-10 08:04:07,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 506 transitions. [2019-09-10 08:04:07,518 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 506 transitions. Word has length 83 [2019-09-10 08:04:07,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:07,518 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 506 transitions. [2019-09-10 08:04:07,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:04:07,518 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 506 transitions. [2019-09-10 08:04:07,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 08:04:07,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:07,520 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:07,520 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:07,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:07,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1181772490, now seen corresponding path program 1 times [2019-09-10 08:04:07,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:07,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:07,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:07,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:07,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:07,698 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:04:07,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:07,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:04:07,698 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:07,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:04:07,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:04:07,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:04:07,700 INFO L87 Difference]: Start difference. First operand 397 states and 506 transitions. Second operand 9 states. [2019-09-10 08:04:09,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:09,425 INFO L93 Difference]: Finished difference Result 733 states and 959 transitions. [2019-09-10 08:04:09,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:04:09,426 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 08:04:09,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:09,430 INFO L225 Difference]: With dead ends: 733 [2019-09-10 08:04:09,431 INFO L226 Difference]: Without dead ends: 733 [2019-09-10 08:04:09,431 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:04:09,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-09-10 08:04:09,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 397. [2019-09-10 08:04:09,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-10 08:04:09,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 505 transitions. [2019-09-10 08:04:09,442 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 505 transitions. Word has length 83 [2019-09-10 08:04:09,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:09,442 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 505 transitions. [2019-09-10 08:04:09,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:04:09,443 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 505 transitions. [2019-09-10 08:04:09,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 08:04:09,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:09,444 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:09,445 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:09,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:09,445 INFO L82 PathProgramCache]: Analyzing trace with hash -876834767, now seen corresponding path program 1 times [2019-09-10 08:04:09,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:09,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:09,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:09,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:09,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:09,628 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:04:09,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:09,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:04:09,628 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:09,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:04:09,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:04:09,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:04:09,630 INFO L87 Difference]: Start difference. First operand 397 states and 505 transitions. Second operand 9 states. [2019-09-10 08:04:11,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:11,348 INFO L93 Difference]: Finished difference Result 741 states and 974 transitions. [2019-09-10 08:04:11,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:04:11,349 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 08:04:11,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:11,354 INFO L225 Difference]: With dead ends: 741 [2019-09-10 08:04:11,354 INFO L226 Difference]: Without dead ends: 741 [2019-09-10 08:04:11,354 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:04:11,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2019-09-10 08:04:11,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 397. [2019-09-10 08:04:11,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-10 08:04:11,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 504 transitions. [2019-09-10 08:04:11,365 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 504 transitions. Word has length 83 [2019-09-10 08:04:11,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:11,365 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 504 transitions. [2019-09-10 08:04:11,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:04:11,365 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 504 transitions. [2019-09-10 08:04:11,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 08:04:11,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:11,367 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:11,367 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:11,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:11,368 INFO L82 PathProgramCache]: Analyzing trace with hash 287644134, now seen corresponding path program 1 times [2019-09-10 08:04:11,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:11,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:11,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:11,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:11,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:11,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:11,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:04:11,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:11,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:04:11,526 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:11,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:04:11,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:04:11,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:04:11,527 INFO L87 Difference]: Start difference. First operand 397 states and 504 transitions. Second operand 9 states. [2019-09-10 08:04:13,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:13,270 INFO L93 Difference]: Finished difference Result 733 states and 957 transitions. [2019-09-10 08:04:13,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:04:13,271 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 08:04:13,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:13,276 INFO L225 Difference]: With dead ends: 733 [2019-09-10 08:04:13,276 INFO L226 Difference]: Without dead ends: 733 [2019-09-10 08:04:13,276 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:04:13,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-09-10 08:04:13,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 397. [2019-09-10 08:04:13,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-10 08:04:13,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 503 transitions. [2019-09-10 08:04:13,286 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 503 transitions. Word has length 83 [2019-09-10 08:04:13,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:13,287 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 503 transitions. [2019-09-10 08:04:13,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:04:13,287 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 503 transitions. [2019-09-10 08:04:13,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 08:04:13,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:13,288 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:13,289 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:13,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:13,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1062374831, now seen corresponding path program 1 times [2019-09-10 08:04:13,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:13,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:13,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:13,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:13,291 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:13,438 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:04:13,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:13,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:04:13,439 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:13,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:04:13,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:04:13,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:04:13,440 INFO L87 Difference]: Start difference. First operand 397 states and 503 transitions. Second operand 9 states. [2019-09-10 08:04:15,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:15,058 INFO L93 Difference]: Finished difference Result 741 states and 972 transitions. [2019-09-10 08:04:15,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:04:15,058 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 08:04:15,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:15,063 INFO L225 Difference]: With dead ends: 741 [2019-09-10 08:04:15,064 INFO L226 Difference]: Without dead ends: 741 [2019-09-10 08:04:15,064 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:04:15,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2019-09-10 08:04:15,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 397. [2019-09-10 08:04:15,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-10 08:04:15,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 502 transitions. [2019-09-10 08:04:15,075 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 502 transitions. Word has length 83 [2019-09-10 08:04:15,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:15,075 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 502 transitions. [2019-09-10 08:04:15,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:04:15,075 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 502 transitions. [2019-09-10 08:04:15,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 08:04:15,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:15,077 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:15,077 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:15,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:15,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1850218341, now seen corresponding path program 1 times [2019-09-10 08:04:15,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:15,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:15,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:15,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:15,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:15,245 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:04:15,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:15,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:04:15,246 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:15,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:04:15,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:04:15,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:04:15,247 INFO L87 Difference]: Start difference. First operand 397 states and 502 transitions. Second operand 9 states. [2019-09-10 08:04:16,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:16,803 INFO L93 Difference]: Finished difference Result 745 states and 974 transitions. [2019-09-10 08:04:16,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:04:16,804 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 08:04:16,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:16,808 INFO L225 Difference]: With dead ends: 745 [2019-09-10 08:04:16,808 INFO L226 Difference]: Without dead ends: 745 [2019-09-10 08:04:16,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:04:16,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2019-09-10 08:04:16,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 397. [2019-09-10 08:04:16,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-10 08:04:16,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 501 transitions. [2019-09-10 08:04:16,820 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 501 transitions. Word has length 83 [2019-09-10 08:04:16,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:16,820 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 501 transitions. [2019-09-10 08:04:16,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:04:16,820 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 501 transitions. [2019-09-10 08:04:16,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:04:16,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:16,822 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:16,828 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:16,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:16,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1299527057, now seen corresponding path program 1 times [2019-09-10 08:04:16,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:16,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:16,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:16,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:16,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:17,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:04:17,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:17,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:04:17,018 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:17,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:04:17,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:04:17,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:04:17,019 INFO L87 Difference]: Start difference. First operand 397 states and 501 transitions. Second operand 9 states. [2019-09-10 08:04:18,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:18,817 INFO L93 Difference]: Finished difference Result 717 states and 926 transitions. [2019-09-10 08:04:18,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:04:18,818 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 08:04:18,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:18,822 INFO L225 Difference]: With dead ends: 717 [2019-09-10 08:04:18,822 INFO L226 Difference]: Without dead ends: 717 [2019-09-10 08:04:18,823 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:04:18,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-09-10 08:04:18,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 397. [2019-09-10 08:04:18,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-10 08:04:18,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 500 transitions. [2019-09-10 08:04:18,837 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 500 transitions. Word has length 85 [2019-09-10 08:04:18,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:18,838 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 500 transitions. [2019-09-10 08:04:18,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:04:18,838 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 500 transitions. [2019-09-10 08:04:18,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:04:18,839 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:18,840 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:18,840 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:18,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:18,841 INFO L82 PathProgramCache]: Analyzing trace with hash -716975399, now seen corresponding path program 1 times [2019-09-10 08:04:18,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:18,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:18,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:18,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:18,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:19,043 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:04:19,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:19,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:04:19,044 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:19,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:04:19,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:04:19,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:04:19,045 INFO L87 Difference]: Start difference. First operand 397 states and 500 transitions. Second operand 9 states. [2019-09-10 08:04:20,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:20,552 INFO L93 Difference]: Finished difference Result 717 states and 925 transitions. [2019-09-10 08:04:20,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:04:20,553 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 08:04:20,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:20,557 INFO L225 Difference]: With dead ends: 717 [2019-09-10 08:04:20,558 INFO L226 Difference]: Without dead ends: 717 [2019-09-10 08:04:20,558 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:04:20,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-09-10 08:04:20,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 397. [2019-09-10 08:04:20,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-10 08:04:20,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 499 transitions. [2019-09-10 08:04:20,568 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 499 transitions. Word has length 85 [2019-09-10 08:04:20,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:20,569 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 499 transitions. [2019-09-10 08:04:20,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:04:20,569 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 499 transitions. [2019-09-10 08:04:20,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:04:20,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:20,570 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:20,571 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:20,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:20,571 INFO L82 PathProgramCache]: Analyzing trace with hash 777191179, now seen corresponding path program 1 times [2019-09-10 08:04:20,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:20,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:20,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:20,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:20,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:20,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:20,750 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:04:20,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:20,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:04:20,751 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:20,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:04:20,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:04:20,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:04:20,753 INFO L87 Difference]: Start difference. First operand 397 states and 499 transitions. Second operand 9 states. [2019-09-10 08:04:22,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:22,300 INFO L93 Difference]: Finished difference Result 717 states and 924 transitions. [2019-09-10 08:04:22,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:04:22,300 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 08:04:22,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:22,304 INFO L225 Difference]: With dead ends: 717 [2019-09-10 08:04:22,304 INFO L226 Difference]: Without dead ends: 717 [2019-09-10 08:04:22,304 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:04:22,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-09-10 08:04:22,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 397. [2019-09-10 08:04:22,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-10 08:04:22,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 498 transitions. [2019-09-10 08:04:22,313 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 498 transitions. Word has length 85 [2019-09-10 08:04:22,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:22,314 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 498 transitions. [2019-09-10 08:04:22,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:04:22,314 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 498 transitions. [2019-09-10 08:04:22,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:04:22,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:22,315 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:22,316 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:22,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:22,316 INFO L82 PathProgramCache]: Analyzing trace with hash -496308349, now seen corresponding path program 1 times [2019-09-10 08:04:22,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:22,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:22,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:22,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:22,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:22,468 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:04:22,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:22,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:04:22,469 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:22,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:04:22,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:04:22,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:04:22,470 INFO L87 Difference]: Start difference. First operand 397 states and 498 transitions. Second operand 9 states. [2019-09-10 08:04:24,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:24,242 INFO L93 Difference]: Finished difference Result 717 states and 922 transitions. [2019-09-10 08:04:24,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:04:24,242 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 08:04:24,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:24,246 INFO L225 Difference]: With dead ends: 717 [2019-09-10 08:04:24,246 INFO L226 Difference]: Without dead ends: 717 [2019-09-10 08:04:24,247 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:04:24,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-09-10 08:04:24,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 397. [2019-09-10 08:04:24,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-10 08:04:24,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 497 transitions. [2019-09-10 08:04:24,255 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 497 transitions. Word has length 85 [2019-09-10 08:04:24,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:24,256 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 497 transitions. [2019-09-10 08:04:24,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:04:24,256 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 497 transitions. [2019-09-10 08:04:24,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:04:24,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:24,258 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:24,258 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:24,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:24,258 INFO L82 PathProgramCache]: Analyzing trace with hash -2124094268, now seen corresponding path program 1 times [2019-09-10 08:04:24,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:24,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:24,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:24,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:24,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:24,408 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:04:24,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:24,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:04:24,409 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:24,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:04:24,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:04:24,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:04:24,410 INFO L87 Difference]: Start difference. First operand 397 states and 497 transitions. Second operand 9 states. [2019-09-10 08:04:26,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:26,142 INFO L93 Difference]: Finished difference Result 717 states and 921 transitions. [2019-09-10 08:04:26,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:04:26,143 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 08:04:26,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:26,147 INFO L225 Difference]: With dead ends: 717 [2019-09-10 08:04:26,147 INFO L226 Difference]: Without dead ends: 717 [2019-09-10 08:04:26,148 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:04:26,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-09-10 08:04:26,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 397. [2019-09-10 08:04:26,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-10 08:04:26,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 496 transitions. [2019-09-10 08:04:26,156 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 496 transitions. Word has length 85 [2019-09-10 08:04:26,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:26,157 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 496 transitions. [2019-09-10 08:04:26,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:04:26,157 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 496 transitions. [2019-09-10 08:04:26,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:04:26,158 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:26,158 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:26,159 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:26,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:26,159 INFO L82 PathProgramCache]: Analyzing trace with hash -194937756, now seen corresponding path program 1 times [2019-09-10 08:04:26,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:26,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:26,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:26,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:26,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:26,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:26,313 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:04:26,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:26,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:04:26,313 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:26,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:04:26,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:04:26,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:04:26,315 INFO L87 Difference]: Start difference. First operand 397 states and 496 transitions. Second operand 9 states. [2019-09-10 08:04:27,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:27,874 INFO L93 Difference]: Finished difference Result 733 states and 945 transitions. [2019-09-10 08:04:27,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:04:27,875 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 08:04:27,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:27,879 INFO L225 Difference]: With dead ends: 733 [2019-09-10 08:04:27,879 INFO L226 Difference]: Without dead ends: 733 [2019-09-10 08:04:27,880 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:04:27,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-09-10 08:04:27,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 397. [2019-09-10 08:04:27,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-10 08:04:27,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 495 transitions. [2019-09-10 08:04:27,888 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 495 transitions. Word has length 85 [2019-09-10 08:04:27,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:27,889 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 495 transitions. [2019-09-10 08:04:27,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:04:27,889 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 495 transitions. [2019-09-10 08:04:27,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:04:27,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:27,891 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:27,891 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:27,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:27,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1160181619, now seen corresponding path program 1 times [2019-09-10 08:04:27,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:27,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:27,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:27,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:27,893 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:28,059 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:04:28,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:28,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:04:28,059 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:28,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:04:28,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:04:28,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:04:28,060 INFO L87 Difference]: Start difference. First operand 397 states and 495 transitions. Second operand 9 states. [2019-09-10 08:04:29,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:29,717 INFO L93 Difference]: Finished difference Result 717 states and 919 transitions. [2019-09-10 08:04:29,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:04:29,722 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 08:04:29,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:29,726 INFO L225 Difference]: With dead ends: 717 [2019-09-10 08:04:29,726 INFO L226 Difference]: Without dead ends: 717 [2019-09-10 08:04:29,726 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:04:29,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-09-10 08:04:29,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 397. [2019-09-10 08:04:29,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-10 08:04:29,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 494 transitions. [2019-09-10 08:04:29,735 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 494 transitions. Word has length 85 [2019-09-10 08:04:29,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:29,736 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 494 transitions. [2019-09-10 08:04:29,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:04:29,736 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 494 transitions. [2019-09-10 08:04:29,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:04:29,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:29,738 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:29,738 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:29,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:29,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1009658424, now seen corresponding path program 1 times [2019-09-10 08:04:29,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:29,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:29,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:29,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:29,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:29,936 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:04:29,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:29,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:04:29,937 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:29,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:04:29,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:04:29,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:04:29,938 INFO L87 Difference]: Start difference. First operand 397 states and 494 transitions. Second operand 9 states. [2019-09-10 08:04:31,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:31,653 INFO L93 Difference]: Finished difference Result 717 states and 917 transitions. [2019-09-10 08:04:31,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:04:31,654 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 08:04:31,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:31,658 INFO L225 Difference]: With dead ends: 717 [2019-09-10 08:04:31,658 INFO L226 Difference]: Without dead ends: 717 [2019-09-10 08:04:31,659 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:04:31,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-09-10 08:04:31,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 397. [2019-09-10 08:04:31,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-10 08:04:31,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 493 transitions. [2019-09-10 08:04:31,665 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 493 transitions. Word has length 85 [2019-09-10 08:04:31,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:31,665 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 493 transitions. [2019-09-10 08:04:31,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:04:31,666 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 493 transitions. [2019-09-10 08:04:31,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:04:31,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:31,686 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:31,686 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:31,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:31,687 INFO L82 PathProgramCache]: Analyzing trace with hash -527052732, now seen corresponding path program 1 times [2019-09-10 08:04:31,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:31,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:31,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:31,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:31,688 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:31,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:31,840 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:04:31,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:31,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:04:31,841 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:31,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:04:31,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:04:31,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:04:31,842 INFO L87 Difference]: Start difference. First operand 397 states and 493 transitions. Second operand 9 states. [2019-09-10 08:04:33,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:33,372 INFO L93 Difference]: Finished difference Result 717 states and 916 transitions. [2019-09-10 08:04:33,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:04:33,373 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 08:04:33,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:33,377 INFO L225 Difference]: With dead ends: 717 [2019-09-10 08:04:33,377 INFO L226 Difference]: Without dead ends: 717 [2019-09-10 08:04:33,377 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:04:33,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-09-10 08:04:33,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 397. [2019-09-10 08:04:33,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-10 08:04:33,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 492 transitions. [2019-09-10 08:04:33,384 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 492 transitions. Word has length 85 [2019-09-10 08:04:33,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:33,385 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 492 transitions. [2019-09-10 08:04:33,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:04:33,385 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 492 transitions. [2019-09-10 08:04:33,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:04:33,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:33,387 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:33,387 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:33,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:33,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1402103780, now seen corresponding path program 1 times [2019-09-10 08:04:33,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:33,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:33,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:33,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:33,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:33,534 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:04:33,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:33,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:04:33,534 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:33,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:04:33,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:04:33,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:04:33,535 INFO L87 Difference]: Start difference. First operand 397 states and 492 transitions. Second operand 9 states. [2019-09-10 08:04:35,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:35,162 INFO L93 Difference]: Finished difference Result 733 states and 941 transitions. [2019-09-10 08:04:35,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:04:35,163 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 08:04:35,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:35,167 INFO L225 Difference]: With dead ends: 733 [2019-09-10 08:04:35,167 INFO L226 Difference]: Without dead ends: 733 [2019-09-10 08:04:35,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:04:35,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-09-10 08:04:35,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 397. [2019-09-10 08:04:35,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-10 08:04:35,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 491 transitions. [2019-09-10 08:04:35,174 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 491 transitions. Word has length 85 [2019-09-10 08:04:35,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:35,175 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 491 transitions. [2019-09-10 08:04:35,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:04:35,175 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 491 transitions. [2019-09-10 08:04:35,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:04:35,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:35,176 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:35,176 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:35,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:35,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1985070686, now seen corresponding path program 1 times [2019-09-10 08:04:35,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:35,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:35,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:35,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:35,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:35,343 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:04:35,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:35,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:04:35,344 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:35,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:04:35,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:04:35,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:04:35,346 INFO L87 Difference]: Start difference. First operand 397 states and 491 transitions. Second operand 9 states. [2019-09-10 08:04:37,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:37,021 INFO L93 Difference]: Finished difference Result 741 states and 953 transitions. [2019-09-10 08:04:37,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:04:37,021 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 08:04:37,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:37,025 INFO L225 Difference]: With dead ends: 741 [2019-09-10 08:04:37,025 INFO L226 Difference]: Without dead ends: 741 [2019-09-10 08:04:37,025 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:04:37,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2019-09-10 08:04:37,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 397. [2019-09-10 08:04:37,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-10 08:04:37,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 490 transitions. [2019-09-10 08:04:37,032 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 490 transitions. Word has length 85 [2019-09-10 08:04:37,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:37,032 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 490 transitions. [2019-09-10 08:04:37,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:04:37,033 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 490 transitions. [2019-09-10 08:04:37,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:04:37,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:37,034 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:37,034 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:37,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:37,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1621426561, now seen corresponding path program 1 times [2019-09-10 08:04:37,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:37,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:37,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:37,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:37,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:37,186 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:04:37,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:37,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:04:37,187 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:37,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:04:37,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:04:37,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:04:37,188 INFO L87 Difference]: Start difference. First operand 397 states and 490 transitions. Second operand 9 states. [2019-09-10 08:04:38,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:38,520 INFO L93 Difference]: Finished difference Result 717 states and 913 transitions. [2019-09-10 08:04:38,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:04:38,521 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 08:04:38,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:38,524 INFO L225 Difference]: With dead ends: 717 [2019-09-10 08:04:38,524 INFO L226 Difference]: Without dead ends: 717 [2019-09-10 08:04:38,525 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:04:38,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-09-10 08:04:38,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 397. [2019-09-10 08:04:38,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-10 08:04:38,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 489 transitions. [2019-09-10 08:04:38,530 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 489 transitions. Word has length 85 [2019-09-10 08:04:38,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:38,530 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 489 transitions. [2019-09-10 08:04:38,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:04:38,530 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 489 transitions. [2019-09-10 08:04:38,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:04:38,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:38,531 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:38,531 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:38,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:38,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1236378400, now seen corresponding path program 1 times [2019-09-10 08:04:38,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:38,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:38,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:38,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:38,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:38,699 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:04:38,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:38,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:04:38,699 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:38,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:04:38,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:04:38,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:04:38,700 INFO L87 Difference]: Start difference. First operand 397 states and 489 transitions. Second operand 9 states. [2019-09-10 08:04:40,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:40,417 INFO L93 Difference]: Finished difference Result 733 states and 936 transitions. [2019-09-10 08:04:40,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:04:40,418 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 08:04:40,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:40,421 INFO L225 Difference]: With dead ends: 733 [2019-09-10 08:04:40,422 INFO L226 Difference]: Without dead ends: 733 [2019-09-10 08:04:40,422 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:04:40,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-09-10 08:04:40,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 397. [2019-09-10 08:04:40,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-10 08:04:40,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 488 transitions. [2019-09-10 08:04:40,428 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 488 transitions. Word has length 85 [2019-09-10 08:04:40,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:40,429 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 488 transitions. [2019-09-10 08:04:40,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:04:40,429 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 488 transitions. [2019-09-10 08:04:40,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:04:40,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:40,430 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:40,430 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:40,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:40,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1585291813, now seen corresponding path program 1 times [2019-09-10 08:04:40,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:40,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:40,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:40,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:40,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:40,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:04:40,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:40,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:04:40,597 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:40,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:04:40,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:04:40,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:04:40,598 INFO L87 Difference]: Start difference. First operand 397 states and 488 transitions. Second operand 9 states. [2019-09-10 08:04:42,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:42,235 INFO L93 Difference]: Finished difference Result 717 states and 911 transitions. [2019-09-10 08:04:42,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:04:42,236 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 08:04:42,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:42,240 INFO L225 Difference]: With dead ends: 717 [2019-09-10 08:04:42,241 INFO L226 Difference]: Without dead ends: 717 [2019-09-10 08:04:42,241 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:04:42,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-09-10 08:04:42,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 397. [2019-09-10 08:04:42,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-10 08:04:42,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 487 transitions. [2019-09-10 08:04:42,247 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 487 transitions. Word has length 85 [2019-09-10 08:04:42,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:42,247 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 487 transitions. [2019-09-10 08:04:42,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:04:42,248 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 487 transitions. [2019-09-10 08:04:42,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:04:42,248 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:42,248 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:42,249 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:42,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:42,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1435826419, now seen corresponding path program 1 times [2019-09-10 08:04:42,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:42,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:42,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:42,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:42,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:42,389 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:04:42,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:42,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:04:42,390 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:42,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:04:42,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:04:42,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:04:42,392 INFO L87 Difference]: Start difference. First operand 397 states and 487 transitions. Second operand 9 states. [2019-09-10 08:04:44,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:44,172 INFO L93 Difference]: Finished difference Result 717 states and 909 transitions. [2019-09-10 08:04:44,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:04:44,173 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-10 08:04:44,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:44,177 INFO L225 Difference]: With dead ends: 717 [2019-09-10 08:04:44,177 INFO L226 Difference]: Without dead ends: 717 [2019-09-10 08:04:44,178 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:04:44,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-09-10 08:04:44,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 397. [2019-09-10 08:04:44,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-10 08:04:44,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 486 transitions. [2019-09-10 08:04:44,183 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 486 transitions. Word has length 85 [2019-09-10 08:04:44,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:44,183 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 486 transitions. [2019-09-10 08:04:44,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:04:44,183 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 486 transitions. [2019-09-10 08:04:44,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:04:44,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:44,184 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:44,184 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:44,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:44,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1981907169, now seen corresponding path program 1 times [2019-09-10 08:04:44,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:44,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:44,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:44,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:44,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:44,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:45,692 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:04:45,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:45,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:04:45,693 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:45,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:04:45,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:04:45,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:04:45,694 INFO L87 Difference]: Start difference. First operand 397 states and 486 transitions. Second operand 22 states. [2019-09-10 08:04:46,833 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-09-10 08:04:47,107 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2019-09-10 08:04:47,520 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-10 08:04:47,700 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-10 08:04:47,921 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-10 08:04:48,131 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-10 08:04:48,339 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-10 08:04:48,566 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-10 08:04:48,991 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2019-09-10 08:04:52,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:52,230 INFO L93 Difference]: Finished difference Result 755 states and 943 transitions. [2019-09-10 08:04:52,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 08:04:52,230 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 87 [2019-09-10 08:04:52,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:52,233 INFO L225 Difference]: With dead ends: 755 [2019-09-10 08:04:52,233 INFO L226 Difference]: Without dead ends: 755 [2019-09-10 08:04:52,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:04:52,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-09-10 08:04:52,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 403. [2019-09-10 08:04:52,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-09-10 08:04:52,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 492 transitions. [2019-09-10 08:04:52,241 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 492 transitions. Word has length 87 [2019-09-10 08:04:52,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:52,241 INFO L475 AbstractCegarLoop]: Abstraction has 403 states and 492 transitions. [2019-09-10 08:04:52,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:04:52,242 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 492 transitions. [2019-09-10 08:04:52,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:04:52,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:52,243 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:52,243 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:52,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:52,243 INFO L82 PathProgramCache]: Analyzing trace with hash 500673725, now seen corresponding path program 1 times [2019-09-10 08:04:52,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:52,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:52,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:52,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:52,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:52,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:53,041 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:04:53,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:53,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:04:53,042 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:53,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:04:53,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:04:53,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:04:53,043 INFO L87 Difference]: Start difference. First operand 403 states and 492 transitions. Second operand 17 states. [2019-09-10 08:04:53,658 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 08:04:53,820 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-10 08:04:53,981 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-09-10 08:04:55,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:55,502 INFO L93 Difference]: Finished difference Result 787 states and 1000 transitions. [2019-09-10 08:04:55,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:04:55,502 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 87 [2019-09-10 08:04:55,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:55,507 INFO L225 Difference]: With dead ends: 787 [2019-09-10 08:04:55,507 INFO L226 Difference]: Without dead ends: 787 [2019-09-10 08:04:55,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:04:55,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2019-09-10 08:04:55,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 378. [2019-09-10 08:04:55,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-09-10 08:04:55,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 459 transitions. [2019-09-10 08:04:55,514 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 459 transitions. Word has length 87 [2019-09-10 08:04:55,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:55,515 INFO L475 AbstractCegarLoop]: Abstraction has 378 states and 459 transitions. [2019-09-10 08:04:55,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:04:55,515 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 459 transitions. [2019-09-10 08:04:55,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:04:55,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:55,516 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:55,517 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:55,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:55,517 INFO L82 PathProgramCache]: Analyzing trace with hash -2120669208, now seen corresponding path program 1 times [2019-09-10 08:04:55,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:55,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:55,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:55,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:55,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:04:56,400 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:04:56,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:04:56,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:04:56,401 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:04:56,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:04:56,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:04:56,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:04:56,402 INFO L87 Difference]: Start difference. First operand 378 states and 459 transitions. Second operand 17 states. [2019-09-10 08:04:56,998 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 08:04:57,150 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-10 08:04:59,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:04:59,418 INFO L93 Difference]: Finished difference Result 742 states and 932 transitions. [2019-09-10 08:04:59,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:04:59,419 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 87 [2019-09-10 08:04:59,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:04:59,422 INFO L225 Difference]: With dead ends: 742 [2019-09-10 08:04:59,422 INFO L226 Difference]: Without dead ends: 742 [2019-09-10 08:04:59,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:04:59,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2019-09-10 08:04:59,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 377. [2019-09-10 08:04:59,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-09-10 08:04:59,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 456 transitions. [2019-09-10 08:04:59,429 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 456 transitions. Word has length 87 [2019-09-10 08:04:59,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:04:59,430 INFO L475 AbstractCegarLoop]: Abstraction has 377 states and 456 transitions. [2019-09-10 08:04:59,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:04:59,430 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 456 transitions. [2019-09-10 08:04:59,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:04:59,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:04:59,431 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:04:59,431 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:04:59,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:04:59,432 INFO L82 PathProgramCache]: Analyzing trace with hash 607545151, now seen corresponding path program 1 times [2019-09-10 08:04:59,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:04:59,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:59,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:04:59,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:04:59,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:04:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:00,305 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 08:05:01,081 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:05:01,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:01,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 08:05:01,082 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:01,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 08:05:01,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 08:05:01,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:05:01,082 INFO L87 Difference]: Start difference. First operand 377 states and 456 transitions. Second operand 25 states. [2019-09-10 08:05:01,261 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 40 [2019-09-10 08:05:02,194 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-09-10 08:05:02,505 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 58 [2019-09-10 08:05:02,806 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 66 [2019-09-10 08:05:03,190 WARN L188 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 74 [2019-09-10 08:05:03,423 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-09-10 08:05:03,644 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-09-10 08:05:03,849 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-09-10 08:05:04,061 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-09-10 08:05:04,284 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-09-10 08:05:04,544 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-10 08:05:08,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:08,787 INFO L93 Difference]: Finished difference Result 756 states and 936 transitions. [2019-09-10 08:05:08,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:05:08,788 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 87 [2019-09-10 08:05:08,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:08,792 INFO L225 Difference]: With dead ends: 756 [2019-09-10 08:05:08,792 INFO L226 Difference]: Without dead ends: 756 [2019-09-10 08:05:08,793 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=415, Invalid=1391, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 08:05:08,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2019-09-10 08:05:08,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 388. [2019-09-10 08:05:08,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-09-10 08:05:08,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 468 transitions. [2019-09-10 08:05:08,800 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 468 transitions. Word has length 87 [2019-09-10 08:05:08,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:08,800 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 468 transitions. [2019-09-10 08:05:08,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 08:05:08,800 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 468 transitions. [2019-09-10 08:05:08,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:05:08,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:08,802 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:08,802 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:08,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:08,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1697656993, now seen corresponding path program 1 times [2019-09-10 08:05:08,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:08,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:08,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:08,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:08,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:09,451 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:05:09,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:09,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 08:05:09,452 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:09,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 08:05:09,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 08:05:09,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:05:09,453 INFO L87 Difference]: Start difference. First operand 388 states and 468 transitions. Second operand 15 states. [2019-09-10 08:05:09,979 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2019-09-10 08:05:11,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:11,511 INFO L93 Difference]: Finished difference Result 708 states and 897 transitions. [2019-09-10 08:05:11,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:05:11,512 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 87 [2019-09-10 08:05:11,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:11,516 INFO L225 Difference]: With dead ends: 708 [2019-09-10 08:05:11,516 INFO L226 Difference]: Without dead ends: 708 [2019-09-10 08:05:11,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:05:11,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2019-09-10 08:05:11,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 347. [2019-09-10 08:05:11,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-09-10 08:05:11,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 419 transitions. [2019-09-10 08:05:11,522 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 419 transitions. Word has length 87 [2019-09-10 08:05:11,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:11,522 INFO L475 AbstractCegarLoop]: Abstraction has 347 states and 419 transitions. [2019-09-10 08:05:11,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 08:05:11,522 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 419 transitions. [2019-09-10 08:05:11,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:05:11,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:11,523 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:11,524 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:11,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:11,524 INFO L82 PathProgramCache]: Analyzing trace with hash 2061124639, now seen corresponding path program 1 times [2019-09-10 08:05:11,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:11,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:11,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:11,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:11,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:12,345 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:05:12,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:12,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:05:12,346 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:12,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:05:12,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:05:12,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:05:12,347 INFO L87 Difference]: Start difference. First operand 347 states and 419 transitions. Second operand 17 states. [2019-09-10 08:05:12,991 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:05:13,136 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-10 08:05:13,577 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2019-09-10 08:05:14,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:14,777 INFO L93 Difference]: Finished difference Result 672 states and 849 transitions. [2019-09-10 08:05:14,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:05:14,778 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 87 [2019-09-10 08:05:14,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:14,780 INFO L225 Difference]: With dead ends: 672 [2019-09-10 08:05:14,781 INFO L226 Difference]: Without dead ends: 672 [2019-09-10 08:05:14,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:05:14,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-09-10 08:05:14,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 336. [2019-09-10 08:05:14,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-09-10 08:05:14,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 404 transitions. [2019-09-10 08:05:14,786 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 404 transitions. Word has length 87 [2019-09-10 08:05:14,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:14,787 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 404 transitions. [2019-09-10 08:05:14,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:05:14,787 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 404 transitions. [2019-09-10 08:05:14,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:05:14,788 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:14,788 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:14,788 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:14,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:14,789 INFO L82 PathProgramCache]: Analyzing trace with hash 555238255, now seen corresponding path program 1 times [2019-09-10 08:05:14,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:14,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:14,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:14,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:14,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:15,856 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 08:05:15,995 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 08:05:16,876 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:05:16,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:16,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 08:05:16,876 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:16,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 08:05:16,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 08:05:16,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:05:16,877 INFO L87 Difference]: Start difference. First operand 336 states and 404 transitions. Second operand 26 states. [2019-09-10 08:05:17,066 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 40 [2019-09-10 08:05:17,748 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2019-09-10 08:05:17,891 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2019-09-10 08:05:18,221 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-09-10 08:05:18,467 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:05:18,781 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2019-09-10 08:05:19,247 WARN L188 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 92 [2019-09-10 08:05:19,505 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-10 08:05:19,760 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-10 08:05:20,062 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-09-10 08:05:23,198 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-09-10 08:05:24,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:24,221 INFO L93 Difference]: Finished difference Result 634 states and 767 transitions. [2019-09-10 08:05:24,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:05:24,222 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 87 [2019-09-10 08:05:24,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:24,225 INFO L225 Difference]: With dead ends: 634 [2019-09-10 08:05:24,225 INFO L226 Difference]: Without dead ends: 634 [2019-09-10 08:05:24,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=354, Invalid=1368, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 08:05:24,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-09-10 08:05:24,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 356. [2019-09-10 08:05:24,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-09-10 08:05:24,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 431 transitions. [2019-09-10 08:05:24,231 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 431 transitions. Word has length 87 [2019-09-10 08:05:24,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:24,231 INFO L475 AbstractCegarLoop]: Abstraction has 356 states and 431 transitions. [2019-09-10 08:05:24,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 08:05:24,231 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 431 transitions. [2019-09-10 08:05:24,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:05:24,232 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:24,233 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:24,233 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:24,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:24,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1881074051, now seen corresponding path program 1 times [2019-09-10 08:05:24,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:24,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:24,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:24,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:24,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:25,102 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:05:25,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:25,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:05:25,103 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:25,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:05:25,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:05:25,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:05:25,104 INFO L87 Difference]: Start difference. First operand 356 states and 431 transitions. Second operand 16 states. [2019-09-10 08:05:25,801 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 08:05:25,942 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-09-10 08:05:26,070 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-09-10 08:05:26,200 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-09-10 08:05:27,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:27,644 INFO L93 Difference]: Finished difference Result 621 states and 743 transitions. [2019-09-10 08:05:27,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:05:27,645 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 87 [2019-09-10 08:05:27,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:27,648 INFO L225 Difference]: With dead ends: 621 [2019-09-10 08:05:27,648 INFO L226 Difference]: Without dead ends: 621 [2019-09-10 08:05:27,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:05:27,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-09-10 08:05:27,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 373. [2019-09-10 08:05:27,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-09-10 08:05:27,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 455 transitions. [2019-09-10 08:05:27,655 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 455 transitions. Word has length 87 [2019-09-10 08:05:27,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:27,655 INFO L475 AbstractCegarLoop]: Abstraction has 373 states and 455 transitions. [2019-09-10 08:05:27,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:05:27,655 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 455 transitions. [2019-09-10 08:05:27,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:05:27,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:27,657 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:27,657 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:27,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:27,657 INFO L82 PathProgramCache]: Analyzing trace with hash -525959545, now seen corresponding path program 1 times [2019-09-10 08:05:27,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:27,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:27,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:27,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:27,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:28,477 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:05:28,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:28,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:05:28,478 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:28,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:05:28,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:05:28,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:05:28,479 INFO L87 Difference]: Start difference. First operand 373 states and 455 transitions. Second operand 17 states. [2019-09-10 08:05:29,130 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 08:05:29,295 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-10 08:05:30,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:30,802 INFO L93 Difference]: Finished difference Result 635 states and 809 transitions. [2019-09-10 08:05:30,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:05:30,802 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 87 [2019-09-10 08:05:30,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:30,806 INFO L225 Difference]: With dead ends: 635 [2019-09-10 08:05:30,806 INFO L226 Difference]: Without dead ends: 635 [2019-09-10 08:05:30,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:05:30,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-09-10 08:05:30,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 349. [2019-09-10 08:05:30,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-09-10 08:05:30,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 422 transitions. [2019-09-10 08:05:30,813 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 422 transitions. Word has length 87 [2019-09-10 08:05:30,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:30,813 INFO L475 AbstractCegarLoop]: Abstraction has 349 states and 422 transitions. [2019-09-10 08:05:30,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:05:30,813 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 422 transitions. [2019-09-10 08:05:30,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 08:05:30,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:30,815 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:30,815 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:30,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:30,815 INFO L82 PathProgramCache]: Analyzing trace with hash -285902363, now seen corresponding path program 1 times [2019-09-10 08:05:30,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:30,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:30,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:30,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:30,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:31,557 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:05:31,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:31,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 08:05:31,558 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:31,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 08:05:31,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 08:05:31,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:05:31,558 INFO L87 Difference]: Start difference. First operand 349 states and 422 transitions. Second operand 15 states. [2019-09-10 08:05:31,763 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2019-09-10 08:05:31,987 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-09-10 08:05:32,138 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-10 08:05:32,382 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-10 08:05:32,689 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 08:05:32,913 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2019-09-10 08:05:33,169 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 44 [2019-09-10 08:05:33,409 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 44 [2019-09-10 08:05:33,978 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 39 [2019-09-10 08:05:34,502 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2019-09-10 08:05:36,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:36,292 INFO L93 Difference]: Finished difference Result 1257 states and 1679 transitions. [2019-09-10 08:05:36,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:05:36,292 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 88 [2019-09-10 08:05:36,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:36,297 INFO L225 Difference]: With dead ends: 1257 [2019-09-10 08:05:36,297 INFO L226 Difference]: Without dead ends: 1257 [2019-09-10 08:05:36,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=234, Invalid=758, Unknown=0, NotChecked=0, Total=992 [2019-09-10 08:05:36,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2019-09-10 08:05:36,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 318. [2019-09-10 08:05:36,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-09-10 08:05:36,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 382 transitions. [2019-09-10 08:05:36,306 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 382 transitions. Word has length 88 [2019-09-10 08:05:36,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:36,307 INFO L475 AbstractCegarLoop]: Abstraction has 318 states and 382 transitions. [2019-09-10 08:05:36,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 08:05:36,307 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 382 transitions. [2019-09-10 08:05:36,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 08:05:36,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:36,308 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:36,308 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:36,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:36,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1241895498, now seen corresponding path program 1 times [2019-09-10 08:05:36,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:36,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:36,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:36,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:36,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:36,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:36,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:36,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:05:36,753 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:36,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:05:36,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:05:36,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:05:36,754 INFO L87 Difference]: Start difference. First operand 318 states and 382 transitions. Second operand 12 states. [2019-09-10 08:05:38,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:38,007 INFO L93 Difference]: Finished difference Result 465 states and 564 transitions. [2019-09-10 08:05:38,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:05:38,007 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 88 [2019-09-10 08:05:38,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:38,010 INFO L225 Difference]: With dead ends: 465 [2019-09-10 08:05:38,010 INFO L226 Difference]: Without dead ends: 465 [2019-09-10 08:05:38,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:05:38,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-09-10 08:05:38,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 314. [2019-09-10 08:05:38,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-09-10 08:05:38,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 377 transitions. [2019-09-10 08:05:38,017 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 377 transitions. Word has length 88 [2019-09-10 08:05:38,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:38,017 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 377 transitions. [2019-09-10 08:05:38,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:05:38,017 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 377 transitions. [2019-09-10 08:05:38,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 08:05:38,018 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:38,018 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:38,019 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:38,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:38,019 INFO L82 PathProgramCache]: Analyzing trace with hash 747869654, now seen corresponding path program 1 times [2019-09-10 08:05:38,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:38,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:38,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:38,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:38,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:38,963 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:05:38,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:38,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:05:38,964 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:38,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:05:38,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:05:38,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:05:38,965 INFO L87 Difference]: Start difference. First operand 314 states and 377 transitions. Second operand 16 states. [2019-09-10 08:05:39,760 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-10 08:05:39,897 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-10 08:05:40,068 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-10 08:05:40,254 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-10 08:05:41,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:41,941 INFO L93 Difference]: Finished difference Result 965 states and 1280 transitions. [2019-09-10 08:05:41,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:05:41,942 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 88 [2019-09-10 08:05:41,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:41,944 INFO L225 Difference]: With dead ends: 965 [2019-09-10 08:05:41,944 INFO L226 Difference]: Without dead ends: 965 [2019-09-10 08:05:41,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=185, Invalid=627, Unknown=0, NotChecked=0, Total=812 [2019-09-10 08:05:41,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2019-09-10 08:05:41,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 290. [2019-09-10 08:05:41,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-09-10 08:05:41,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 346 transitions. [2019-09-10 08:05:41,952 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 346 transitions. Word has length 88 [2019-09-10 08:05:41,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:41,952 INFO L475 AbstractCegarLoop]: Abstraction has 290 states and 346 transitions. [2019-09-10 08:05:41,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:05:41,953 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 346 transitions. [2019-09-10 08:05:41,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 08:05:41,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:41,954 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:41,954 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:41,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:41,954 INFO L82 PathProgramCache]: Analyzing trace with hash -493449678, now seen corresponding path program 1 times [2019-09-10 08:05:41,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:41,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:41,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:41,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:41,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:42,345 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:05:42,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:42,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:05:42,346 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:42,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:05:42,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:05:42,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:05:42,347 INFO L87 Difference]: Start difference. First operand 290 states and 346 transitions. Second operand 12 states. [2019-09-10 08:05:43,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:43,507 INFO L93 Difference]: Finished difference Result 674 states and 890 transitions. [2019-09-10 08:05:43,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:05:43,507 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 88 [2019-09-10 08:05:43,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:43,509 INFO L225 Difference]: With dead ends: 674 [2019-09-10 08:05:43,509 INFO L226 Difference]: Without dead ends: 674 [2019-09-10 08:05:43,509 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:05:43,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2019-09-10 08:05:43,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 268. [2019-09-10 08:05:43,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-10 08:05:43,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 321 transitions. [2019-09-10 08:05:43,516 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 321 transitions. Word has length 88 [2019-09-10 08:05:43,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:43,516 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 321 transitions. [2019-09-10 08:05:43,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:05:43,516 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 321 transitions. [2019-09-10 08:05:43,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 08:05:43,517 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:43,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] [2019-09-10 08:05:43,517 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:43,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:43,518 INFO L82 PathProgramCache]: Analyzing trace with hash 479313184, now seen corresponding path program 1 times [2019-09-10 08:05:43,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:43,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:43,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:43,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:43,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:43,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:43,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:43,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:05:43,658 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:43,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:05:43,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:05:43,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:05:43,659 INFO L87 Difference]: Start difference. First operand 268 states and 321 transitions. Second operand 9 states. [2019-09-10 08:05:44,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:44,919 INFO L93 Difference]: Finished difference Result 522 states and 670 transitions. [2019-09-10 08:05:44,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:05:44,919 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-10 08:05:44,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:44,921 INFO L225 Difference]: With dead ends: 522 [2019-09-10 08:05:44,921 INFO L226 Difference]: Without dead ends: 522 [2019-09-10 08:05:44,922 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:05:44,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-09-10 08:05:44,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 268. [2019-09-10 08:05:44,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-10 08:05:44,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 320 transitions. [2019-09-10 08:05:44,927 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 320 transitions. Word has length 88 [2019-09-10 08:05:44,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:44,928 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 320 transitions. [2019-09-10 08:05:44,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:05:44,928 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 320 transitions. [2019-09-10 08:05:44,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 08:05:44,929 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:44,929 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:44,929 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:44,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:44,929 INFO L82 PathProgramCache]: Analyzing trace with hash -134912059, now seen corresponding path program 1 times [2019-09-10 08:05:44,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:44,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:44,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:44,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:44,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:44,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:45,344 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2019-09-10 08:05:45,487 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 15 [2019-09-10 08:05:45,633 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 15 [2019-09-10 08:05:45,879 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:05:45,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:45,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:05:45,880 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:45,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:05:45,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:05:45,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:05:45,881 INFO L87 Difference]: Start difference. First operand 268 states and 320 transitions. Second operand 16 states. [2019-09-10 08:05:46,528 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-09-10 08:05:46,955 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-10 08:05:47,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:47,730 INFO L93 Difference]: Finished difference Result 407 states and 496 transitions. [2019-09-10 08:05:47,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 08:05:47,731 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 88 [2019-09-10 08:05:47,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:47,732 INFO L225 Difference]: With dead ends: 407 [2019-09-10 08:05:47,732 INFO L226 Difference]: Without dead ends: 407 [2019-09-10 08:05:47,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:05:47,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-09-10 08:05:47,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 257. [2019-09-10 08:05:47,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-10 08:05:47,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 306 transitions. [2019-09-10 08:05:47,735 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 306 transitions. Word has length 88 [2019-09-10 08:05:47,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:47,735 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 306 transitions. [2019-09-10 08:05:47,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:05:47,736 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 306 transitions. [2019-09-10 08:05:47,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 08:05:47,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:47,736 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:47,737 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:47,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:47,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1795581947, now seen corresponding path program 1 times [2019-09-10 08:05:47,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:47,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:47,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:47,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:47,738 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:48,222 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:05:48,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:48,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:05:48,222 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:48,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:05:48,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:05:48,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:05:48,223 INFO L87 Difference]: Start difference. First operand 257 states and 306 transitions. Second operand 12 states. [2019-09-10 08:05:49,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:49,145 INFO L93 Difference]: Finished difference Result 631 states and 835 transitions. [2019-09-10 08:05:49,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:05:49,146 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 89 [2019-09-10 08:05:49,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:49,147 INFO L225 Difference]: With dead ends: 631 [2019-09-10 08:05:49,147 INFO L226 Difference]: Without dead ends: 631 [2019-09-10 08:05:49,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:05:49,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-09-10 08:05:49,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 207. [2019-09-10 08:05:49,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-09-10 08:05:49,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 248 transitions. [2019-09-10 08:05:49,151 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 248 transitions. Word has length 89 [2019-09-10 08:05:49,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:49,152 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 248 transitions. [2019-09-10 08:05:49,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:05:49,152 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 248 transitions. [2019-09-10 08:05:49,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 08:05:49,152 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:49,152 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:49,153 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:49,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:49,153 INFO L82 PathProgramCache]: Analyzing trace with hash -842661870, now seen corresponding path program 1 times [2019-09-10 08:05:49,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:49,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:49,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:49,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:49,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:49,615 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:05:49,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:49,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 08:05:49,616 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:49,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 08:05:49,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 08:05:49,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:05:49,616 INFO L87 Difference]: Start difference. First operand 207 states and 248 transitions. Second operand 11 states. [2019-09-10 08:05:50,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:50,791 INFO L93 Difference]: Finished difference Result 673 states and 924 transitions. [2019-09-10 08:05:50,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:05:50,792 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 89 [2019-09-10 08:05:50,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:50,794 INFO L225 Difference]: With dead ends: 673 [2019-09-10 08:05:50,794 INFO L226 Difference]: Without dead ends: 673 [2019-09-10 08:05:50,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=158, Invalid=394, Unknown=0, NotChecked=0, Total=552 [2019-09-10 08:05:50,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-09-10 08:05:50,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 167. [2019-09-10 08:05:50,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-10 08:05:50,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 203 transitions. [2019-09-10 08:05:50,800 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 203 transitions. Word has length 89 [2019-09-10 08:05:50,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:50,800 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 203 transitions. [2019-09-10 08:05:50,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 08:05:50,801 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 203 transitions. [2019-09-10 08:05:50,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 08:05:50,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:50,801 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:05:50,802 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:50,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:50,802 INFO L82 PathProgramCache]: Analyzing trace with hash 576556054, now seen corresponding path program 1 times [2019-09-10 08:05:50,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:50,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:50,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:50,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:50,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:51,307 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:05:51,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:51,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:05:51,308 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:51,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:05:51,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:05:51,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:05:51,309 INFO L87 Difference]: Start difference. First operand 167 states and 203 transitions. Second operand 13 states. [2019-09-10 08:05:52,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:52,763 INFO L93 Difference]: Finished difference Result 519 states and 707 transitions. [2019-09-10 08:05:52,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:05:52,764 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2019-09-10 08:05:52,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:52,765 INFO L225 Difference]: With dead ends: 519 [2019-09-10 08:05:52,765 INFO L226 Difference]: Without dead ends: 519 [2019-09-10 08:05:52,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2019-09-10 08:05:52,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2019-09-10 08:05:52,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 161. [2019-09-10 08:05:52,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-09-10 08:05:52,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 197 transitions. [2019-09-10 08:05:52,770 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 197 transitions. Word has length 90 [2019-09-10 08:05:52,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:52,771 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 197 transitions. [2019-09-10 08:05:52,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:05:52,771 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 197 transitions. [2019-09-10 08:05:52,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:05:52,772 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:52,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:52,772 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:52,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:52,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1222425115, now seen corresponding path program 1 times [2019-09-10 08:05:52,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:52,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:52,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:52,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:52,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:52,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:52,852 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:05:52,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:52,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:05:52,852 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:52,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:05:52,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:05:52,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:05:52,853 INFO L87 Difference]: Start difference. First operand 161 states and 197 transitions. Second operand 3 states. [2019-09-10 08:05:52,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:52,885 INFO L93 Difference]: Finished difference Result 222 states and 283 transitions. [2019-09-10 08:05:52,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:05:52,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-10 08:05:52,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:52,887 INFO L225 Difference]: With dead ends: 222 [2019-09-10 08:05:52,887 INFO L226 Difference]: Without dead ends: 222 [2019-09-10 08:05:52,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:05:52,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-09-10 08:05:52,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2019-09-10 08:05:52,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-09-10 08:05:52,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 282 transitions. [2019-09-10 08:05:52,892 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 282 transitions. Word has length 118 [2019-09-10 08:05:52,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:52,893 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 282 transitions. [2019-09-10 08:05:52,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:05:52,893 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 282 transitions. [2019-09-10 08:05:52,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:05:52,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:52,894 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:52,894 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:52,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:52,895 INFO L82 PathProgramCache]: Analyzing trace with hash -547792204, now seen corresponding path program 1 times [2019-09-10 08:05:52,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:52,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:52,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:52,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:52,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:53,012 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:05:53,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:53,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:05:53,013 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:53,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:05:53,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:05:53,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:05:53,014 INFO L87 Difference]: Start difference. First operand 220 states and 282 transitions. Second operand 7 states. [2019-09-10 08:05:53,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:53,476 INFO L93 Difference]: Finished difference Result 484 states and 650 transitions. [2019-09-10 08:05:53,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:05:53,476 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2019-09-10 08:05:53,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:53,477 INFO L225 Difference]: With dead ends: 484 [2019-09-10 08:05:53,477 INFO L226 Difference]: Without dead ends: 484 [2019-09-10 08:05:53,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:05:53,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2019-09-10 08:05:53,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 252. [2019-09-10 08:05:53,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-09-10 08:05:53,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 325 transitions. [2019-09-10 08:05:53,486 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 325 transitions. Word has length 120 [2019-09-10 08:05:53,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:53,487 INFO L475 AbstractCegarLoop]: Abstraction has 252 states and 325 transitions. [2019-09-10 08:05:53,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:05:53,487 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 325 transitions. [2019-09-10 08:05:53,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:05:53,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:53,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:53,490 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:53,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:53,491 INFO L82 PathProgramCache]: Analyzing trace with hash 479664936, now seen corresponding path program 1 times [2019-09-10 08:05:53,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:53,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:53,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:53,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:53,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:53,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:53,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:53,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:53,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:05:53,597 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:53,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:05:53,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:05:53,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:05:53,597 INFO L87 Difference]: Start difference. First operand 252 states and 325 transitions. Second operand 7 states. [2019-09-10 08:05:54,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:54,125 INFO L93 Difference]: Finished difference Result 824 states and 1130 transitions. [2019-09-10 08:05:54,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:05:54,126 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2019-09-10 08:05:54,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:54,128 INFO L225 Difference]: With dead ends: 824 [2019-09-10 08:05:54,128 INFO L226 Difference]: Without dead ends: 824 [2019-09-10 08:05:54,129 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:05:54,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2019-09-10 08:05:54,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 426. [2019-09-10 08:05:54,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-10 08:05:54,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 575 transitions. [2019-09-10 08:05:54,138 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 575 transitions. Word has length 120 [2019-09-10 08:05:54,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:54,138 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 575 transitions. [2019-09-10 08:05:54,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:05:54,138 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 575 transitions. [2019-09-10 08:05:54,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:05:54,139 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:54,139 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:54,140 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:54,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:54,140 INFO L82 PathProgramCache]: Analyzing trace with hash -2044549086, now seen corresponding path program 1 times [2019-09-10 08:05:54,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:54,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:54,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:54,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:54,141 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:54,283 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:05:54,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:54,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:05:54,284 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:54,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:05:54,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:05:54,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:05:54,285 INFO L87 Difference]: Start difference. First operand 426 states and 575 transitions. Second operand 7 states. [2019-09-10 08:05:54,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:54,793 INFO L93 Difference]: Finished difference Result 1544 states and 2146 transitions. [2019-09-10 08:05:54,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:05:54,794 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2019-09-10 08:05:54,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:54,797 INFO L225 Difference]: With dead ends: 1544 [2019-09-10 08:05:54,797 INFO L226 Difference]: Without dead ends: 1544 [2019-09-10 08:05:54,798 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:05:54,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2019-09-10 08:05:54,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 794. [2019-09-10 08:05:54,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2019-09-10 08:05:54,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1103 transitions. [2019-09-10 08:05:54,813 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1103 transitions. Word has length 120 [2019-09-10 08:05:54,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:54,813 INFO L475 AbstractCegarLoop]: Abstraction has 794 states and 1103 transitions. [2019-09-10 08:05:54,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:05:54,814 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1103 transitions. [2019-09-10 08:05:54,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:05:54,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:54,815 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:54,815 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:54,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:54,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1636775367, now seen corresponding path program 1 times [2019-09-10 08:05:54,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:54,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:54,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:54,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:54,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:54,903 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:05:54,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:54,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:05:54,904 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:54,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:05:54,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:05:54,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:05:54,905 INFO L87 Difference]: Start difference. First operand 794 states and 1103 transitions. Second operand 3 states. [2019-09-10 08:05:54,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:54,944 INFO L93 Difference]: Finished difference Result 1160 states and 1616 transitions. [2019-09-10 08:05:54,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:05:54,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-10 08:05:54,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:54,947 INFO L225 Difference]: With dead ends: 1160 [2019-09-10 08:05:54,947 INFO L226 Difference]: Without dead ends: 1160 [2019-09-10 08:05:54,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:05:54,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2019-09-10 08:05:54,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1158. [2019-09-10 08:05:54,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1158 states. [2019-09-10 08:05:54,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1615 transitions. [2019-09-10 08:05:54,963 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1615 transitions. Word has length 120 [2019-09-10 08:05:54,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:54,963 INFO L475 AbstractCegarLoop]: Abstraction has 1158 states and 1615 transitions. [2019-09-10 08:05:54,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:05:54,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1615 transitions. [2019-09-10 08:05:54,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:05:54,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:54,964 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:54,965 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:54,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:54,965 INFO L82 PathProgramCache]: Analyzing trace with hash 897035046, now seen corresponding path program 1 times [2019-09-10 08:05:54,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:54,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:54,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:54,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:54,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:54,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:55,026 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:05:55,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:55,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:05:55,027 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:55,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:05:55,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:05:55,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:05:55,028 INFO L87 Difference]: Start difference. First operand 1158 states and 1615 transitions. Second operand 3 states. [2019-09-10 08:05:55,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:55,057 INFO L93 Difference]: Finished difference Result 2096 states and 2900 transitions. [2019-09-10 08:05:55,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:05:55,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-10 08:05:55,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:55,062 INFO L225 Difference]: With dead ends: 2096 [2019-09-10 08:05:55,062 INFO L226 Difference]: Without dead ends: 2096 [2019-09-10 08:05:55,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:05:55,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2096 states. [2019-09-10 08:05:55,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2096 to 2094. [2019-09-10 08:05:55,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2094 states. [2019-09-10 08:05:55,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 2899 transitions. [2019-09-10 08:05:55,103 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 2899 transitions. Word has length 120 [2019-09-10 08:05:55,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:55,103 INFO L475 AbstractCegarLoop]: Abstraction has 2094 states and 2899 transitions. [2019-09-10 08:05:55,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:05:55,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 2899 transitions. [2019-09-10 08:05:55,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:05:55,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:55,105 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:55,105 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:55,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:55,105 INFO L82 PathProgramCache]: Analyzing trace with hash 268696988, now seen corresponding path program 1 times [2019-09-10 08:05:55,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:55,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:55,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:55,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:55,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:55,221 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:05:55,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:55,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:05:55,222 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:55,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:05:55,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:05:55,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:05:55,222 INFO L87 Difference]: Start difference. First operand 2094 states and 2899 transitions. Second operand 7 states. [2019-09-10 08:05:55,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:55,699 INFO L93 Difference]: Finished difference Result 7592 states and 10474 transitions. [2019-09-10 08:05:55,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:05:55,699 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2019-09-10 08:05:55,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:55,712 INFO L225 Difference]: With dead ends: 7592 [2019-09-10 08:05:55,713 INFO L226 Difference]: Without dead ends: 7592 [2019-09-10 08:05:55,713 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:05:55,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7592 states. [2019-09-10 08:05:55,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7592 to 4330. [2019-09-10 08:05:55,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4330 states. [2019-09-10 08:05:55,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4330 states to 4330 states and 6031 transitions. [2019-09-10 08:05:55,787 INFO L78 Accepts]: Start accepts. Automaton has 4330 states and 6031 transitions. Word has length 120 [2019-09-10 08:05:55,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:55,788 INFO L475 AbstractCegarLoop]: Abstraction has 4330 states and 6031 transitions. [2019-09-10 08:05:55,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:05:55,788 INFO L276 IsEmpty]: Start isEmpty. Operand 4330 states and 6031 transitions. [2019-09-10 08:05:55,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:05:55,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:55,789 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:55,790 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:55,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:55,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1180739922, now seen corresponding path program 1 times [2019-09-10 08:05:55,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:55,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:55,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:55,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:55,791 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:55,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:55,908 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:05:55,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:55,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:05:55,909 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:55,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:05:55,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:05:55,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:05:55,910 INFO L87 Difference]: Start difference. First operand 4330 states and 6031 transitions. Second operand 7 states. [2019-09-10 08:05:56,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:56,472 INFO L93 Difference]: Finished difference Result 12288 states and 17077 transitions. [2019-09-10 08:05:56,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:05:56,472 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2019-09-10 08:05:56,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:56,489 INFO L225 Difference]: With dead ends: 12288 [2019-09-10 08:05:56,490 INFO L226 Difference]: Without dead ends: 12288 [2019-09-10 08:05:56,490 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:05:56,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12288 states. [2019-09-10 08:05:56,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12288 to 7194. [2019-09-10 08:05:56,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7194 states. [2019-09-10 08:05:56,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7194 states to 7194 states and 10039 transitions. [2019-09-10 08:05:56,606 INFO L78 Accepts]: Start accepts. Automaton has 7194 states and 10039 transitions. Word has length 120 [2019-09-10 08:05:56,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:56,606 INFO L475 AbstractCegarLoop]: Abstraction has 7194 states and 10039 transitions. [2019-09-10 08:05:56,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:05:56,606 INFO L276 IsEmpty]: Start isEmpty. Operand 7194 states and 10039 transitions. [2019-09-10 08:05:56,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:05:56,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:56,608 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:56,609 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:56,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:56,609 INFO L82 PathProgramCache]: Analyzing trace with hash -858738670, now seen corresponding path program 1 times [2019-09-10 08:05:56,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:56,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:56,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:56,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:56,612 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:56,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:56,756 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:05:56,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:56,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:05:56,757 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:56,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:05:56,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:05:56,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:05:56,759 INFO L87 Difference]: Start difference. First operand 7194 states and 10039 transitions. Second operand 6 states. [2019-09-10 08:05:56,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:56,871 INFO L93 Difference]: Finished difference Result 11901 states and 16369 transitions. [2019-09-10 08:05:56,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:05:56,871 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2019-09-10 08:05:56,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:56,883 INFO L225 Difference]: With dead ends: 11901 [2019-09-10 08:05:56,883 INFO L226 Difference]: Without dead ends: 11901 [2019-09-10 08:05:56,883 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:05:56,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11901 states. [2019-09-10 08:05:57,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11901 to 7290. [2019-09-10 08:05:57,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7290 states. [2019-09-10 08:05:57,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7290 states to 7290 states and 10103 transitions. [2019-09-10 08:05:57,026 INFO L78 Accepts]: Start accepts. Automaton has 7290 states and 10103 transitions. Word has length 121 [2019-09-10 08:05:57,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:57,026 INFO L475 AbstractCegarLoop]: Abstraction has 7290 states and 10103 transitions. [2019-09-10 08:05:57,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:05:57,026 INFO L276 IsEmpty]: Start isEmpty. Operand 7290 states and 10103 transitions. [2019-09-10 08:05:57,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:05:57,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:57,028 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:57,029 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:57,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:57,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1840238826, now seen corresponding path program 1 times [2019-09-10 08:05:57,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:57,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:57,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:57,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:57,030 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:57,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:57,108 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:05:57,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:57,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:05:57,109 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:57,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:05:57,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:05:57,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:05:57,110 INFO L87 Difference]: Start difference. First operand 7290 states and 10103 transitions. Second operand 3 states. [2019-09-10 08:05:57,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:57,163 INFO L93 Difference]: Finished difference Result 11468 states and 15936 transitions. [2019-09-10 08:05:57,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:05:57,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-10 08:05:57,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:57,177 INFO L225 Difference]: With dead ends: 11468 [2019-09-10 08:05:57,178 INFO L226 Difference]: Without dead ends: 11468 [2019-09-10 08:05:57,179 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:05:57,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11468 states. [2019-09-10 08:05:57,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11468 to 8354. [2019-09-10 08:05:57,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8354 states. [2019-09-10 08:05:57,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8354 states to 8354 states and 11659 transitions. [2019-09-10 08:05:57,293 INFO L78 Accepts]: Start accepts. Automaton has 8354 states and 11659 transitions. Word has length 121 [2019-09-10 08:05:57,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:57,294 INFO L475 AbstractCegarLoop]: Abstraction has 8354 states and 11659 transitions. [2019-09-10 08:05:57,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:05:57,294 INFO L276 IsEmpty]: Start isEmpty. Operand 8354 states and 11659 transitions. [2019-09-10 08:05:57,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:05:57,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:57,295 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:57,295 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:57,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:57,295 INFO L82 PathProgramCache]: Analyzing trace with hash 570415585, now seen corresponding path program 1 times [2019-09-10 08:05:57,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:57,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:57,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:57,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:57,297 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:57,372 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:05:57,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:57,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:05:57,373 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:57,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:05:57,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:05:57,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:05:57,374 INFO L87 Difference]: Start difference. First operand 8354 states and 11659 transitions. Second operand 3 states. [2019-09-10 08:05:57,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:57,412 INFO L93 Difference]: Finished difference Result 7726 states and 10610 transitions. [2019-09-10 08:05:57,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:05:57,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-10 08:05:57,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:57,420 INFO L225 Difference]: With dead ends: 7726 [2019-09-10 08:05:57,421 INFO L226 Difference]: Without dead ends: 7726 [2019-09-10 08:05:57,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:05:57,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7726 states. [2019-09-10 08:05:57,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7726 to 6344. [2019-09-10 08:05:57,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6344 states. [2019-09-10 08:05:57,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6344 states to 6344 states and 8719 transitions. [2019-09-10 08:05:57,503 INFO L78 Accepts]: Start accepts. Automaton has 6344 states and 8719 transitions. Word has length 122 [2019-09-10 08:05:57,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:57,504 INFO L475 AbstractCegarLoop]: Abstraction has 6344 states and 8719 transitions. [2019-09-10 08:05:57,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:05:57,504 INFO L276 IsEmpty]: Start isEmpty. Operand 6344 states and 8719 transitions. [2019-09-10 08:05:57,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:05:57,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:57,505 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:57,505 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:57,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:57,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1157910835, now seen corresponding path program 1 times [2019-09-10 08:05:57,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:57,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:57,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:57,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:57,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:57,582 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:05:57,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:57,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:05:57,583 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:57,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:05:57,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:05:57,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:05:57,584 INFO L87 Difference]: Start difference. First operand 6344 states and 8719 transitions. Second operand 3 states. [2019-09-10 08:05:57,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:57,617 INFO L93 Difference]: Finished difference Result 7396 states and 10100 transitions. [2019-09-10 08:05:57,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:05:57,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-09-10 08:05:57,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:57,624 INFO L225 Difference]: With dead ends: 7396 [2019-09-10 08:05:57,624 INFO L226 Difference]: Without dead ends: 7396 [2019-09-10 08:05:57,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:05:57,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7396 states. [2019-09-10 08:05:57,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7396 to 7274. [2019-09-10 08:05:57,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7274 states. [2019-09-10 08:05:57,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7274 states to 7274 states and 9949 transitions. [2019-09-10 08:05:57,743 INFO L78 Accepts]: Start accepts. Automaton has 7274 states and 9949 transitions. Word has length 123 [2019-09-10 08:05:57,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:57,744 INFO L475 AbstractCegarLoop]: Abstraction has 7274 states and 9949 transitions. [2019-09-10 08:05:57,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:05:57,744 INFO L276 IsEmpty]: Start isEmpty. Operand 7274 states and 9949 transitions. [2019-09-10 08:05:57,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 08:05:57,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:57,744 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] [2019-09-10 08:05:57,745 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:57,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:57,745 INFO L82 PathProgramCache]: Analyzing trace with hash 520301820, now seen corresponding path program 1 times [2019-09-10 08:05:57,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:57,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:57,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:57,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:57,746 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:57,816 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:05:57,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:57,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:05:57,816 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:57,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:05:57,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:05:57,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:05:57,817 INFO L87 Difference]: Start difference. First operand 7274 states and 9949 transitions. Second operand 3 states. [2019-09-10 08:05:57,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:57,859 INFO L93 Difference]: Finished difference Result 8002 states and 10920 transitions. [2019-09-10 08:05:57,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:05:57,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-09-10 08:05:57,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:57,869 INFO L225 Difference]: With dead ends: 8002 [2019-09-10 08:05:57,869 INFO L226 Difference]: Without dead ends: 8002 [2019-09-10 08:05:57,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:05:57,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8002 states. [2019-09-10 08:05:57,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8002 to 8000. [2019-09-10 08:05:57,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8000 states. [2019-09-10 08:05:57,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8000 states to 8000 states and 10919 transitions. [2019-09-10 08:05:57,951 INFO L78 Accepts]: Start accepts. Automaton has 8000 states and 10919 transitions. Word has length 124 [2019-09-10 08:05:57,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:57,951 INFO L475 AbstractCegarLoop]: Abstraction has 8000 states and 10919 transitions. [2019-09-10 08:05:57,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:05:57,952 INFO L276 IsEmpty]: Start isEmpty. Operand 8000 states and 10919 transitions. [2019-09-10 08:05:57,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 08:05:57,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:57,956 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] [2019-09-10 08:05:57,956 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:57,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:57,956 INFO L82 PathProgramCache]: Analyzing trace with hash -551078870, now seen corresponding path program 1 times [2019-09-10 08:05:57,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:57,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:57,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:57,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:57,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:57,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:58,045 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:58,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:58,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:05:58,046 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:58,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:05:58,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:05:58,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:05:58,047 INFO L87 Difference]: Start difference. First operand 8000 states and 10919 transitions. Second operand 3 states. [2019-09-10 08:05:58,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:58,086 INFO L93 Difference]: Finished difference Result 9796 states and 13136 transitions. [2019-09-10 08:05:58,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:05:58,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-09-10 08:05:58,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:58,096 INFO L225 Difference]: With dead ends: 9796 [2019-09-10 08:05:58,096 INFO L226 Difference]: Without dead ends: 9796 [2019-09-10 08:05:58,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:05:58,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9796 states. [2019-09-10 08:05:58,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9796 to 7280. [2019-09-10 08:05:58,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7280 states. [2019-09-10 08:05:58,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7280 states to 7280 states and 9767 transitions. [2019-09-10 08:05:58,163 INFO L78 Accepts]: Start accepts. Automaton has 7280 states and 9767 transitions. Word has length 155 [2019-09-10 08:05:58,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:58,164 INFO L475 AbstractCegarLoop]: Abstraction has 7280 states and 9767 transitions. [2019-09-10 08:05:58,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:05:58,164 INFO L276 IsEmpty]: Start isEmpty. Operand 7280 states and 9767 transitions. [2019-09-10 08:05:58,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 08:05:58,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:58,166 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 08:05:58,166 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:58,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:58,166 INFO L82 PathProgramCache]: Analyzing trace with hash -430845502, now seen corresponding path program 1 times [2019-09-10 08:05:58,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:58,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:58,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:58,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:58,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:58,250 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:05:58,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:58,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:05:58,250 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:58,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:05:58,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:05:58,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:05:58,251 INFO L87 Difference]: Start difference. First operand 7280 states and 9767 transitions. Second operand 3 states. [2019-09-10 08:05:58,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:58,290 INFO L93 Difference]: Finished difference Result 8836 states and 11656 transitions. [2019-09-10 08:05:58,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:05:58,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-09-10 08:05:58,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:58,300 INFO L225 Difference]: With dead ends: 8836 [2019-09-10 08:05:58,300 INFO L226 Difference]: Without dead ends: 8836 [2019-09-10 08:05:58,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:05:58,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8836 states. [2019-09-10 08:05:58,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8836 to 8434. [2019-09-10 08:05:58,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8434 states. [2019-09-10 08:05:58,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8434 states to 8434 states and 11175 transitions. [2019-09-10 08:05:58,762 INFO L78 Accepts]: Start accepts. Automaton has 8434 states and 11175 transitions. Word has length 156 [2019-09-10 08:05:58,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:58,763 INFO L475 AbstractCegarLoop]: Abstraction has 8434 states and 11175 transitions. [2019-09-10 08:05:58,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:05:58,763 INFO L276 IsEmpty]: Start isEmpty. Operand 8434 states and 11175 transitions. [2019-09-10 08:05:58,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-10 08:05:58,765 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:58,765 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] [2019-09-10 08:05:58,765 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:58,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:58,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1504022855, now seen corresponding path program 1 times [2019-09-10 08:05:58,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:58,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:58,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:58,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:58,767 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:58,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:59,100 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:59,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:05:59,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:05:59,101 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 158 with the following transitions: [2019-09-10 08:05:59,103 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], [103], [106], [109], [113], [116], [119], [123], [126], [129], [133], [136], [139], [143], [146], [149], [152], [156], [159], [162], [166], [168], [171], [174], [177], [180], [182], [184], [187], [190], [193], [195], [197], [200], [203], [206], [208], [210], [213], [216], [219], [221], [223], [226], [236], [239], [243], [246], [249], [253], [255], [258], [261], [264], [269], [271], [274], [282], [284], [287], [295], [297], [300], [308], [310], [313], [321], [323], [325], [327], [330], [337], [339], [341], [344], [345], [347], [349], [358], [361], [365], [374], [376], [379], [382], [384], [399], [401], [404], [407], [409], [424], [426], [429], [432], [434], [449], [451], [454], [457], [459], [467], [470], [476], [479], [482], [484], [520], [2376], [2377], [2381], [2382], [2383] [2019-09-10 08:05:59,151 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:05:59,152 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:05:59,400 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:06:00,597 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:06:00,600 INFO L272 AbstractInterpreter]: Visited 146 different actions 820 times. Merged at 57 different actions 589 times. Widened at 24 different actions 101 times. Performed 3176 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3176 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 72 fixpoints after 17 different actions. Largest state had 285 variables. [2019-09-10 08:06:00,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:00,607 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:06:00,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:06:00,607 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:06:00,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:06:00,635 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:06:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:00,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 1638 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 08:06:00,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:06:01,232 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 08:06:01,232 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:06:01,418 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 08:06:01,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:06:01,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [12, 7] total 21 [2019-09-10 08:06:01,425 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:01,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:06:01,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:06:01,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:06:01,426 INFO L87 Difference]: Start difference. First operand 8434 states and 11175 transitions. Second operand 7 states. [2019-09-10 08:06:01,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:01,791 INFO L93 Difference]: Finished difference Result 41768 states and 55272 transitions. [2019-09-10 08:06:01,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:06:01,791 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 157 [2019-09-10 08:06:01,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:01,910 INFO L225 Difference]: With dead ends: 41768 [2019-09-10 08:06:01,910 INFO L226 Difference]: Without dead ends: 41768 [2019-09-10 08:06:01,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 305 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:06:01,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41768 states. [2019-09-10 08:06:02,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41768 to 13754. [2019-09-10 08:06:02,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13754 states. [2019-09-10 08:06:02,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13754 states to 13754 states and 18151 transitions. [2019-09-10 08:06:02,318 INFO L78 Accepts]: Start accepts. Automaton has 13754 states and 18151 transitions. Word has length 157 [2019-09-10 08:06:02,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:02,319 INFO L475 AbstractCegarLoop]: Abstraction has 13754 states and 18151 transitions. [2019-09-10 08:06:02,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:06:02,319 INFO L276 IsEmpty]: Start isEmpty. Operand 13754 states and 18151 transitions. [2019-09-10 08:06:02,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-10 08:06:02,323 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:02,324 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] [2019-09-10 08:06:02,324 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:02,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:02,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1763487301, now seen corresponding path program 1 times [2019-09-10 08:06:02,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:02,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:02,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:02,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:02,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:02,542 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 08:06:02,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:02,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:06:02,543 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:02,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:06:02,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:06:02,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:06:02,545 INFO L87 Difference]: Start difference. First operand 13754 states and 18151 transitions. Second operand 5 states. [2019-09-10 08:06:02,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:02,672 INFO L93 Difference]: Finished difference Result 19540 states and 25729 transitions. [2019-09-10 08:06:02,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:06:02,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-09-10 08:06:02,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:02,715 INFO L225 Difference]: With dead ends: 19540 [2019-09-10 08:06:02,715 INFO L226 Difference]: Without dead ends: 19540 [2019-09-10 08:06:02,715 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:06:02,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19540 states. [2019-09-10 08:06:02,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19540 to 16446. [2019-09-10 08:06:02,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16446 states. [2019-09-10 08:06:03,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16446 states to 16446 states and 21719 transitions. [2019-09-10 08:06:03,016 INFO L78 Accepts]: Start accepts. Automaton has 16446 states and 21719 transitions. Word has length 157 [2019-09-10 08:06:03,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:03,016 INFO L475 AbstractCegarLoop]: Abstraction has 16446 states and 21719 transitions. [2019-09-10 08:06:03,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:06:03,017 INFO L276 IsEmpty]: Start isEmpty. Operand 16446 states and 21719 transitions. [2019-09-10 08:06:03,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-10 08:06:03,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:03,021 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] [2019-09-10 08:06:03,021 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:03,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:03,022 INFO L82 PathProgramCache]: Analyzing trace with hash 7265973, now seen corresponding path program 1 times [2019-09-10 08:06:03,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:03,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:03,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:03,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:03,023 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:03,256 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 08:06:03,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:03,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:06:03,256 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:03,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:06:03,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:06:03,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:06:03,257 INFO L87 Difference]: Start difference. First operand 16446 states and 21719 transitions. Second operand 7 states. [2019-09-10 08:06:03,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:03,508 INFO L93 Difference]: Finished difference Result 55060 states and 72784 transitions. [2019-09-10 08:06:03,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:06:03,509 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 157 [2019-09-10 08:06:03,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:03,578 INFO L225 Difference]: With dead ends: 55060 [2019-09-10 08:06:03,578 INFO L226 Difference]: Without dead ends: 55060 [2019-09-10 08:06:03,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:06:03,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55060 states. [2019-09-10 08:06:04,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55060 to 24394. [2019-09-10 08:06:04,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24394 states. [2019-09-10 08:06:04,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24394 states to 24394 states and 32103 transitions. [2019-09-10 08:06:04,831 INFO L78 Accepts]: Start accepts. Automaton has 24394 states and 32103 transitions. Word has length 157 [2019-09-10 08:06:04,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:04,832 INFO L475 AbstractCegarLoop]: Abstraction has 24394 states and 32103 transitions. [2019-09-10 08:06:04,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:06:04,832 INFO L276 IsEmpty]: Start isEmpty. Operand 24394 states and 32103 transitions. [2019-09-10 08:06:04,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-10 08:06:04,836 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:04,836 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] [2019-09-10 08:06:04,836 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:04,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:04,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1974455249, now seen corresponding path program 1 times [2019-09-10 08:06:04,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:04,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:04,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:04,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:04,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:04,975 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 08:06:04,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:04,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:06:04,976 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:04,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:06:04,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:06:04,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:06:04,977 INFO L87 Difference]: Start difference. First operand 24394 states and 32103 transitions. Second operand 5 states. [2019-09-10 08:06:05,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:05,137 INFO L93 Difference]: Finished difference Result 29838 states and 39201 transitions. [2019-09-10 08:06:05,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:06:05,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-09-10 08:06:05,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:05,175 INFO L225 Difference]: With dead ends: 29838 [2019-09-10 08:06:05,175 INFO L226 Difference]: Without dead ends: 29838 [2019-09-10 08:06:05,176 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:06:05,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29838 states. [2019-09-10 08:06:05,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29838 to 27086. [2019-09-10 08:06:05,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27086 states. [2019-09-10 08:06:05,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27086 states to 27086 states and 35671 transitions. [2019-09-10 08:06:05,617 INFO L78 Accepts]: Start accepts. Automaton has 27086 states and 35671 transitions. Word has length 157 [2019-09-10 08:06:05,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:05,617 INFO L475 AbstractCegarLoop]: Abstraction has 27086 states and 35671 transitions. [2019-09-10 08:06:05,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:06:05,618 INFO L276 IsEmpty]: Start isEmpty. Operand 27086 states and 35671 transitions. [2019-09-10 08:06:05,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-10 08:06:05,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:05,624 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] [2019-09-10 08:06:05,625 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:05,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:05,625 INFO L82 PathProgramCache]: Analyzing trace with hash 871075137, now seen corresponding path program 1 times [2019-09-10 08:06:05,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:05,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:05,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:05,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:05,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:05,875 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 08:06:05,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:05,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:06:05,876 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:05,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:06:05,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:06:05,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:06:05,878 INFO L87 Difference]: Start difference. First operand 27086 states and 35671 transitions. Second operand 7 states. [2019-09-10 08:06:06,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:06,480 INFO L93 Difference]: Finished difference Result 68852 states and 91016 transitions. [2019-09-10 08:06:06,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:06:06,480 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 157 [2019-09-10 08:06:06,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:06,564 INFO L225 Difference]: With dead ends: 68852 [2019-09-10 08:06:06,565 INFO L226 Difference]: Without dead ends: 68852 [2019-09-10 08:06:06,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:06:06,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68852 states. [2019-09-10 08:06:07,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68852 to 32406. [2019-09-10 08:06:07,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32406 states. [2019-09-10 08:06:07,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32406 states to 32406 states and 42647 transitions. [2019-09-10 08:06:07,112 INFO L78 Accepts]: Start accepts. Automaton has 32406 states and 42647 transitions. Word has length 157 [2019-09-10 08:06:07,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:07,113 INFO L475 AbstractCegarLoop]: Abstraction has 32406 states and 42647 transitions. [2019-09-10 08:06:07,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:06:07,113 INFO L276 IsEmpty]: Start isEmpty. Operand 32406 states and 42647 transitions. [2019-09-10 08:06:07,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-10 08:06:07,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:07,118 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] [2019-09-10 08:06:07,119 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:07,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:07,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1636485859, now seen corresponding path program 1 times [2019-09-10 08:06:07,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:07,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:07,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:07,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:07,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:07,525 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:06:07,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:06:07,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:06:07,526 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 159 with the following transitions: [2019-09-10 08:06:07,526 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], [103], [106], [109], [113], [116], [119], [123], [126], [129], [133], [136], [139], [143], [146], [149], [152], [156], [159], [162], [166], [168], [171], [174], [177], [180], [182], [184], [187], [190], [193], [195], [197], [200], [203], [206], [208], [210], [213], [216], [219], [221], [223], [226], [236], [239], [243], [246], [249], [253], [255], [258], [261], [269], [271], [274], [282], [284], [287], [295], [297], [300], [308], [310], [313], [321], [323], [325], [327], [330], [333], [337], [339], [341], [344], [345], [347], [349], [351], [356], [358], [361], [374], [376], [379], [382], [384], [399], [401], [404], [407], [409], [424], [426], [429], [432], [434], [449], [451], [454], [457], [459], [474], [476], [479], [482], [484], [520], [2376], [2377], [2381], [2382], [2383] [2019-09-10 08:06:07,533 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:06:07,533 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:06:07,597 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:06:08,606 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:06:08,607 INFO L272 AbstractInterpreter]: Visited 146 different actions 895 times. Merged at 57 different actions 651 times. Widened at 25 different actions 145 times. Performed 3296 root evaluator evaluations with a maximum evaluation depth of 7. Performed 3296 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 101 fixpoints after 22 different actions. Largest state had 285 variables. [2019-09-10 08:06:08,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:08,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:06:08,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:06:08,608 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:06:08,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:08,641 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:06:09,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:09,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 1637 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 08:06:09,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:06:09,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:09,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:09,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:09,605 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:06:09,606 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:06:09,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:09,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:09,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:09,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:09,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:12,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:06:12,411 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:06:12,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:06:12,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 30 [2019-09-10 08:06:12,415 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:06:12,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:06:12,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:06:12,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2019-09-10 08:06:12,417 INFO L87 Difference]: Start difference. First operand 32406 states and 42647 transitions. Second operand 21 states. [2019-09-10 08:06:14,021 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-09-10 08:06:14,170 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:06:14,948 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2019-09-10 08:06:15,097 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-10 08:06:15,249 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:06:15,399 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 08:06:15,572 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 08:06:15,765 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-10 08:06:16,062 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:06:16,953 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:06:17,164 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:06:17,323 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-10 08:06:17,613 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-09-10 08:06:17,787 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:06:17,930 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 08:06:18,136 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:06:18,305 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:06:18,478 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 08:06:18,647 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:06:18,795 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 08:06:19,202 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:06:19,399 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 50 [2019-09-10 08:06:19,598 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:06:19,767 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-09-10 08:06:19,994 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2019-09-10 08:06:20,327 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:06:20,554 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:06:20,781 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:06:21,068 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:06:21,274 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:06:21,429 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-09-10 08:06:22,876 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 08:06:23,069 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-10 08:06:23,265 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:06:23,607 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:06:23,813 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:06:24,172 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:06:24,346 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-10 08:06:24,602 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:06:24,785 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 08:06:25,151 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 08:06:25,321 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2019-09-10 08:06:25,541 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:06:25,736 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-10 08:06:25,935 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:06:26,118 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 08:06:26,371 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 08:06:26,536 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-10 08:06:26,737 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:06:27,300 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:06:27,489 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-10 08:06:27,696 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-09-10 08:06:27,889 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 08:06:28,045 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2019-09-10 08:06:28,287 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 08:06:28,537 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:06:28,749 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-09-10 08:06:28,904 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-10 08:06:29,687 WARN L188 SmtUtils]: Spent 730.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-09-10 08:06:29,877 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:06:30,075 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 08:06:30,245 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:06:30,400 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2019-09-10 08:06:30,575 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-10 08:06:30,734 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-10 08:06:30,941 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 08:06:31,153 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:06:31,323 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:06:31,481 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:06:31,639 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 08:06:32,096 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 08:06:32,356 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 08:06:32,589 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 50 [2019-09-10 08:06:32,783 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:06:33,030 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:06:33,233 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:06:33,440 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:06:33,640 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-09-10 08:06:33,821 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:06:34,024 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 50 [2019-09-10 08:06:34,262 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:06:34,482 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:06:34,663 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-10 08:06:34,893 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:06:35,082 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:06:35,235 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 08:06:35,452 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:06:35,639 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:06:35,803 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-10 08:06:35,960 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 08:06:36,299 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:06:36,512 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-09-10 08:06:36,682 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2019-09-10 08:06:36,879 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 08:06:37,135 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 08:06:37,334 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-10 08:06:37,562 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:06:37,789 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:06:37,948 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 08:06:38,139 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 08:06:38,379 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:06:38,542 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:06:39,008 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 08:06:39,161 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-10 08:06:39,333 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 08:06:39,695 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:06:39,845 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 08:06:40,148 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:06:40,380 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 08:06:40,562 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-10 08:06:40,731 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-10 08:06:40,958 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-10 08:06:41,159 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:06:41,311 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2019-09-10 08:06:41,507 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:06:41,710 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:06:41,894 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:06:42,068 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:06:42,270 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:06:42,499 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:06:42,657 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2019-09-10 08:06:42,824 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-10 08:06:42,973 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-10 08:06:43,135 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:06:43,542 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 08:06:43,813 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:06:44,145 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:06:44,378 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-09-10 08:06:44,592 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 51 [2019-09-10 08:06:44,829 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:06:44,995 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-10 08:06:45,175 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:06:45,382 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:06:45,544 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-09-10 08:06:45,780 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-10 08:06:45,986 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:06:46,151 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-09-10 08:06:46,361 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:06:46,568 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 08:06:46,737 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-10 08:06:46,897 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-10 08:06:47,067 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-10 08:06:47,218 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-09-10 08:06:48,263 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 08:06:48,458 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:06:48,647 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-10 08:06:48,880 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:06:49,044 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-09-10 08:06:49,240 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:06:49,496 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2019-09-10 08:06:49,724 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2019-09-10 08:06:49,979 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-10 08:06:50,208 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-09-10 08:06:50,437 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-10 08:06:50,620 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:06:50,822 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:06:51,005 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:06:51,182 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-09-10 08:06:51,354 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-10 08:06:51,512 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 08:06:51,788 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:06:52,029 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:06:52,197 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:06:52,380 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 08:06:52,601 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:06:52,807 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:06:53,010 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:06:53,184 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 08:06:53,411 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:06:53,669 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-10 08:06:53,839 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:06:54,062 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:06:54,223 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 08:06:54,401 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 08:06:54,550 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2019-09-10 08:06:54,781 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-09-10 08:06:54,986 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:06:55,217 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:06:55,430 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:06:55,620 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-09-10 08:06:55,807 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 08:06:56,028 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:06:56,212 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:06:56,368 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 43 [2019-09-10 08:06:56,573 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:06:56,737 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:06:56,963 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:06:57,151 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:06:57,631 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 08:06:57,947 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:06:58,110 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-09-10 08:06:58,304 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:06:58,658 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:06:58,856 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:06:59,012 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 42 [2019-09-10 08:06:59,215 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:06:59,455 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:06:59,635 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-09-10 08:06:59,822 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 08:07:00,038 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:07:00,219 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-09-10 08:07:00,411 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:07:00,585 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:07:00,756 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-10 08:07:00,920 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-10 08:07:01,118 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 08:07:01,495 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:07:01,674 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 08:07:01,860 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:07:02,036 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-10 08:07:02,631 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-10 08:07:02,974 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-09-10 08:07:03,173 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 51 [2019-09-10 08:07:03,394 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2019-09-10 08:07:03,602 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:07:03,787 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2019-09-10 08:07:04,055 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-09-10 08:07:04,317 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 44 [2019-09-10 08:07:04,775 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2019-09-10 08:07:06,615 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:07:06,774 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-10 08:07:06,984 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:07:07,172 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:07:07,352 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2019-09-10 08:07:07,520 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 08:07:07,700 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 08:07:07,935 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:07:08,200 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:07:08,556 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-09-10 08:07:08,740 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:07:09,213 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2019-09-10 08:07:09,380 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:07:09,684 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 08:07:09,873 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 08:07:10,084 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:07:10,281 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2019-09-10 08:07:10,461 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-10 08:07:10,681 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:07:10,848 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 08:07:10,999 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-09-10 08:07:11,232 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:07:11,445 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-09-10 08:07:11,782 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 08:07:12,028 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-09-10 08:07:12,217 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:07:12,424 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-09-10 08:07:12,590 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:07:12,784 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:07:12,952 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-10 08:07:13,128 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:07:13,291 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-09-10 08:07:14,013 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:07:14,171 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2019-09-10 08:07:14,318 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-10 08:07:14,525 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:07:14,713 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 50 [2019-09-10 08:07:14,876 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-09-10 08:07:15,128 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:07:15,386 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:07:15,558 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 08:07:15,841 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-09-10 08:07:16,065 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 08:07:16,490 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:07:16,707 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:07:16,904 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:07:17,135 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:07:17,397 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2019-09-10 08:07:17,635 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:07:17,794 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 43 [2019-09-10 08:07:19,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:19,025 INFO L93 Difference]: Finished difference Result 771870 states and 992270 transitions. [2019-09-10 08:07:19,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 327 states. [2019-09-10 08:07:19,025 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 158 [2019-09-10 08:07:19,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:24,409 INFO L225 Difference]: With dead ends: 771870 [2019-09-10 08:07:24,410 INFO L226 Difference]: Without dead ends: 771870 [2019-09-10 08:07:24,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 652 GetRequests, 254 SyntacticMatches, 45 SemanticMatches, 353 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52414 ImplicationChecksByTransitivity, 59.0s TimeCoverageRelationStatistics Valid=15646, Invalid=110024, Unknown=0, NotChecked=0, Total=125670 [2019-09-10 08:07:24,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771870 states. [2019-09-10 08:07:29,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771870 to 160465. [2019-09-10 08:07:29,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160465 states. [2019-09-10 08:07:29,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160465 states to 160465 states and 209929 transitions. [2019-09-10 08:07:29,623 INFO L78 Accepts]: Start accepts. Automaton has 160465 states and 209929 transitions. Word has length 158 [2019-09-10 08:07:29,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:29,624 INFO L475 AbstractCegarLoop]: Abstraction has 160465 states and 209929 transitions. [2019-09-10 08:07:29,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:07:29,624 INFO L276 IsEmpty]: Start isEmpty. Operand 160465 states and 209929 transitions. [2019-09-10 08:07:29,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-10 08:07:29,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:29,648 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] [2019-09-10 08:07:29,648 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:29,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:29,649 INFO L82 PathProgramCache]: Analyzing trace with hash 455145598, now seen corresponding path program 1 times [2019-09-10 08:07:29,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:29,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:29,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:29,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:29,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:30,029 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:07:30,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:07:30,030 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:07:30,030 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 160 with the following transitions: [2019-09-10 08:07:30,031 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], [103], [106], [109], [113], [116], [119], [123], [126], [129], [133], [136], [139], [143], [146], [149], [152], [156], [159], [162], [166], [168], [171], [174], [177], [180], [182], [184], [187], [190], [193], [195], [197], [200], [203], [206], [208], [210], [213], [216], [219], [221], [223], [226], [236], [239], [243], [246], [249], [253], [255], [258], [261], [264], [269], [271], [274], [282], [284], [287], [295], [297], [300], [308], [310], [313], [316], [321], [323], [325], [327], [330], [337], [339], [341], [344], [345], [347], [349], [358], [361], [365], [367], [370], [376], [379], [382], [384], [399], [401], [404], [407], [409], [424], [426], [429], [432], [434], [449], [451], [454], [457], [459], [467], [470], [476], [479], [482], [484], [520], [2376], [2377], [2381], [2382], [2383] [2019-09-10 08:07:30,043 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:07:30,044 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:07:30,149 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:07:32,472 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:07:32,473 INFO L272 AbstractInterpreter]: Visited 148 different actions 830 times. Merged at 59 different actions 603 times. Widened at 24 different actions 120 times. Performed 3112 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3112 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 68 fixpoints after 19 different actions. Largest state had 285 variables. [2019-09-10 08:07:32,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:32,473 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:07:32,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:07:32,474 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) [2019-09-10 08:07:32,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:32,503 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:07:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:32,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 1642 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 08:07:32,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:07:32,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:32,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:33,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:33,355 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:07:33,355 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:07:33,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:33,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:33,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:33,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:33,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:33,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:33,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:33,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:33,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:33,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:33,803 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:07:33,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:07:33,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 27 [2019-09-10 08:07:33,817 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:07:33,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 08:07:33,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 08:07:33,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:07:33,818 INFO L87 Difference]: Start difference. First operand 160465 states and 209929 transitions. Second operand 19 states. [2019-09-10 08:07:37,003 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 40 [2019-09-10 08:07:37,502 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 42 [2019-09-10 08:07:40,793 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 43 [2019-09-10 08:07:41,712 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 40 [2019-09-10 08:07:42,153 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 42 [2019-09-10 08:07:42,314 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 43 [2019-09-10 08:07:48,455 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 38 [2019-09-10 08:07:49,952 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 42 [2019-09-10 08:07:50,117 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 42 [2019-09-10 08:07:50,598 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 46 [2019-09-10 08:07:50,774 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 46 [2019-09-10 08:07:50,951 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2019-09-10 08:07:51,131 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2019-09-10 08:07:51,849 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2019-09-10 08:07:52,126 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 44 [2019-09-10 08:07:52,706 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2019-09-10 08:07:52,853 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2019-09-10 08:07:53,203 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2019-09-10 08:07:53,855 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2019-09-10 08:07:54,174 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 40 [2019-09-10 08:07:54,690 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 44 [2019-09-10 08:07:54,974 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 41 [2019-09-10 08:07:55,264 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 43 [2019-09-10 08:07:55,762 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 40 [2019-09-10 08:07:58,258 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2019-09-10 08:07:59,840 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 41 [2019-09-10 08:08:00,433 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 45 [2019-09-10 08:08:04,601 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2019-09-10 08:08:11,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:08:11,283 INFO L93 Difference]: Finished difference Result 1369195 states and 1767538 transitions. [2019-09-10 08:08:11,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 232 states. [2019-09-10 08:08:11,283 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 159 [2019-09-10 08:08:11,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:08:20,383 INFO L225 Difference]: With dead ends: 1369195 [2019-09-10 08:08:20,384 INFO L226 Difference]: Without dead ends: 1369195 [2019-09-10 08:08:20,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 301 SyntacticMatches, 2 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26478 ImplicationChecksByTransitivity, 27.3s TimeCoverageRelationStatistics Valid=8901, Invalid=56891, Unknown=0, NotChecked=0, Total=65792 [2019-09-10 08:08:21,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369195 states. [2019-09-10 08:08:34,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369195 to 388731. [2019-09-10 08:08:34,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388731 states. [2019-09-10 08:08:42,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388731 states to 388731 states and 507513 transitions. [2019-09-10 08:08:42,705 INFO L78 Accepts]: Start accepts. Automaton has 388731 states and 507513 transitions. Word has length 159 [2019-09-10 08:08:42,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:08:42,706 INFO L475 AbstractCegarLoop]: Abstraction has 388731 states and 507513 transitions. [2019-09-10 08:08:42,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 08:08:42,706 INFO L276 IsEmpty]: Start isEmpty. Operand 388731 states and 507513 transitions. [2019-09-10 08:08:42,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 08:08:42,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:08:42,737 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] [2019-09-10 08:08:42,738 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:08:42,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:42,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1774933772, now seen corresponding path program 1 times [2019-09-10 08:08:42,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:08:42,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:42,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:42,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:42,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:08:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:42,917 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 08:08:42,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:08:42,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:08:42,917 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:08:42,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:08:42,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:08:42,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:08:42,918 INFO L87 Difference]: Start difference. First operand 388731 states and 507513 transitions. Second operand 9 states. [2019-09-10 08:08:44,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:08:44,705 INFO L93 Difference]: Finished difference Result 557281 states and 726438 transitions. [2019-09-10 08:08:44,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 08:08:44,705 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 160 [2019-09-10 08:08:44,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:08:45,374 INFO L225 Difference]: With dead ends: 557281 [2019-09-10 08:08:45,375 INFO L226 Difference]: Without dead ends: 557281 [2019-09-10 08:08:45,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:08:45,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557281 states. [2019-09-10 08:08:59,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557281 to 388731. [2019-09-10 08:08:59,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388731 states. [2019-09-10 08:08:59,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388731 states to 388731 states and 507509 transitions. [2019-09-10 08:08:59,922 INFO L78 Accepts]: Start accepts. Automaton has 388731 states and 507509 transitions. Word has length 160 [2019-09-10 08:08:59,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:08:59,922 INFO L475 AbstractCegarLoop]: Abstraction has 388731 states and 507509 transitions. [2019-09-10 08:08:59,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:08:59,922 INFO L276 IsEmpty]: Start isEmpty. Operand 388731 states and 507509 transitions. [2019-09-10 08:08:59,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 08:08:59,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:08:59,953 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] [2019-09-10 08:08:59,953 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:08:59,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:59,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1422443817, now seen corresponding path program 1 times [2019-09-10 08:08:59,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:08:59,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:59,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:59,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:59,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:08:59,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:09:00,281 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:09:00,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:09:00,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:09:00,282 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 162 with the following transitions: [2019-09-10 08:09:00,283 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], [103], [106], [109], [113], [116], [119], [123], [126], [129], [133], [136], [139], [143], [146], [149], [152], [156], [159], [162], [166], [168], [171], [174], [177], [180], [182], [184], [187], [190], [193], [195], [197], [200], [203], [206], [208], [210], [213], [216], [219], [221], [223], [226], [229], [232], [234], [236], [239], [243], [246], [249], [253], [255], [258], [261], [269], [271], [274], [277], [282], [284], [287], [295], [297], [300], [308], [310], [313], [316], [321], [323], [325], [327], [330], [337], [339], [341], [344], [345], [347], [349], [358], [361], [365], [367], [370], [376], [379], [382], [384], [399], [401], [404], [407], [409], [424], [426], [429], [432], [434], [442], [445], [451], [454], [457], [459], [474], [476], [479], [482], [484], [2376], [2377], [2381], [2382], [2383] [2019-09-10 08:09:00,288 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:09:00,289 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:09:00,348 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:09:01,235 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:09:01,236 INFO L272 AbstractInterpreter]: Visited 150 different actions 921 times. Merged at 59 different actions 680 times. Widened at 24 different actions 143 times. Performed 3416 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3416 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 71 fixpoints after 17 different actions. Largest state had 285 variables. [2019-09-10 08:09:01,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:09:01,236 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:09:01,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:09:01,236 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) [2019-09-10 08:09:01,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:09:01,256 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:09:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:09:02,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 1644 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 08:09:02,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:09:02,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:02,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:03,075 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:09:03,076 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:09:03,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:03,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:03,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:03,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:03,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:03,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:03,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:03,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:03,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:03,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:03,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:03,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:03,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:03,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:03,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:03,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:03,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:03,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:03,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:03,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:03,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:03,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:03,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:03,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:05,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:05,576 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:09:05,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:09:05,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2019-09-10 08:09:05,582 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:09:05,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:09:05,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:09:05,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=835, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:09:05,583 INFO L87 Difference]: Start difference. First operand 388731 states and 507509 transitions. Second operand 21 states. [2019-09-10 08:09:05,977 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 08:09:06,833 WARN L188 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 08:09:07,382 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 08:09:07,714 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-10 08:09:08,203 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-10 08:09:08,491 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-09-10 08:09:09,325 WARN L188 SmtUtils]: Spent 724.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-09-10 08:09:11,780 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-09-10 08:09:15,155 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-09-10 08:09:15,499 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 08:09:15,890 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-09-10 08:09:16,250 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2019-09-10 08:09:17,104 WARN L188 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2019-09-10 08:09:17,525 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 89 [2019-09-10 08:09:18,010 WARN L188 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2019-09-10 08:09:18,490 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 08:09:18,832 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-09-10 08:09:19,190 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-09-10 08:09:19,496 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-09-10 08:09:20,132 WARN L188 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 74 [2019-09-10 08:09:20,455 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-09-10 08:09:21,005 WARN L188 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-09-10 08:09:21,314 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-09-10 08:09:21,657 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2019-09-10 08:09:22,104 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 08:09:22,479 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2019-09-10 08:09:22,862 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-09-10 08:09:23,446 WARN L188 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-09-10 08:09:23,882 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2019-09-10 08:09:24,415 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 08:09:24,859 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-09-10 08:09:25,633 WARN L188 SmtUtils]: Spent 692.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2019-09-10 08:09:26,007 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2019-09-10 08:09:26,513 WARN L188 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2019-09-10 08:09:26,957 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-09-10 08:09:27,440 WARN L188 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-09-10 08:09:27,850 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-09-10 08:09:28,142 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-09-10 08:09:28,636 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-09-10 08:09:29,143 WARN L188 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:09:29,528 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:09:29,895 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 08:09:30,259 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 08:09:30,725 WARN L188 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 08:09:31,659 WARN L188 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-09-10 08:09:32,104 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:09:32,544 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:09:32,967 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 08:09:33,388 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 08:09:33,773 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 08:09:34,225 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2019-09-10 08:09:34,863 WARN L188 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 96 [2019-09-10 08:09:35,348 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 96 [2019-09-10 08:09:35,905 WARN L188 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:09:36,343 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:09:36,769 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2019-09-10 08:09:37,226 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2019-09-10 08:09:37,671 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 08:09:38,131 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 90 [2019-09-10 08:09:39,939 WARN L188 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 08:09:40,401 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 08:09:40,885 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 08:09:41,296 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2019-09-10 08:09:41,696 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-09-10 08:09:42,278 WARN L188 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 08:09:42,728 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 08:09:43,111 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2019-09-10 08:09:43,456 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-09-10 08:09:43,865 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2019-09-10 08:09:44,361 WARN L188 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:09:44,866 WARN L188 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 96 [2019-09-10 08:09:45,331 WARN L188 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:09:45,943 WARN L188 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 96 [2019-09-10 08:09:46,368 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2019-09-10 08:09:46,758 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2019-09-10 08:09:47,145 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 08:09:47,532 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2019-09-10 08:09:47,957 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2019-09-10 08:09:48,502 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 08:09:48,926 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2019-09-10 08:09:49,314 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 08:09:49,807 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 90 [2019-09-10 08:09:50,270 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-09-10 08:09:50,801 WARN L188 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:09:51,764 WARN L188 SmtUtils]: Spent 836.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:09:52,504 WARN L188 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 08:09:54,112 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 08:09:54,626 WARN L188 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 08:09:59,304 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2019-09-10 08:09:59,848 WARN L188 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2019-09-10 08:10:00,297 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-09-10 08:10:00,628 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-09-10 08:10:01,156 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 08:10:01,585 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 08:10:02,142 WARN L188 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 90 [2019-09-10 08:10:02,585 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 90 [2019-09-10 08:10:03,011 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2019-09-10 08:10:03,981 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 08:10:04,341 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 08:10:04,747 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2019-09-10 08:10:05,180 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2019-09-10 08:10:05,888 WARN L188 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2019-09-10 08:10:06,334 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 89 [2019-09-10 08:10:06,762 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2019-09-10 08:10:08,661 WARN L188 SmtUtils]: Spent 1.79 s on a formula simplification. DAG size of input: 111 DAG size of output: 89 [2019-09-10 08:10:09,125 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2019-09-10 08:10:09,559 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 89 [2019-09-10 08:10:10,059 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2019-09-10 08:10:10,605 WARN L188 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 89 [2019-09-10 08:10:11,261 WARN L188 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2019-09-10 08:10:11,664 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 89 [2019-09-10 08:10:12,125 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2019-09-10 08:10:12,555 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 89 [2019-09-10 08:10:13,050 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 79 [2019-09-10 08:10:13,503 WARN L188 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 79 [2019-09-10 08:10:14,043 WARN L188 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 79 [2019-09-10 08:10:14,719 WARN L188 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 79 [2019-09-10 08:10:15,185 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-09-10 08:10:15,616 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 74 [2019-09-10 08:10:15,926 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-09-10 08:10:16,527 WARN L188 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 74 [2019-09-10 08:10:16,916 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 08:10:17,434 WARN L188 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 84 [2019-09-10 08:10:17,796 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 08:10:18,287 WARN L188 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 84 [2019-09-10 08:10:18,826 WARN L188 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 90 [2019-09-10 08:10:19,286 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 93 [2019-09-10 08:10:19,749 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 90 [2019-09-10 08:10:20,324 WARN L188 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 93 [2019-09-10 08:10:20,852 WARN L188 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-09-10 08:10:21,252 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 08:10:21,631 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-09-10 08:10:22,008 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 08:10:22,461 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 93 [2019-09-10 08:10:22,930 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 93 [2019-09-10 08:10:23,457 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 93 [2019-09-10 08:10:23,947 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 93 [2019-09-10 08:10:24,346 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-09-10 08:10:24,707 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 08:10:25,138 WARN L188 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-09-10 08:10:25,660 WARN L188 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 08:10:26,130 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 93 [2019-09-10 08:10:26,575 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 93 [2019-09-10 08:10:27,174 WARN L188 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 93 [2019-09-10 08:10:27,608 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 93 [2019-09-10 08:10:28,181 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2019-09-10 08:10:28,635 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 89 [2019-09-10 08:10:29,153 WARN L188 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2019-09-10 08:10:29,571 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 89 [2019-09-10 08:10:29,969 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-09-10 08:10:30,498 WARN L188 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-09-10 08:10:31,029 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 08:10:31,384 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 08:10:31,796 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2019-09-10 08:10:32,459 WARN L188 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2019-09-10 08:10:32,998 WARN L188 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2019-09-10 08:10:33,612 WARN L188 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 08:10:34,220 WARN L188 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 08:10:34,735 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 95 [2019-09-10 08:10:35,253 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 95 [2019-09-10 08:10:35,769 WARN L188 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 95 [2019-09-10 08:10:36,343 WARN L188 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 95 [2019-09-10 08:10:36,812 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 85 [2019-09-10 08:10:37,363 WARN L188 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 85 [2019-09-10 08:10:37,767 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 71 [2019-09-10 08:10:38,146 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 80 [2019-09-10 08:10:38,602 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 80 [2019-09-10 08:10:38,946 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-09-10 08:10:39,314 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-09-10 08:10:39,717 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2019-09-10 08:10:40,157 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2019-09-10 08:10:40,584 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-09-10 08:10:40,988 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:10:41,400 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:10:42,014 WARN L188 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 96 [2019-09-10 08:10:42,584 WARN L188 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 96 [2019-09-10 08:10:42,935 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 08:10:43,472 WARN L188 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 84 [2019-09-10 08:10:43,856 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 08:10:44,281 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 84 [2019-09-10 08:10:44,705 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 08:10:45,439 WARN L188 SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 08:10:45,970 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 99 [2019-09-10 08:10:46,547 WARN L188 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 99 [2019-09-10 08:10:46,954 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-09-10 08:10:47,325 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 08:10:47,720 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-09-10 08:10:48,086 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 08:10:48,525 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 08:10:48,976 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 08:10:49,503 WARN L188 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 99 [2019-09-10 08:10:50,075 WARN L188 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 99 [2019-09-10 08:10:50,461 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-09-10 08:10:50,921 WARN L188 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 08:10:51,337 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-09-10 08:10:51,713 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 08:10:52,784 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 95 [2019-09-10 08:10:53,240 WARN L188 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 95 [2019-09-10 08:10:53,778 WARN L188 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 08:10:54,121 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 08:10:54,634 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-09-10 08:10:55,045 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-09-10 08:10:55,633 WARN L188 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:10:56,308 WARN L188 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:10:56,764 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 08:10:57,214 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 08:10:57,776 WARN L188 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 08:10:58,324 WARN L188 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 08:10:58,850 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 08:10:59,424 WARN L188 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 08:10:59,910 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 95 [2019-09-10 08:11:00,378 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 81 [2019-09-10 08:11:00,842 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2019-09-10 08:11:01,305 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 84 [2019-09-10 08:11:01,685 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 85 [2019-09-10 08:11:02,055 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 76 [2019-09-10 08:11:02,484 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 80 [2019-09-10 08:11:03,040 WARN L188 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 71 [2019-09-10 08:11:03,413 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-09-10 08:11:03,720 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-10 08:11:04,192 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 96 [2019-09-10 08:11:04,582 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2019-09-10 08:11:05,176 WARN L188 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 85 [2019-09-10 08:11:05,586 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 79 [2019-09-10 08:11:06,141 WARN L188 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 08:11:06,622 WARN L188 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 95 [2019-09-10 08:11:07,155 WARN L188 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 99 [2019-09-10 08:11:07,627 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 93 [2019-09-10 08:11:08,203 WARN L188 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 76 [2019-09-10 08:11:08,731 WARN L188 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 81 [2019-09-10 08:11:09,183 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2019-09-10 08:11:09,759 WARN L188 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 90 [2019-09-10 08:11:10,092 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-09-10 08:11:10,542 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2019-09-10 08:11:10,956 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-09-10 08:11:11,564 WARN L188 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 96 [2019-09-10 08:11:12,061 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-09-10 08:11:12,585 WARN L188 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 93 [2019-09-10 08:11:13,107 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-09-10 08:11:13,665 WARN L188 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2019-09-10 08:11:14,261 WARN L188 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-09-10 08:11:14,752 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 90 [2019-09-10 08:11:15,197 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 08:11:15,627 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 81 [2019-09-10 08:11:18,431 WARN L188 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-09-10 08:11:19,081 WARN L188 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 88 [2019-09-10 08:11:19,612 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-10 08:11:19,991 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-09-10 08:11:20,329 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-09-10 08:11:20,730 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 82 [2019-09-10 08:11:21,102 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-09-10 08:11:22,091 WARN L188 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 76 [2019-09-10 08:11:22,552 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2019-09-10 08:11:22,975 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 85 [2019-09-10 08:11:23,581 WARN L188 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 81 [2019-09-10 08:11:24,238 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-09-10 08:11:24,852 WARN L188 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2019-09-10 08:11:25,300 WARN L188 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 88 [2019-09-10 08:11:25,922 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-09-10 08:11:26,317 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2019-09-10 08:11:26,654 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-09-10 08:11:27,032 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-09-10 08:11:27,556 WARN L188 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2019-09-10 08:11:27,930 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 82 [2019-09-10 08:11:28,369 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 79 [2019-09-10 08:11:28,853 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 90 [2019-09-10 08:11:29,267 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 81 [2019-09-10 08:11:29,749 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 88 [2019-09-10 08:11:30,148 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 85 [2019-09-10 08:11:30,817 WARN L188 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 97 [2019-09-10 08:11:31,366 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2019-09-10 08:11:31,888 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2019-09-10 08:11:32,361 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 91 [2019-09-10 08:11:32,970 WARN L188 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 100 [2019-09-10 08:11:33,914 WARN L188 SmtUtils]: Spent 796.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 94 [2019-09-10 08:11:36,514 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 90 [2019-09-10 08:11:36,965 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2019-09-10 08:11:37,428 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2019-09-10 08:11:37,999 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2019-09-10 08:11:38,569 WARN L188 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2019-09-10 08:11:39,285 WARN L188 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 100 [2019-09-10 08:11:39,732 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 88 [2019-09-10 08:11:40,343 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 91 [2019-09-10 08:11:40,989 WARN L188 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 94 [2019-09-10 08:11:41,595 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 97 [2019-09-10 08:12:15,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:15,651 INFO L93 Difference]: Finished difference Result 4370961 states and 5649108 transitions. [2019-09-10 08:12:15,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 290 states. [2019-09-10 08:12:15,652 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 161 [2019-09-10 08:12:15,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:24,760 INFO L225 Difference]: With dead ends: 4370961 [2019-09-10 08:12:24,760 INFO L226 Difference]: Without dead ends: 4370961 [2019-09-10 08:12:24,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 274 SyntacticMatches, 30 SemanticMatches, 317 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40795 ImplicationChecksByTransitivity, 132.8s TimeCoverageRelationStatistics Valid=14342, Invalid=87100, Unknown=0, NotChecked=0, Total=101442 [2019-09-10 08:12:26,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4370961 states. [2019-09-10 08:13:37,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4370961 to 1418935. [2019-09-10 08:13:37,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1418935 states.