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.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:33:58,675 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:33:58,683 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:33:58,699 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:33:58,699 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:33:58,701 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:33:58,702 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:33:58,704 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:33:58,705 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:33:58,706 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:33:58,707 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:33:58,708 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:33:58,709 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:33:58,710 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:33:58,711 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:33:58,712 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:33:58,713 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:33:58,714 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:33:58,716 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:33:58,718 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:33:58,719 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:33:58,721 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:33:58,722 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:33:58,723 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:33:58,725 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:33:58,725 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:33:58,726 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:33:58,727 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:33:58,727 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:33:58,728 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:33:58,728 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:33:58,729 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:33:58,730 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:33:58,731 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:33:58,732 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:33:58,732 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:33:58,733 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:33:58,733 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:33:58,733 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:33:58,734 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:33:58,735 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:33:58,735 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 07:33:58,761 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:33:58,761 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:33:58,761 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:33:58,762 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:33:58,765 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:33:58,765 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:33:58,766 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:33:58,766 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:33:58,766 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:33:58,766 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:33:58,768 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:33:58,768 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:33:58,769 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:33:58,769 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:33:58,769 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:33:58,769 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:33:58,769 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:33:58,770 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:33:58,770 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:33:58,770 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:33:58,771 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:33:58,771 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:33:58,771 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:33:58,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:33:58,772 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:33:58,772 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:33:58,772 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:33:58,772 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:33:58,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:33:58,773 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:33:58,808 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:33:58,821 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:33:58,826 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:33:58,828 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:33:58,829 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:33:58,830 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-09-10 07:33:58,903 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aacc7849a/87d6072ce4d04e80a40124303598b42a/FLAG357b56228 [2019-09-10 07:33:59,462 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:33:59,463 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-09-10 07:33:59,480 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aacc7849a/87d6072ce4d04e80a40124303598b42a/FLAG357b56228 [2019-09-10 07:33:59,789 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aacc7849a/87d6072ce4d04e80a40124303598b42a [2019-09-10 07:33:59,799 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:33:59,800 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:33:59,801 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:33:59,802 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:33:59,805 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:33:59,806 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:33:59" (1/1) ... [2019-09-10 07:33:59,809 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bfbc47d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:33:59, skipping insertion in model container [2019-09-10 07:33:59,809 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:33:59" (1/1) ... [2019-09-10 07:33:59,819 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:33:59,898 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:34:00,395 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:34:00,409 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:34:00,715 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:34:00,742 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:34:00,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:34:00 WrapperNode [2019-09-10 07:34:00,743 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:34:00,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:34:00,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:34:00,745 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:34:00,759 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:34:00" (1/1) ... [2019-09-10 07:34:00,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:34:00" (1/1) ... [2019-09-10 07:34:00,800 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:34:00" (1/1) ... [2019-09-10 07:34:00,800 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:34:00" (1/1) ... [2019-09-10 07:34:00,842 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:34:00" (1/1) ... [2019-09-10 07:34:00,857 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:34:00" (1/1) ... [2019-09-10 07:34:00,866 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:34:00" (1/1) ... [2019-09-10 07:34:00,878 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:34:00,882 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:34:00,882 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:34:00,883 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:34:00,884 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:34:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:34:00,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:34:00,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:34:00,962 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:34:00,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:34:00,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:34:00,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:34:00,963 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:34:00,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:34:00,963 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:34:00,964 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:34:00,964 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:34:00,965 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:34:00,965 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:34:00,966 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:34:00,966 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:34:00,967 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:34:00,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:34:00,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:34:02,324 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:34:02,325 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:34:02,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:34:02 BoogieIcfgContainer [2019-09-10 07:34:02,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:34:02,330 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:34:02,331 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:34:02,334 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:34:02,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:33:59" (1/3) ... [2019-09-10 07:34:02,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ef08135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:34:02, skipping insertion in model container [2019-09-10 07:34:02,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:34:00" (2/3) ... [2019-09-10 07:34:02,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ef08135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:34:02, skipping insertion in model container [2019-09-10 07:34:02,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:34:02" (3/3) ... [2019-09-10 07:34:02,343 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-09-10 07:34:02,353 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:34:02,365 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-09-10 07:34:02,383 INFO L252 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-09-10 07:34:02,412 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:34:02,412 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:34:02,413 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:34:02,413 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:34:02,413 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:34:02,413 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:34:02,413 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:34:02,413 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:34:02,440 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states. [2019-09-10 07:34:02,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-10 07:34:02,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:34:02,458 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:34:02,460 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:34:02,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:02,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1790086, now seen corresponding path program 1 times [2019-09-10 07:34:02,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:34:02,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:02,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:02,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:02,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:34:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:02,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:02,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:34:02,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:34:02,972 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:34:02,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:34:02,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:34:02,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:34:02,998 INFO L87 Difference]: Start difference. First operand 284 states. Second operand 5 states. [2019-09-10 07:34:03,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:34:03,368 INFO L93 Difference]: Finished difference Result 233 states and 376 transitions. [2019-09-10 07:34:03,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:34:03,372 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-09-10 07:34:03,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:34:03,396 INFO L225 Difference]: With dead ends: 233 [2019-09-10 07:34:03,396 INFO L226 Difference]: Without dead ends: 221 [2019-09-10 07:34:03,400 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:34:03,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-09-10 07:34:03,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2019-09-10 07:34:03,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-09-10 07:34:03,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 271 transitions. [2019-09-10 07:34:03,501 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 271 transitions. Word has length 52 [2019-09-10 07:34:03,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:34:03,502 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 271 transitions. [2019-09-10 07:34:03,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:34:03,503 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 271 transitions. [2019-09-10 07:34:03,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-10 07:34:03,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:34:03,507 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:34:03,507 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:34:03,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:03,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1791591749, now seen corresponding path program 1 times [2019-09-10 07:34:03,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:34:03,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:03,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:03,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:03,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:34:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:03,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:03,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:34:03,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:34:03,768 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:34:03,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:34:03,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:34:03,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:34:03,771 INFO L87 Difference]: Start difference. First operand 221 states and 271 transitions. Second operand 5 states. [2019-09-10 07:34:03,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:34:03,988 INFO L93 Difference]: Finished difference Result 205 states and 252 transitions. [2019-09-10 07:34:03,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:34:03,989 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-09-10 07:34:03,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:34:03,991 INFO L225 Difference]: With dead ends: 205 [2019-09-10 07:34:03,991 INFO L226 Difference]: Without dead ends: 205 [2019-09-10 07:34:03,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:34:03,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-10 07:34:04,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2019-09-10 07:34:04,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-10 07:34:04,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 252 transitions. [2019-09-10 07:34:04,005 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 252 transitions. Word has length 52 [2019-09-10 07:34:04,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:34:04,005 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 252 transitions. [2019-09-10 07:34:04,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:34:04,006 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 252 transitions. [2019-09-10 07:34:04,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-10 07:34:04,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:34:04,009 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:34:04,009 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:34:04,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:04,010 INFO L82 PathProgramCache]: Analyzing trace with hash 142197449, now seen corresponding path program 1 times [2019-09-10 07:34:04,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:34:04,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:04,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:04,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:04,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:34:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:04,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:04,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:34:04,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:34:04,118 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:34:04,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:34:04,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:34:04,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:34:04,120 INFO L87 Difference]: Start difference. First operand 205 states and 252 transitions. Second operand 5 states. [2019-09-10 07:34:04,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:34:04,274 INFO L93 Difference]: Finished difference Result 167 states and 203 transitions. [2019-09-10 07:34:04,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:34:04,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-09-10 07:34:04,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:34:04,278 INFO L225 Difference]: With dead ends: 167 [2019-09-10 07:34:04,278 INFO L226 Difference]: Without dead ends: 167 [2019-09-10 07:34:04,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:34:04,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-09-10 07:34:04,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2019-09-10 07:34:04,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-10 07:34:04,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 203 transitions. [2019-09-10 07:34:04,297 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 203 transitions. Word has length 52 [2019-09-10 07:34:04,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:34:04,297 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 203 transitions. [2019-09-10 07:34:04,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:34:04,298 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 203 transitions. [2019-09-10 07:34:04,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-10 07:34:04,300 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:34:04,300 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:34:04,302 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:34:04,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:04,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1470629779, now seen corresponding path program 1 times [2019-09-10 07:34:04,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:34:04,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:04,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:04,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:04,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:34:04,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:04,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:04,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:34:04,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:34:04,505 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:34:04,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:34:04,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:34:04,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:34:04,506 INFO L87 Difference]: Start difference. First operand 167 states and 203 transitions. Second operand 8 states. [2019-09-10 07:34:04,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:34:04,940 INFO L93 Difference]: Finished difference Result 243 states and 295 transitions. [2019-09-10 07:34:04,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 07:34:04,941 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-09-10 07:34:04,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:34:04,943 INFO L225 Difference]: With dead ends: 243 [2019-09-10 07:34:04,943 INFO L226 Difference]: Without dead ends: 243 [2019-09-10 07:34:04,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:34:04,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-09-10 07:34:04,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 167. [2019-09-10 07:34:04,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-10 07:34:04,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 202 transitions. [2019-09-10 07:34:04,950 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 202 transitions. Word has length 54 [2019-09-10 07:34:04,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:34:04,950 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 202 transitions. [2019-09-10 07:34:04,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:34:04,951 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 202 transitions. [2019-09-10 07:34:04,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-10 07:34:04,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:34:04,952 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:34:04,953 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:34:04,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:04,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1262249389, now seen corresponding path program 1 times [2019-09-10 07:34:04,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:34:04,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:04,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:04,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:04,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:34:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:05,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:05,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:34:05,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:34:05,155 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:34:05,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:34:05,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:34:05,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:34:05,157 INFO L87 Difference]: Start difference. First operand 167 states and 202 transitions. Second operand 9 states. [2019-09-10 07:34:05,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:34:05,741 INFO L93 Difference]: Finished difference Result 341 states and 439 transitions. [2019-09-10 07:34:05,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:34:05,742 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-09-10 07:34:05,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:34:05,744 INFO L225 Difference]: With dead ends: 341 [2019-09-10 07:34:05,744 INFO L226 Difference]: Without dead ends: 341 [2019-09-10 07:34:05,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:34:05,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-09-10 07:34:05,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 167. [2019-09-10 07:34:05,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-10 07:34:05,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 201 transitions. [2019-09-10 07:34:05,751 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 201 transitions. Word has length 54 [2019-09-10 07:34:05,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:34:05,752 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 201 transitions. [2019-09-10 07:34:05,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:34:05,752 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 201 transitions. [2019-09-10 07:34:05,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-10 07:34:05,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:34:05,753 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:34:05,754 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:34:05,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:05,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1230659379, now seen corresponding path program 1 times [2019-09-10 07:34:05,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:34:05,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:05,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:05,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:05,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:34:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:05,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:05,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:34:05,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:34:05,910 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:34:05,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:34:05,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:34:05,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:34:05,912 INFO L87 Difference]: Start difference. First operand 167 states and 201 transitions. Second operand 9 states. [2019-09-10 07:34:06,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:34:06,688 INFO L93 Difference]: Finished difference Result 345 states and 444 transitions. [2019-09-10 07:34:06,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:34:06,690 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-09-10 07:34:06,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:34:06,694 INFO L225 Difference]: With dead ends: 345 [2019-09-10 07:34:06,694 INFO L226 Difference]: Without dead ends: 345 [2019-09-10 07:34:06,695 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 07:34:06,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-09-10 07:34:06,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 167. [2019-09-10 07:34:06,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-10 07:34:06,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 200 transitions. [2019-09-10 07:34:06,704 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 200 transitions. Word has length 54 [2019-09-10 07:34:06,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:34:06,705 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 200 transitions. [2019-09-10 07:34:06,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:34:06,705 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 200 transitions. [2019-09-10 07:34:06,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 07:34:06,707 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:34:06,710 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:34:06,712 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:34:06,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:06,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1979337398, now seen corresponding path program 1 times [2019-09-10 07:34:06,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:34:06,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:06,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:06,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:06,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:34:06,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:07,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:07,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:34:07,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:34:07,350 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:34:07,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:34:07,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:34:07,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:34:07,351 INFO L87 Difference]: Start difference. First operand 167 states and 200 transitions. Second operand 13 states. [2019-09-10 07:34:08,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:34:08,892 INFO L93 Difference]: Finished difference Result 649 states and 872 transitions. [2019-09-10 07:34:08,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:34:08,892 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2019-09-10 07:34:08,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:34:08,897 INFO L225 Difference]: With dead ends: 649 [2019-09-10 07:34:08,897 INFO L226 Difference]: Without dead ends: 649 [2019-09-10 07:34:08,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=156, Invalid=494, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:34:08,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-09-10 07:34:08,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 155. [2019-09-10 07:34:08,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-09-10 07:34:08,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 186 transitions. [2019-09-10 07:34:08,907 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 186 transitions. Word has length 55 [2019-09-10 07:34:08,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:34:08,907 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 186 transitions. [2019-09-10 07:34:08,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:34:08,907 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 186 transitions. [2019-09-10 07:34:08,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 07:34:08,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:34:08,908 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:34:08,909 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:34:08,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:08,909 INFO L82 PathProgramCache]: Analyzing trace with hash 245455922, now seen corresponding path program 1 times [2019-09-10 07:34:08,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:34:08,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:08,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:08,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:08,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:34:08,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:09,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:09,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:34:09,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 07:34:09,599 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:34:09,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 07:34:09,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 07:34:09,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:34:09,601 INFO L87 Difference]: Start difference. First operand 155 states and 186 transitions. Second operand 16 states. [2019-09-10 07:34:10,041 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-09-10 07:34:10,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:34:10,916 INFO L93 Difference]: Finished difference Result 284 states and 341 transitions. [2019-09-10 07:34:10,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:34:10,916 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-09-10 07:34:10,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:34:10,919 INFO L225 Difference]: With dead ends: 284 [2019-09-10 07:34:10,919 INFO L226 Difference]: Without dead ends: 284 [2019-09-10 07:34:10,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=194, Invalid=562, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:34:10,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-10 07:34:10,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 166. [2019-09-10 07:34:10,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-09-10 07:34:10,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 202 transitions. [2019-09-10 07:34:10,927 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 202 transitions. Word has length 56 [2019-09-10 07:34:10,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:34:10,928 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 202 transitions. [2019-09-10 07:34:10,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 07:34:10,928 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 202 transitions. [2019-09-10 07:34:10,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 07:34:10,929 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:34:10,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] [2019-09-10 07:34:10,929 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:34:10,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:10,930 INFO L82 PathProgramCache]: Analyzing trace with hash -44757294, now seen corresponding path program 1 times [2019-09-10 07:34:10,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:34:10,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:10,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:10,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:10,932 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:34:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:11,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:11,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:34:11,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 07:34:11,497 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:34:11,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 07:34:11,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 07:34:11,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:34:11,498 INFO L87 Difference]: Start difference. First operand 166 states and 202 transitions. Second operand 15 states. [2019-09-10 07:34:12,217 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-10 07:34:12,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:34:12,939 INFO L93 Difference]: Finished difference Result 334 states and 429 transitions. [2019-09-10 07:34:12,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:34:12,940 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-09-10 07:34:12,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:34:12,943 INFO L225 Difference]: With dead ends: 334 [2019-09-10 07:34:12,943 INFO L226 Difference]: Without dead ends: 334 [2019-09-10 07:34:12,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:34:12,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-09-10 07:34:12,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 166. [2019-09-10 07:34:12,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-09-10 07:34:12,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 201 transitions. [2019-09-10 07:34:12,950 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 201 transitions. Word has length 56 [2019-09-10 07:34:12,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:34:12,951 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 201 transitions. [2019-09-10 07:34:12,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 07:34:12,951 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 201 transitions. [2019-09-10 07:34:12,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 07:34:12,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:34:12,952 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:34:12,952 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:34:12,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:12,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1652172464, now seen corresponding path program 1 times [2019-09-10 07:34:12,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:34:12,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:12,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:12,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:12,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:34:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:13,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:13,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:34:13,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:34:13,456 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:34:13,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:34:13,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:34:13,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:34:13,457 INFO L87 Difference]: Start difference. First operand 166 states and 201 transitions. Second operand 13 states. [2019-09-10 07:34:13,916 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2019-09-10 07:34:14,063 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2019-09-10 07:34:15,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:34:15,051 INFO L93 Difference]: Finished difference Result 721 states and 981 transitions. [2019-09-10 07:34:15,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 07:34:15,052 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-09-10 07:34:15,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:34:15,057 INFO L225 Difference]: With dead ends: 721 [2019-09-10 07:34:15,057 INFO L226 Difference]: Without dead ends: 721 [2019-09-10 07:34:15,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:34:15,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2019-09-10 07:34:15,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 138. [2019-09-10 07:34:15,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-09-10 07:34:15,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 166 transitions. [2019-09-10 07:34:15,065 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 166 transitions. Word has length 57 [2019-09-10 07:34:15,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:34:15,066 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 166 transitions. [2019-09-10 07:34:15,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:34:15,066 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 166 transitions. [2019-09-10 07:34:15,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 07:34:15,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:34:15,067 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:34:15,067 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:34:15,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:15,067 INFO L82 PathProgramCache]: Analyzing trace with hash -835334377, now seen corresponding path program 1 times [2019-09-10 07:34:15,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:34:15,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:15,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:15,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:15,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:34:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:15,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:15,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:34:15,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 07:34:15,392 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:34:15,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 07:34:15,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 07:34:15,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:34:15,393 INFO L87 Difference]: Start difference. First operand 138 states and 166 transitions. Second operand 11 states. [2019-09-10 07:34:15,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:34:15,862 INFO L93 Difference]: Finished difference Result 250 states and 318 transitions. [2019-09-10 07:34:15,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:34:15,862 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2019-09-10 07:34:15,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:34:15,865 INFO L225 Difference]: With dead ends: 250 [2019-09-10 07:34:15,865 INFO L226 Difference]: Without dead ends: 250 [2019-09-10 07:34:15,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:34:15,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-09-10 07:34:15,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 134. [2019-09-10 07:34:15,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-09-10 07:34:15,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 161 transitions. [2019-09-10 07:34:15,871 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 161 transitions. Word has length 57 [2019-09-10 07:34:15,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:34:15,871 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 161 transitions. [2019-09-10 07:34:15,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 07:34:15,871 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 161 transitions. [2019-09-10 07:34:15,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 07:34:15,872 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:34:15,872 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:34:15,873 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:34:15,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:15,873 INFO L82 PathProgramCache]: Analyzing trace with hash 112766514, now seen corresponding path program 1 times [2019-09-10 07:34:15,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:34:15,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:15,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:15,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:15,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:34:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:15,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:15,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:34:15,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:34:15,981 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:34:15,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:34:15,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:34:15,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:34:15,982 INFO L87 Difference]: Start difference. First operand 134 states and 161 transitions. Second operand 9 states. [2019-09-10 07:34:16,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:34:16,520 INFO L93 Difference]: Finished difference Result 207 states and 256 transitions. [2019-09-10 07:34:16,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 07:34:16,521 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-09-10 07:34:16,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:34:16,524 INFO L225 Difference]: With dead ends: 207 [2019-09-10 07:34:16,524 INFO L226 Difference]: Without dead ends: 207 [2019-09-10 07:34:16,524 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 07:34:16,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-09-10 07:34:16,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 134. [2019-09-10 07:34:16,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-09-10 07:34:16,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 160 transitions. [2019-09-10 07:34:16,529 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 160 transitions. Word has length 58 [2019-09-10 07:34:16,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:34:16,529 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 160 transitions. [2019-09-10 07:34:16,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:34:16,529 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 160 transitions. [2019-09-10 07:34:16,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 07:34:16,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:34:16,530 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:34:16,530 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:34:16,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:16,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1355038921, now seen corresponding path program 1 times [2019-09-10 07:34:16,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:34:16,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:16,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:16,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:16,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:34:16,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:16,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:16,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:34:16,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:34:16,642 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:34:16,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:34:16,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:34:16,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:34:16,643 INFO L87 Difference]: Start difference. First operand 134 states and 160 transitions. Second operand 9 states. [2019-09-10 07:34:17,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:34:17,084 INFO L93 Difference]: Finished difference Result 200 states and 247 transitions. [2019-09-10 07:34:17,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 07:34:17,084 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-09-10 07:34:17,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:34:17,086 INFO L225 Difference]: With dead ends: 200 [2019-09-10 07:34:17,086 INFO L226 Difference]: Without dead ends: 200 [2019-09-10 07:34:17,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:34:17,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-09-10 07:34:17,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 134. [2019-09-10 07:34:17,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-09-10 07:34:17,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 159 transitions. [2019-09-10 07:34:17,101 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 159 transitions. Word has length 59 [2019-09-10 07:34:17,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:34:17,101 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 159 transitions. [2019-09-10 07:34:17,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:34:17,102 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 159 transitions. [2019-09-10 07:34:17,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 07:34:17,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:34:17,102 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:34:17,103 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:34:17,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:17,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1142655831, now seen corresponding path program 1 times [2019-09-10 07:34:17,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:34:17,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:17,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:17,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:17,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:34:17,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:17,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:17,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:34:17,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 07:34:17,539 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:34:17,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:34:17,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:34:17,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:34:17,541 INFO L87 Difference]: Start difference. First operand 134 states and 159 transitions. Second operand 18 states. [2019-09-10 07:34:17,681 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 07:34:18,206 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-10 07:34:19,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:34:19,495 INFO L93 Difference]: Finished difference Result 438 states and 569 transitions. [2019-09-10 07:34:19,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:34:19,495 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 60 [2019-09-10 07:34:19,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:34:19,497 INFO L225 Difference]: With dead ends: 438 [2019-09-10 07:34:19,497 INFO L226 Difference]: Without dead ends: 438 [2019-09-10 07:34:19,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=192, Invalid=800, Unknown=0, NotChecked=0, Total=992 [2019-09-10 07:34:19,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-09-10 07:34:19,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 147. [2019-09-10 07:34:19,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-10 07:34:19,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 175 transitions. [2019-09-10 07:34:19,513 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 175 transitions. Word has length 60 [2019-09-10 07:34:19,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:34:19,514 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 175 transitions. [2019-09-10 07:34:19,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:34:19,515 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 175 transitions. [2019-09-10 07:34:19,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 07:34:19,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:34:19,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] [2019-09-10 07:34:19,517 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:34:19,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:19,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1667709700, now seen corresponding path program 1 times [2019-09-10 07:34:19,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:34:19,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:19,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:19,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:19,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:34:19,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:20,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:20,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:34:20,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 07:34:20,234 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:34:20,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 07:34:20,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 07:34:20,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:34:20,235 INFO L87 Difference]: Start difference. First operand 147 states and 175 transitions. Second operand 14 states. [2019-09-10 07:34:21,137 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2019-09-10 07:34:22,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:34:22,151 INFO L93 Difference]: Finished difference Result 391 states and 521 transitions. [2019-09-10 07:34:22,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:34:22,152 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 61 [2019-09-10 07:34:22,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:34:22,154 INFO L225 Difference]: With dead ends: 391 [2019-09-10 07:34:22,154 INFO L226 Difference]: Without dead ends: 391 [2019-09-10 07:34:22,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:34:22,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-09-10 07:34:22,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 147. [2019-09-10 07:34:22,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-10 07:34:22,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 175 transitions. [2019-09-10 07:34:22,164 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 175 transitions. Word has length 61 [2019-09-10 07:34:22,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:34:22,165 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 175 transitions. [2019-09-10 07:34:22,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 07:34:22,165 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 175 transitions. [2019-09-10 07:34:22,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 07:34:22,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:34:22,166 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:34:22,166 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:34:22,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:22,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1541387915, now seen corresponding path program 1 times [2019-09-10 07:34:22,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:34:22,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:22,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:22,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:22,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:34:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:22,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:22,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:34:22,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:34:22,501 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:34:22,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:34:22,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:34:22,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:34:22,503 INFO L87 Difference]: Start difference. First operand 147 states and 175 transitions. Second operand 12 states. [2019-09-10 07:34:23,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:34:23,623 INFO L93 Difference]: Finished difference Result 403 states and 532 transitions. [2019-09-10 07:34:23,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:34:23,624 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2019-09-10 07:34:23,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:34:23,627 INFO L225 Difference]: With dead ends: 403 [2019-09-10 07:34:23,627 INFO L226 Difference]: Without dead ends: 403 [2019-09-10 07:34:23,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:34:23,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2019-09-10 07:34:23,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 128. [2019-09-10 07:34:23,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-10 07:34:23,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 153 transitions. [2019-09-10 07:34:23,633 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 153 transitions. Word has length 61 [2019-09-10 07:34:23,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:34:23,633 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 153 transitions. [2019-09-10 07:34:23,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:34:23,634 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 153 transitions. [2019-09-10 07:34:23,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 07:34:23,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:34:23,634 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:34:23,635 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:34:23,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:23,635 INFO L82 PathProgramCache]: Analyzing trace with hash -193814788, now seen corresponding path program 1 times [2019-09-10 07:34:23,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:34:23,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:23,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:23,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:23,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:34:23,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:24,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:24,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:34:24,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 07:34:24,485 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:34:24,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:34:24,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:34:24,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:34:24,486 INFO L87 Difference]: Start difference. First operand 128 states and 153 transitions. Second operand 18 states. [2019-09-10 07:34:25,185 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 07:34:25,334 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:34:25,479 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:34:25,638 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 07:34:25,855 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 07:34:27,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:34:27,113 INFO L93 Difference]: Finished difference Result 353 states and 462 transitions. [2019-09-10 07:34:27,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:34:27,113 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 61 [2019-09-10 07:34:27,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:34:27,115 INFO L225 Difference]: With dead ends: 353 [2019-09-10 07:34:27,115 INFO L226 Difference]: Without dead ends: 353 [2019-09-10 07:34:27,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=248, Invalid=808, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 07:34:27,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-09-10 07:34:27,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 128. [2019-09-10 07:34:27,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-10 07:34:27,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 152 transitions. [2019-09-10 07:34:27,121 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 152 transitions. Word has length 61 [2019-09-10 07:34:27,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:34:27,121 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 152 transitions. [2019-09-10 07:34:27,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:34:27,122 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 152 transitions. [2019-09-10 07:34:27,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-10 07:34:27,122 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:34:27,122 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:34:27,123 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:34:27,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:27,123 INFO L82 PathProgramCache]: Analyzing trace with hash 853354510, now seen corresponding path program 1 times [2019-09-10 07:34:27,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:34:27,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:27,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:27,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:27,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:34:27,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:27,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:27,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:34:27,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 07:34:27,813 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:34:27,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:34:27,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:34:27,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:34:27,814 INFO L87 Difference]: Start difference. First operand 128 states and 152 transitions. Second operand 20 states. [2019-09-10 07:34:27,954 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 07:34:29,084 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 36 [2019-09-10 07:34:30,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:34:30,446 INFO L93 Difference]: Finished difference Result 293 states and 382 transitions. [2019-09-10 07:34:30,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:34:30,447 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 62 [2019-09-10 07:34:30,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:34:30,448 INFO L225 Difference]: With dead ends: 293 [2019-09-10 07:34:30,448 INFO L226 Difference]: Without dead ends: 282 [2019-09-10 07:34:30,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=280, Invalid=980, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 07:34:30,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-10 07:34:30,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 108. [2019-09-10 07:34:30,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-09-10 07:34:30,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 132 transitions. [2019-09-10 07:34:30,454 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 132 transitions. Word has length 62 [2019-09-10 07:34:30,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:34:30,454 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 132 transitions. [2019-09-10 07:34:30,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:34:30,454 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 132 transitions. [2019-09-10 07:34:30,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 07:34:30,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:34:30,455 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:34:30,455 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:34:30,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:30,455 INFO L82 PathProgramCache]: Analyzing trace with hash -48178293, now seen corresponding path program 1 times [2019-09-10 07:34:30,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:34:30,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:30,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:30,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:30,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:34:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:30,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:30,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:34:30,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:34:30,511 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:34:30,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:34:30,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:34:30,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:34:30,513 INFO L87 Difference]: Start difference. First operand 108 states and 132 transitions. Second operand 3 states. [2019-09-10 07:34:30,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:34:30,533 INFO L93 Difference]: Finished difference Result 147 states and 186 transitions. [2019-09-10 07:34:30,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:34:30,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-10 07:34:30,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:34:30,535 INFO L225 Difference]: With dead ends: 147 [2019-09-10 07:34:30,535 INFO L226 Difference]: Without dead ends: 147 [2019-09-10 07:34:30,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:34:30,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-09-10 07:34:30,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2019-09-10 07:34:30,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-09-10 07:34:30,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 185 transitions. [2019-09-10 07:34:30,540 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 185 transitions. Word has length 79 [2019-09-10 07:34:30,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:34:30,540 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 185 transitions. [2019-09-10 07:34:30,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:34:30,541 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 185 transitions. [2019-09-10 07:34:30,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:34:30,544 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:34:30,544 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:34:30,545 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:34:30,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:30,545 INFO L82 PathProgramCache]: Analyzing trace with hash 279854363, now seen corresponding path program 1 times [2019-09-10 07:34:30,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:34:30,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:30,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:30,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:30,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:34:30,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:30,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:30,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:34:30,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:34:30,591 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:34:30,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:34:30,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:34:30,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:34:30,592 INFO L87 Difference]: Start difference. First operand 145 states and 185 transitions. Second operand 3 states. [2019-09-10 07:34:30,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:34:30,611 INFO L93 Difference]: Finished difference Result 215 states and 281 transitions. [2019-09-10 07:34:30,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:34:30,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-10 07:34:30,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:34:30,612 INFO L225 Difference]: With dead ends: 215 [2019-09-10 07:34:30,613 INFO L226 Difference]: Without dead ends: 215 [2019-09-10 07:34:30,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:34:30,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-09-10 07:34:30,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2019-09-10 07:34:30,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-09-10 07:34:30,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 280 transitions. [2019-09-10 07:34:30,619 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 280 transitions. Word has length 81 [2019-09-10 07:34:30,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:34:30,620 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 280 transitions. [2019-09-10 07:34:30,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:34:30,620 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 280 transitions. [2019-09-10 07:34:30,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:34:30,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:34:30,621 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:34:30,621 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:34:30,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:30,622 INFO L82 PathProgramCache]: Analyzing trace with hash 346347875, now seen corresponding path program 1 times [2019-09-10 07:34:30,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:34:30,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:30,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:30,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:30,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:34:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:30,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:30,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:34:30,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:34:30,704 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:34:30,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:34:30,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:34:30,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:34:30,706 INFO L87 Difference]: Start difference. First operand 213 states and 280 transitions. Second operand 3 states. [2019-09-10 07:34:30,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:34:30,751 INFO L93 Difference]: Finished difference Result 290 states and 386 transitions. [2019-09-10 07:34:30,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:34:30,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-10 07:34:30,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:34:30,754 INFO L225 Difference]: With dead ends: 290 [2019-09-10 07:34:30,754 INFO L226 Difference]: Without dead ends: 290 [2019-09-10 07:34:30,755 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:34:30,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-09-10 07:34:30,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 288. [2019-09-10 07:34:30,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-09-10 07:34:30,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 385 transitions. [2019-09-10 07:34:30,764 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 385 transitions. Word has length 81 [2019-09-10 07:34:30,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:34:30,764 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 385 transitions. [2019-09-10 07:34:30,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:34:30,765 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 385 transitions. [2019-09-10 07:34:30,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:34:30,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:34:30,767 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:34:30,767 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:34:30,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:30,768 INFO L82 PathProgramCache]: Analyzing trace with hash 365336372, now seen corresponding path program 1 times [2019-09-10 07:34:30,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:34:30,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:30,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:30,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:30,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:34:30,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:30,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 07:34:30,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:34:30,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:34:30,880 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:34:30,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:34:30,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:34:30,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:34:30,881 INFO L87 Difference]: Start difference. First operand 288 states and 385 transitions. Second operand 7 states. [2019-09-10 07:34:31,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:34:31,274 INFO L93 Difference]: Finished difference Result 993 states and 1345 transitions. [2019-09-10 07:34:31,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:34:31,275 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2019-09-10 07:34:31,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:34:31,279 INFO L225 Difference]: With dead ends: 993 [2019-09-10 07:34:31,280 INFO L226 Difference]: Without dead ends: 993 [2019-09-10 07:34:31,280 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 07:34:31,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2019-09-10 07:34:31,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 569. [2019-09-10 07:34:31,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-09-10 07:34:31,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 784 transitions. [2019-09-10 07:34:31,295 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 784 transitions. Word has length 81 [2019-09-10 07:34:31,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:34:31,295 INFO L475 AbstractCegarLoop]: Abstraction has 569 states and 784 transitions. [2019-09-10 07:34:31,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:34:31,295 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 784 transitions. [2019-09-10 07:34:31,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:34:31,296 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:34:31,296 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:34:31,297 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:34:31,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:31,298 INFO L82 PathProgramCache]: Analyzing trace with hash 980014388, now seen corresponding path program 1 times [2019-09-10 07:34:31,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:34:31,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:31,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:31,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:31,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:34:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:31,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:31,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:34:31,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:34:31,391 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:34:31,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:34:31,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:34:31,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:34:31,392 INFO L87 Difference]: Start difference. First operand 569 states and 784 transitions. Second operand 7 states. [2019-09-10 07:34:31,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:34:31,700 INFO L93 Difference]: Finished difference Result 1516 states and 2091 transitions. [2019-09-10 07:34:31,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:34:31,700 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2019-09-10 07:34:31,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:34:31,707 INFO L225 Difference]: With dead ends: 1516 [2019-09-10 07:34:31,708 INFO L226 Difference]: Without dead ends: 1516 [2019-09-10 07:34:31,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:34:31,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2019-09-10 07:34:31,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 963. [2019-09-10 07:34:31,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2019-09-10 07:34:31,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1342 transitions. [2019-09-10 07:34:31,731 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1342 transitions. Word has length 81 [2019-09-10 07:34:31,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:34:31,731 INFO L475 AbstractCegarLoop]: Abstraction has 963 states and 1342 transitions. [2019-09-10 07:34:31,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:34:31,732 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1342 transitions. [2019-09-10 07:34:31,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:34:31,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:34:31,733 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:34:31,733 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:34:31,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:31,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1086450892, now seen corresponding path program 1 times [2019-09-10 07:34:31,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:34:31,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:31,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:31,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:31,735 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:34:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:31,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:31,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:34:31,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:34:31,859 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:34:31,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:34:31,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:34:31,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:34:31,861 INFO L87 Difference]: Start difference. First operand 963 states and 1342 transitions. Second operand 7 states. [2019-09-10 07:34:32,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:34:32,142 INFO L93 Difference]: Finished difference Result 2069 states and 2841 transitions. [2019-09-10 07:34:32,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:34:32,143 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2019-09-10 07:34:32,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:34:32,150 INFO L225 Difference]: With dead ends: 2069 [2019-09-10 07:34:32,150 INFO L226 Difference]: Without dead ends: 2069 [2019-09-10 07:34:32,150 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 07:34:32,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2019-09-10 07:34:32,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 1229. [2019-09-10 07:34:32,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1229 states. [2019-09-10 07:34:32,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1690 transitions. [2019-09-10 07:34:32,182 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1690 transitions. Word has length 81 [2019-09-10 07:34:32,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:34:32,183 INFO L475 AbstractCegarLoop]: Abstraction has 1229 states and 1690 transitions. [2019-09-10 07:34:32,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:34:32,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1690 transitions. [2019-09-10 07:34:32,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:34:32,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:34:32,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] [2019-09-10 07:34:32,184 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:34:32,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:32,185 INFO L82 PathProgramCache]: Analyzing trace with hash 158803972, now seen corresponding path program 1 times [2019-09-10 07:34:32,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:34:32,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:32,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:32,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:32,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:34:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:32,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:32,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:34:32,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:34:32,236 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:34:32,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:34:32,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:34:32,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:34:32,237 INFO L87 Difference]: Start difference. First operand 1229 states and 1690 transitions. Second operand 3 states. [2019-09-10 07:34:32,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:34:32,255 INFO L93 Difference]: Finished difference Result 1126 states and 1516 transitions. [2019-09-10 07:34:32,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:34:32,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-10 07:34:32,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:34:32,260 INFO L225 Difference]: With dead ends: 1126 [2019-09-10 07:34:32,260 INFO L226 Difference]: Without dead ends: 1126 [2019-09-10 07:34:32,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:34:32,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2019-09-10 07:34:32,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 916. [2019-09-10 07:34:32,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-09-10 07:34:32,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1231 transitions. [2019-09-10 07:34:32,277 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1231 transitions. Word has length 82 [2019-09-10 07:34:32,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:34:32,278 INFO L475 AbstractCegarLoop]: Abstraction has 916 states and 1231 transitions. [2019-09-10 07:34:32,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:34:32,278 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1231 transitions. [2019-09-10 07:34:32,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:34:32,279 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:34:32,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, 1, 1, 1, 1, 1] [2019-09-10 07:34:32,279 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:34:32,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:32,280 INFO L82 PathProgramCache]: Analyzing trace with hash -205212407, now seen corresponding path program 1 times [2019-09-10 07:34:32,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:34:32,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:32,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:32,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:32,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:34:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:32,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:32,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:34:32,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:34:32,340 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:34:32,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:34:32,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:34:32,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:34:32,341 INFO L87 Difference]: Start difference. First operand 916 states and 1231 transitions. Second operand 3 states. [2019-09-10 07:34:32,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:34:32,361 INFO L93 Difference]: Finished difference Result 1266 states and 1670 transitions. [2019-09-10 07:34:32,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:34:32,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-10 07:34:32,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:34:32,367 INFO L225 Difference]: With dead ends: 1266 [2019-09-10 07:34:32,367 INFO L226 Difference]: Without dead ends: 1266 [2019-09-10 07:34:32,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:34:32,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2019-09-10 07:34:32,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 1150. [2019-09-10 07:34:32,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1150 states. [2019-09-10 07:34:32,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1531 transitions. [2019-09-10 07:34:32,390 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1531 transitions. Word has length 83 [2019-09-10 07:34:32,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:34:32,390 INFO L475 AbstractCegarLoop]: Abstraction has 1150 states and 1531 transitions. [2019-09-10 07:34:32,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:34:32,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1531 transitions. [2019-09-10 07:34:32,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:34:32,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:34:32,392 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:34:32,392 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:34:32,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:32,392 INFO L82 PathProgramCache]: Analyzing trace with hash 469836024, now seen corresponding path program 1 times [2019-09-10 07:34:32,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:34:32,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:32,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:32,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:32,394 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:34:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:32,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:32,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:34:32,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:34:32,480 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:34:32,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:34:32,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:34:32,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:34:32,481 INFO L87 Difference]: Start difference. First operand 1150 states and 1531 transitions. Second operand 5 states. [2019-09-10 07:34:32,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:34:32,520 INFO L93 Difference]: Finished difference Result 1883 states and 2504 transitions. [2019-09-10 07:34:32,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:34:32,520 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-09-10 07:34:32,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:34:32,526 INFO L225 Difference]: With dead ends: 1883 [2019-09-10 07:34:32,526 INFO L226 Difference]: Without dead ends: 1883 [2019-09-10 07:34:32,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:34:32,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2019-09-10 07:34:32,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1879. [2019-09-10 07:34:32,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1879 states. [2019-09-10 07:34:32,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 2502 transitions. [2019-09-10 07:34:32,559 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 2502 transitions. Word has length 84 [2019-09-10 07:34:32,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:34:32,559 INFO L475 AbstractCegarLoop]: Abstraction has 1879 states and 2502 transitions. [2019-09-10 07:34:32,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:34:32,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 2502 transitions. [2019-09-10 07:34:32,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:34:32,560 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:34:32,560 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:34:32,561 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:34:32,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:32,561 INFO L82 PathProgramCache]: Analyzing trace with hash 2066603833, now seen corresponding path program 1 times [2019-09-10 07:34:32,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:34:32,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:32,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:32,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:32,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:34:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:32,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:32,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:34:32,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:34:32,638 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:34:32,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:34:32,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:34:32,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:34:32,640 INFO L87 Difference]: Start difference. First operand 1879 states and 2502 transitions. Second operand 6 states. [2019-09-10 07:34:32,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:34:32,707 INFO L93 Difference]: Finished difference Result 2584 states and 3406 transitions. [2019-09-10 07:34:32,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:34:32,708 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-09-10 07:34:32,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:34:32,718 INFO L225 Difference]: With dead ends: 2584 [2019-09-10 07:34:32,719 INFO L226 Difference]: Without dead ends: 2584 [2019-09-10 07:34:32,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:34:32,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2584 states. [2019-09-10 07:34:32,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2584 to 1897. [2019-09-10 07:34:32,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1897 states. [2019-09-10 07:34:32,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 2510 transitions. [2019-09-10 07:34:32,759 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 2510 transitions. Word has length 84 [2019-09-10 07:34:32,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:34:32,759 INFO L475 AbstractCegarLoop]: Abstraction has 1897 states and 2510 transitions. [2019-09-10 07:34:32,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:34:32,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 2510 transitions. [2019-09-10 07:34:32,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 07:34:32,761 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:34:32,761 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:34:32,762 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:34:32,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:32,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1575114626, now seen corresponding path program 1 times [2019-09-10 07:34:32,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:34:32,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:32,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:32,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:32,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:34:32,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:32,904 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 07:34:32,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:34:32,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:34:32,905 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:34:32,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:34:32,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:34:32,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:34:32,906 INFO L87 Difference]: Start difference. First operand 1897 states and 2510 transitions. Second operand 5 states. [2019-09-10 07:34:32,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:34:32,984 INFO L93 Difference]: Finished difference Result 3130 states and 4123 transitions. [2019-09-10 07:34:32,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:34:32,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-10 07:34:32,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:34:32,998 INFO L225 Difference]: With dead ends: 3130 [2019-09-10 07:34:32,998 INFO L226 Difference]: Without dead ends: 3130 [2019-09-10 07:34:33,000 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 07:34:33,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3130 states. [2019-09-10 07:34:33,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3130 to 2502. [2019-09-10 07:34:33,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2502 states. [2019-09-10 07:34:33,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2502 states to 2502 states and 3319 transitions. [2019-09-10 07:34:33,056 INFO L78 Accepts]: Start accepts. Automaton has 2502 states and 3319 transitions. Word has length 105 [2019-09-10 07:34:33,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:34:33,057 INFO L475 AbstractCegarLoop]: Abstraction has 2502 states and 3319 transitions. [2019-09-10 07:34:33,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:34:33,057 INFO L276 IsEmpty]: Start isEmpty. Operand 2502 states and 3319 transitions. [2019-09-10 07:34:33,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 07:34:33,059 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:34:33,061 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:34:33,061 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:34:33,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:33,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1268065406, now seen corresponding path program 1 times [2019-09-10 07:34:33,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:34:33,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:33,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:33,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:33,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:34:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:33,125 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:33,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:34:33,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:34:33,125 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:34:33,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:34:33,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:34:33,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:34:33,126 INFO L87 Difference]: Start difference. First operand 2502 states and 3319 transitions. Second operand 3 states. [2019-09-10 07:34:33,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:34:33,149 INFO L93 Difference]: Finished difference Result 2781 states and 3651 transitions. [2019-09-10 07:34:33,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:34:33,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-10 07:34:33,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:34:33,160 INFO L225 Difference]: With dead ends: 2781 [2019-09-10 07:34:33,160 INFO L226 Difference]: Without dead ends: 2781 [2019-09-10 07:34:33,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:34:33,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2781 states. [2019-09-10 07:34:33,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2781 to 2711. [2019-09-10 07:34:33,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2711 states. [2019-09-10 07:34:33,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 3565 transitions. [2019-09-10 07:34:33,204 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 3565 transitions. Word has length 105 [2019-09-10 07:34:33,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:34:33,205 INFO L475 AbstractCegarLoop]: Abstraction has 2711 states and 3565 transitions. [2019-09-10 07:34:33,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:34:33,205 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 3565 transitions. [2019-09-10 07:34:33,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:34:33,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:34:33,206 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:34:33,207 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:34:33,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:33,207 INFO L82 PathProgramCache]: Analyzing trace with hash -602099539, now seen corresponding path program 1 times [2019-09-10 07:34:33,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:34:33,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:33,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:33,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:33,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:34:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:33,293 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 07:34:33,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:34:33,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:34:33,293 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:34:33,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:34:33,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:34:33,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:34:33,294 INFO L87 Difference]: Start difference. First operand 2711 states and 3565 transitions. Second operand 5 states. [2019-09-10 07:34:33,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:34:33,382 INFO L93 Difference]: Finished difference Result 6638 states and 8680 transitions. [2019-09-10 07:34:33,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:34:33,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-09-10 07:34:33,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:34:33,408 INFO L225 Difference]: With dead ends: 6638 [2019-09-10 07:34:33,408 INFO L226 Difference]: Without dead ends: 6638 [2019-09-10 07:34:33,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:34:33,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6638 states. [2019-09-10 07:34:33,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6638 to 4005. [2019-09-10 07:34:33,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4005 states. [2019-09-10 07:34:33,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4005 states to 4005 states and 5249 transitions. [2019-09-10 07:34:33,485 INFO L78 Accepts]: Start accepts. Automaton has 4005 states and 5249 transitions. Word has length 106 [2019-09-10 07:34:33,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:34:33,486 INFO L475 AbstractCegarLoop]: Abstraction has 4005 states and 5249 transitions. [2019-09-10 07:34:33,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:34:33,486 INFO L276 IsEmpty]: Start isEmpty. Operand 4005 states and 5249 transitions. [2019-09-10 07:34:33,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:34:33,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:34:33,488 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:34:33,488 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:34:33,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:33,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1626402477, now seen corresponding path program 1 times [2019-09-10 07:34:33,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:34:33,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:33,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:33,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:33,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:34:33,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:33,727 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:33,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:34:33,727 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:34:33,728 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 107 with the following transitions: [2019-09-10 07:34:33,730 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [104], [107], [110], [113], [152], [155], [156], [158], [180], [184], [221], [224], [227], [230], [271], [275], [562], [626], [629], [663], [665], [819], [822], [826], [829], [832], [836], [838], [841], [844], [847], [852], [855], [861], [863], [866], [881], [883], [885], [888], [903], [905], [907], [910], [915], [918], [922], [935], [937], [939], [942], [945], [953], [955], [958], [961], [969], [971], [974], [977], [985], [1017], [1018], [1022], [1023], [1024] [2019-09-10 07:34:33,770 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:34:33,770 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:34:33,885 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:34:34,409 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:34:34,412 INFO L272 AbstractInterpreter]: Visited 99 different actions 445 times. Merged at 39 different actions 303 times. Widened at 16 different actions 56 times. Performed 1760 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1760 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 34 fixpoints after 13 different actions. Largest state had 173 variables. [2019-09-10 07:34:34,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:34,418 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:34:34,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:34:34,419 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:34:34,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:34,439 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:34:34,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:34,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 07:34:34,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:34:34,744 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 07:34:34,745 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:34:34,864 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 07:34:34,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 07:34:34,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12, 5] total 17 [2019-09-10 07:34:34,875 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:34:34,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:34:34,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:34:34,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:34:34,876 INFO L87 Difference]: Start difference. First operand 4005 states and 5249 transitions. Second operand 5 states. [2019-09-10 07:34:34,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:34:34,954 INFO L93 Difference]: Finished difference Result 7948 states and 10391 transitions. [2019-09-10 07:34:34,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:34:34,955 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-09-10 07:34:34,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:34:34,970 INFO L225 Difference]: With dead ends: 7948 [2019-09-10 07:34:34,970 INFO L226 Difference]: Without dead ends: 7948 [2019-09-10 07:34:34,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 207 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:34:34,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7948 states. [2019-09-10 07:34:35,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7948 to 5587. [2019-09-10 07:34:35,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5587 states. [2019-09-10 07:34:35,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5587 states to 5587 states and 7286 transitions. [2019-09-10 07:34:35,065 INFO L78 Accepts]: Start accepts. Automaton has 5587 states and 7286 transitions. Word has length 106 [2019-09-10 07:34:35,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:34:35,065 INFO L475 AbstractCegarLoop]: Abstraction has 5587 states and 7286 transitions. [2019-09-10 07:34:35,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:34:35,066 INFO L276 IsEmpty]: Start isEmpty. Operand 5587 states and 7286 transitions. [2019-09-10 07:34:35,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 07:34:35,067 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:34:35,068 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:34:35,068 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:34:35,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:35,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1691078651, now seen corresponding path program 1 times [2019-09-10 07:34:35,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:34:35,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:35,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:35,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:35,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:34:35,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:35,225 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-10 07:34:35,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:34:35,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:34:35,225 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:34:35,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:34:35,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:34:35,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:34:35,229 INFO L87 Difference]: Start difference. First operand 5587 states and 7286 transitions. Second operand 9 states. [2019-09-10 07:34:35,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:34:35,724 INFO L93 Difference]: Finished difference Result 11380 states and 14774 transitions. [2019-09-10 07:34:35,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 07:34:35,724 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 108 [2019-09-10 07:34:35,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:34:35,745 INFO L225 Difference]: With dead ends: 11380 [2019-09-10 07:34:35,745 INFO L226 Difference]: Without dead ends: 11380 [2019-09-10 07:34:35,749 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 07:34:35,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11380 states. [2019-09-10 07:34:35,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11380 to 5587. [2019-09-10 07:34:35,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5587 states. [2019-09-10 07:34:35,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5587 states to 5587 states and 7285 transitions. [2019-09-10 07:34:35,867 INFO L78 Accepts]: Start accepts. Automaton has 5587 states and 7285 transitions. Word has length 108 [2019-09-10 07:34:35,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:34:35,867 INFO L475 AbstractCegarLoop]: Abstraction has 5587 states and 7285 transitions. [2019-09-10 07:34:35,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:34:35,867 INFO L276 IsEmpty]: Start isEmpty. Operand 5587 states and 7285 transitions. [2019-09-10 07:34:35,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 07:34:35,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:34:35,869 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:34:35,869 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:34:35,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:35,870 INFO L82 PathProgramCache]: Analyzing trace with hash -519527990, now seen corresponding path program 1 times [2019-09-10 07:34:35,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:34:35,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:35,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:35,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:35,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:34:35,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:36,189 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:36,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:34:36,190 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:34:36,190 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2019-09-10 07:34:36,191 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [104], [107], [110], [113], [152], [155], [156], [158], [180], [184], [221], [224], [227], [230], [271], [275], [562], [626], [629], [632], [635], [661], [665], [819], [822], [826], [829], [832], [836], [838], [841], [844], [859], [861], [863], [866], [881], [883], [885], [888], [891], [896], [899], [905], [907], [910], [915], [918], [922], [932], [937], [939], [942], [945], [953], [955], [958], [961], [969], [971], [974], [977], [985], [1017], [1018], [1022], [1023], [1024] [2019-09-10 07:34:36,200 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:34:36,200 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:34:36,242 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:34:36,592 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:34:36,593 INFO L272 AbstractInterpreter]: Visited 101 different actions 471 times. Merged at 39 different actions 322 times. Widened at 16 different actions 44 times. Performed 1804 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1804 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 34 fixpoints after 14 different actions. Largest state had 173 variables. [2019-09-10 07:34:36,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:36,593 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:34:36,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:34:36,593 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:34:36,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:36,609 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:34:36,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:36,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 983 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 07:34:36,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:34:37,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:37,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:37,420 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:37,420 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:34:37,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:37,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:37,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:37,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:37,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:37,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:37,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:37,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:37,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:37,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:37,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:37,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:37,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:37,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:37,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:37,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:37,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:37,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:37,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:37,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:37,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:37,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:37,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:37,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:37,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:37,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:37,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:37,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:37,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:37,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:37,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:37,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:37,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:37,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:37,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:37,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:39,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:39,840 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:39,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:34:39,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2019-09-10 07:34:39,845 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:34:39,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:34:39,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:34:39,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:34:39,846 INFO L87 Difference]: Start difference. First operand 5587 states and 7285 transitions. Second operand 18 states. [2019-09-10 07:34:40,320 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-09-10 07:34:40,484 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-10 07:34:40,796 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2019-09-10 07:34:41,082 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-09-10 07:34:41,264 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-09-10 07:34:41,769 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2019-09-10 07:34:41,944 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-09-10 07:34:42,161 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 07:34:42,601 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-10 07:34:42,904 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 07:34:43,228 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-09-10 07:34:43,471 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 07:34:43,861 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-09-10 07:34:44,109 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 07:34:44,305 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-09-10 07:34:44,651 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 07:34:44,817 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-09-10 07:34:45,026 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-09-10 07:34:45,495 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-09-10 07:34:46,368 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-09-10 07:34:46,717 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-09-10 07:34:46,948 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2019-09-10 07:34:47,398 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-09-10 07:34:47,589 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 07:34:47,812 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2019-09-10 07:34:48,175 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 07:34:48,426 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-10 07:34:48,674 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-10 07:34:48,932 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 07:34:49,492 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-10 07:34:49,787 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2019-09-10 07:34:50,166 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-09-10 07:34:50,514 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 07:34:50,937 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-10 07:34:51,176 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-09-10 07:34:51,415 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 07:34:51,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:34:51,497 INFO L93 Difference]: Finished difference Result 29884 states and 38302 transitions. [2019-09-10 07:34:51,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-10 07:34:51,497 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 110 [2019-09-10 07:34:51,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:34:51,550 INFO L225 Difference]: With dead ends: 29884 [2019-09-10 07:34:51,551 INFO L226 Difference]: Without dead ends: 29884 [2019-09-10 07:34:51,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 182 SyntacticMatches, 27 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1565 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=1138, Invalid=3832, Unknown=0, NotChecked=0, Total=4970 [2019-09-10 07:34:51,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29884 states. [2019-09-10 07:34:51,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29884 to 13727. [2019-09-10 07:34:51,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13727 states. [2019-09-10 07:34:51,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13727 states to 13727 states and 17862 transitions. [2019-09-10 07:34:51,882 INFO L78 Accepts]: Start accepts. Automaton has 13727 states and 17862 transitions. Word has length 110 [2019-09-10 07:34:51,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:34:51,882 INFO L475 AbstractCegarLoop]: Abstraction has 13727 states and 17862 transitions. [2019-09-10 07:34:51,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:34:51,883 INFO L276 IsEmpty]: Start isEmpty. Operand 13727 states and 17862 transitions. [2019-09-10 07:34:51,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 07:34:51,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:34:51,886 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:34:51,886 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:34:51,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:51,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1775525834, now seen corresponding path program 1 times [2019-09-10 07:34:51,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:34:51,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:51,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:51,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:51,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:34:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:52,161 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:52,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:34:52,161 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:34:52,161 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2019-09-10 07:34:52,163 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [104], [107], [110], [113], [152], [155], [156], [158], [180], [184], [221], [224], [227], [230], [271], [275], [562], [626], [629], [632], [635], [661], [665], [819], [822], [826], [829], [832], [836], [838], [841], [844], [859], [861], [863], [866], [869], [874], [877], [883], [885], [888], [903], [905], [907], [910], [915], [918], [922], [932], [937], [939], [942], [945], [953], [955], [958], [961], [969], [971], [974], [977], [985], [1017], [1018], [1022], [1023], [1024] [2019-09-10 07:34:52,171 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:34:52,171 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:34:52,199 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:34:52,601 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:34:52,602 INFO L272 AbstractInterpreter]: Visited 101 different actions 558 times. Merged at 39 different actions 401 times. Widened at 16 different actions 71 times. Performed 2154 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2154 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 46 fixpoints after 13 different actions. Largest state had 173 variables. [2019-09-10 07:34:52,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:52,603 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:34:52,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:34:52,603 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 07:34:52,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:52,623 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 07:34:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:52,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 983 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 07:34:52,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:34:52,932 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-09-10 07:34:53,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:53,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:53,418 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:53,419 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:34:53,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:53,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:53,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:53,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:53,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:53,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:53,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:53,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:53,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:53,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:53,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:53,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:53,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:53,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:53,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:53,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:53,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:53,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:53,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:53,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:53,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:53,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:53,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:54,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:34:54,619 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:54,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:34:54,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2019-09-10 07:34:54,632 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:34:54,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:34:54,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:34:54,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=831, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:34:54,634 INFO L87 Difference]: Start difference. First operand 13727 states and 17862 transitions. Second operand 21 states. [2019-09-10 07:34:54,799 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 07:34:55,306 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 07:34:55,881 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 07:34:56,087 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-09-10 07:34:56,331 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:34:56,538 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:34:56,794 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 07:34:57,205 WARN L188 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:34:58,140 WARN L188 SmtUtils]: Spent 640.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-10 07:34:58,558 WARN L188 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 07:34:58,862 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-10 07:34:59,275 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2019-09-10 07:34:59,698 WARN L188 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:35:00,322 WARN L188 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:35:00,876 WARN L188 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-09-10 07:35:01,177 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 07:35:01,813 WARN L188 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-09-10 07:35:02,380 WARN L188 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-09-10 07:35:02,653 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 07:35:02,910 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 07:35:03,270 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-09-10 07:35:03,695 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-10 07:35:04,051 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 07:35:04,555 WARN L188 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-10 07:35:04,841 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-10 07:35:05,205 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-09-10 07:35:05,472 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 07:35:05,930 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-09-10 07:35:06,267 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-10 07:35:06,540 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 07:35:07,147 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-09-10 07:35:07,573 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-09-10 07:35:07,844 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 07:35:08,171 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:35:08,873 WARN L188 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-09-10 07:35:09,228 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-09-10 07:35:09,569 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-09-10 07:35:09,948 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-09-10 07:35:10,346 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-10 07:35:10,715 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 07:35:11,057 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-09-10 07:35:11,657 WARN L188 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:35:12,071 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-09-10 07:35:12,516 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-09-10 07:35:12,880 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-09-10 07:35:13,431 WARN L188 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-09-10 07:35:13,762 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-09-10 07:35:14,150 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-09-10 07:35:14,457 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-09-10 07:35:14,956 WARN L188 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-10 07:35:15,412 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 07:35:15,715 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 07:35:16,179 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-09-10 07:35:16,548 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-09-10 07:35:16,927 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-09-10 07:35:17,231 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-09-10 07:35:17,602 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-09-10 07:35:17,947 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-09-10 07:35:18,277 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-09-10 07:35:18,762 WARN L188 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-09-10 07:35:19,179 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-09-10 07:35:19,580 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-09-10 07:35:20,021 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-10 07:35:20,344 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-09-10 07:35:20,718 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-09-10 07:35:21,027 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-09-10 07:35:21,373 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-09-10 07:35:21,882 WARN L188 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-09-10 07:35:22,298 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-09-10 07:35:22,796 WARN L188 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2019-09-10 07:35:23,186 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-10 07:35:23,661 WARN L188 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-09-10 07:35:24,044 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-09-10 07:35:24,406 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 07:35:24,792 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-09-10 07:35:25,150 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 07:35:25,519 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 07:35:25,770 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 07:35:26,601 WARN L188 SmtUtils]: Spent 746.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-09-10 07:35:26,854 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 07:35:27,300 WARN L188 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-09-10 07:35:27,695 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 07:35:27,977 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 07:35:28,392 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 07:35:28,738 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-09-10 07:35:29,107 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-09-10 07:35:29,450 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-09-10 07:35:29,828 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-09-10 07:35:30,279 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-09-10 07:35:30,662 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-09-10 07:35:30,953 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-10 07:35:31,250 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-10 07:35:31,600 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 07:35:31,924 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-09-10 07:35:32,263 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-09-10 07:35:32,693 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-09-10 07:35:32,966 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:35:33,358 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-09-10 07:35:33,800 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 90 [2019-09-10 07:35:34,129 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-09-10 07:35:34,672 WARN L188 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-09-10 07:35:35,142 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 90 [2019-09-10 07:35:35,444 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-09-10 07:35:37,807 WARN L188 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-09-10 07:35:38,320 WARN L188 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-09-10 07:35:38,958 WARN L188 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 07:35:39,235 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 07:35:39,705 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 07:35:40,103 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-09-10 07:35:40,693 WARN L188 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-09-10 07:35:41,209 WARN L188 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-09-10 07:35:41,725 WARN L188 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-10 07:35:42,061 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-09-10 07:35:42,872 WARN L188 SmtUtils]: Spent 724.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-09-10 07:35:43,226 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-09-10 07:35:43,691 WARN L188 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-09-10 07:35:44,141 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-09-10 07:35:44,744 WARN L188 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-09-10 07:35:45,187 WARN L188 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-09-10 07:35:45,658 WARN L188 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-10 07:35:46,139 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-09-10 07:35:46,442 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-09-10 07:35:46,859 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-09-10 07:35:47,166 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-09-10 07:35:47,684 WARN L188 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-09-10 07:35:48,211 WARN L188 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-09-10 07:35:48,694 WARN L188 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-09-10 07:35:49,429 WARN L188 SmtUtils]: Spent 657.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-09-10 07:35:50,364 WARN L188 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-09-10 07:35:50,925 WARN L188 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-09-10 07:35:51,454 WARN L188 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-09-10 07:35:51,737 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-09-10 07:35:52,101 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-09-10 07:35:52,512 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 07:35:52,847 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-10 07:35:53,223 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-09-10 07:35:53,554 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-09-10 07:35:53,863 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-09-10 07:35:54,136 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 07:35:54,431 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-09-10 07:35:54,878 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-09-10 07:35:55,307 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-09-10 07:35:55,717 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-09-10 07:35:56,008 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 07:35:56,569 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-09-10 07:35:57,522 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-10 07:35:57,977 WARN L188 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 07:35:58,336 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-10 07:35:58,762 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 07:35:59,086 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 07:35:59,396 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 07:35:59,776 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 07:36:00,161 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-09-10 07:36:00,524 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 07:36:01,176 WARN L188 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-09-10 07:36:01,619 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-09-10 07:36:02,010 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-10 07:36:02,309 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 07:36:03,086 WARN L188 SmtUtils]: Spent 686.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 07:36:03,406 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 07:36:03,738 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-09-10 07:36:04,149 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 07:36:04,491 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 07:36:04,744 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 07:36:05,367 WARN L188 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-09-10 07:36:05,823 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-09-10 07:36:06,590 WARN L188 SmtUtils]: Spent 633.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-09-10 07:36:06,978 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 07:36:07,304 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:36:07,720 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-10 07:36:08,203 WARN L188 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 07:36:08,650 WARN L188 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-09-10 07:36:09,005 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 07:36:09,280 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:36:09,585 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-10 07:36:10,097 WARN L188 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-10 07:36:10,726 WARN L188 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-09-10 07:36:11,105 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-10 07:36:11,581 WARN L188 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-09-10 07:36:12,295 WARN L188 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-10 07:36:12,741 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 07:36:13,327 WARN L188 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 07:36:13,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:36:13,619 INFO L93 Difference]: Finished difference Result 219019 states and 275530 transitions. [2019-09-10 07:36:13,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2019-09-10 07:36:13,620 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 110 [2019-09-10 07:36:13,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:36:14,152 INFO L225 Difference]: With dead ends: 219019 [2019-09-10 07:36:14,152 INFO L226 Difference]: Without dead ends: 219019 [2019-09-10 07:36:14,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 188 SyntacticMatches, 14 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16683 ImplicationChecksByTransitivity, 74.6s TimeCoverageRelationStatistics Valid=7938, Invalid=38502, Unknown=0, NotChecked=0, Total=46440 [2019-09-10 07:36:14,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219019 states. [2019-09-10 07:36:17,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219019 to 71767. [2019-09-10 07:36:17,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71767 states. [2019-09-10 07:36:17,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71767 states to 71767 states and 92878 transitions. [2019-09-10 07:36:17,405 INFO L78 Accepts]: Start accepts. Automaton has 71767 states and 92878 transitions. Word has length 110 [2019-09-10 07:36:17,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:36:17,406 INFO L475 AbstractCegarLoop]: Abstraction has 71767 states and 92878 transitions. [2019-09-10 07:36:17,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:36:17,406 INFO L276 IsEmpty]: Start isEmpty. Operand 71767 states and 92878 transitions. [2019-09-10 07:36:17,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 07:36:17,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:36:17,416 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] [2019-09-10 07:36:17,417 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:36:17,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:36:17,417 INFO L82 PathProgramCache]: Analyzing trace with hash 343502542, now seen corresponding path program 1 times [2019-09-10 07:36:17,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:36:17,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:36:17,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:36:17,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:36:17,419 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:36:17,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:36:17,484 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:36:17,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:36:17,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:36:17,485 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:36:17,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:36:17,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:36:17,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:36:17,486 INFO L87 Difference]: Start difference. First operand 71767 states and 92878 transitions. Second operand 3 states. [2019-09-10 07:36:17,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:36:17,612 INFO L93 Difference]: Finished difference Result 46685 states and 57959 transitions. [2019-09-10 07:36:17,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:36:17,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-10 07:36:17,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:36:17,711 INFO L225 Difference]: With dead ends: 46685 [2019-09-10 07:36:17,711 INFO L226 Difference]: Without dead ends: 46685 [2019-09-10 07:36:17,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:36:17,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46685 states. [2019-09-10 07:36:19,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46685 to 43534. [2019-09-10 07:36:19,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43534 states. [2019-09-10 07:36:19,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43534 states to 43534 states and 54494 transitions. [2019-09-10 07:36:19,545 INFO L78 Accepts]: Start accepts. Automaton has 43534 states and 54494 transitions. Word has length 111 [2019-09-10 07:36:19,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:36:19,545 INFO L475 AbstractCegarLoop]: Abstraction has 43534 states and 54494 transitions. [2019-09-10 07:36:19,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:36:19,545 INFO L276 IsEmpty]: Start isEmpty. Operand 43534 states and 54494 transitions. [2019-09-10 07:36:19,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 07:36:19,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:36:19,552 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:36:19,553 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:36:19,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:36:19,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1871750063, now seen corresponding path program 1 times [2019-09-10 07:36:19,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:36:19,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:36:19,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:36:19,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:36:19,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:36:19,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:36:19,943 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:36:19,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:36:19,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:36:19,944 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 112 with the following transitions: [2019-09-10 07:36:19,944 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [104], [107], [110], [113], [152], [155], [156], [158], [180], [184], [221], [224], [227], [230], [271], [275], [562], [626], [629], [632], [635], [661], [665], [819], [822], [826], [829], [832], [836], [838], [841], [844], [847], [850], [861], [863], [866], [869], [874], [877], [883], [885], [888], [891], [896], [899], [905], [907], [910], [915], [918], [922], [935], [937], [939], [942], [945], [953], [955], [958], [961], [969], [971], [974], [977], [985], [1017], [1018], [1022], [1023], [1024] [2019-09-10 07:36:19,948 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:36:19,948 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:36:19,972 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:36:20,288 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:36:20,288 INFO L272 AbstractInterpreter]: Visited 104 different actions 497 times. Merged at 42 different actions 351 times. Widened at 12 different actions 43 times. Performed 1860 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1860 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 37 fixpoints after 10 different actions. Largest state had 173 variables. [2019-09-10 07:36:20,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:36:20,289 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:36:20,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:36:20,289 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 07:36:20,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:36:20,304 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 07:36:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:36:20,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-10 07:36:20,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:36:20,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:21,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:21,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:21,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:21,979 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:36:21,979 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:36:22,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:22,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:22,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:22,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:22,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:22,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:22,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:22,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:23,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:23,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:23,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:23,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 07:36:23,684 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:36:23,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:36:23,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 16] total 44 [2019-09-10 07:36:23,688 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:36:23,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-10 07:36:23,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-10 07:36:23,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1758, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 07:36:23,689 INFO L87 Difference]: Start difference. First operand 43534 states and 54494 transitions. Second operand 30 states. [2019-09-10 07:36:23,888 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 07:36:33,110 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 07:36:41,151 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-10 07:36:45,376 WARN L188 SmtUtils]: Spent 934.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 07:36:50,213 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 07:36:51,376 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 07:36:54,154 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-09-10 07:37:19,843 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 07:37:21,586 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-10 07:37:32,548 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 07:37:52,489 WARN L188 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-10 07:37:57,448 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-10 07:38:04,446 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 07:38:11,273 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 07:38:23,071 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-10 07:38:24,880 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 26 [2019-09-10 07:38:31,999 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-10 07:38:39,159 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 07:38:46,519 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-09-10 07:38:50,986 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-10 07:39:04,211 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 07:39:18,707 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-10 07:39:24,370 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 07:39:32,831 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 07:39:35,072 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 07:39:49,560 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 07:39:56,647 WARN L188 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 62 [2019-09-10 07:39:59,454 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-09-10 07:40:05,426 WARN L188 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-10 07:40:08,298 WARN L188 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 07:40:08,738 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-09-10 07:40:09,460 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 07:40:14,007 WARN L188 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 07:40:16,730 WARN L188 SmtUtils]: Spent 865.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-09-10 07:40:20,043 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-09-10 07:40:24,608 WARN L188 SmtUtils]: Spent 771.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-10 07:40:26,037 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-10 07:40:32,551 WARN L188 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 07:40:42,981 WARN L188 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-10 07:40:45,724 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-10 07:40:46,644 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 07:40:52,671 WARN L188 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 07:41:23,814 WARN L188 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-09-10 07:41:27,349 WARN L188 SmtUtils]: Spent 993.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-10 07:41:30,504 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-10 07:41:40,091 WARN L188 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-10 07:41:41,221 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 07:41:46,376 WARN L188 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-10 07:41:47,729 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-10 07:42:03,890 WARN L188 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 07:42:13,099 WARN L188 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 07:42:19,459 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-10 07:42:24,762 WARN L188 SmtUtils]: Spent 713.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-10 07:42:51,569 WARN L188 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-10 07:42:53,700 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-10 07:43:04,401 WARN L188 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-10 07:43:08,811 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 07:43:14,077 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-10 07:43:27,279 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-09-10 07:43:33,046 WARN L188 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 07:43:39,786 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-09-10 07:43:45,710 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-09-10 07:43:54,901 WARN L188 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-10 07:44:02,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:02,172 INFO L93 Difference]: Finished difference Result 183110 states and 225654 transitions. [2019-09-10 07:44:02,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2019-09-10 07:44:02,173 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 111 [2019-09-10 07:44:02,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:02,439 INFO L225 Difference]: With dead ends: 183110 [2019-09-10 07:44:02,439 INFO L226 Difference]: Without dead ends: 183110 [2019-09-10 07:44:02,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 183 SyntacticMatches, 13 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24239 ImplicationChecksByTransitivity, 221.2s TimeCoverageRelationStatistics Valid=7335, Invalid=60005, Unknown=0, NotChecked=0, Total=67340 [2019-09-10 07:44:02,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183110 states. [2019-09-10 07:44:03,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183110 to 65109. [2019-09-10 07:44:03,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65109 states. [2019-09-10 07:44:03,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65109 states to 65109 states and 81773 transitions. [2019-09-10 07:44:03,884 INFO L78 Accepts]: Start accepts. Automaton has 65109 states and 81773 transitions. Word has length 111 [2019-09-10 07:44:03,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:03,884 INFO L475 AbstractCegarLoop]: Abstraction has 65109 states and 81773 transitions. [2019-09-10 07:44:03,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-10 07:44:03,884 INFO L276 IsEmpty]: Start isEmpty. Operand 65109 states and 81773 transitions. [2019-09-10 07:44:03,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 07:44:03,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:03,893 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:44:03,893 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:03,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:03,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1847771136, now seen corresponding path program 1 times [2019-09-10 07:44:03,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:03,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:03,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:03,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:03,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:03,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:04,172 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:04,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:44:04,173 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:44:04,173 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 112 with the following transitions: [2019-09-10 07:44:04,173 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [104], [107], [110], [113], [152], [155], [156], [158], [180], [184], [221], [224], [227], [232], [269], [271], [275], [562], [626], [629], [632], [635], [661], [665], [819], [822], [826], [829], [832], [836], [838], [841], [844], [847], [852], [855], [861], [863], [866], [869], [874], [877], [883], [885], [888], [903], [905], [907], [910], [915], [918], [922], [935], [937], [939], [942], [945], [953], [955], [958], [961], [969], [971], [974], [977], [985], [1017], [1018], [1022], [1023], [1024] [2019-09-10 07:44:04,176 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:44:04,176 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:44:04,201 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:44:04,567 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:44:04,567 INFO L272 AbstractInterpreter]: Visited 104 different actions 501 times. Merged at 41 different actions 352 times. Widened at 14 different actions 53 times. Performed 1928 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1928 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 39 fixpoints after 10 different actions. Largest state had 173 variables. [2019-09-10 07:44:04,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:04,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:44:04,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:44:04,568 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:44:04,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:04,599 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:44:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:04,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 984 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 07:44:04,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:44:04,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:04,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:04,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:04,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:05,160 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:05,160 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:44:05,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:05,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:05,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:05,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:05,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:07,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:07,963 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:07,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:44:07,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 31 [2019-09-10 07:44:07,976 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:44:07,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:44:07,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:44:07,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=820, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:44:07,977 INFO L87 Difference]: Start difference. First operand 65109 states and 81773 transitions. Second operand 21 states. [2019-09-10 07:44:09,924 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 31 [2019-09-10 07:44:11,947 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2019-09-10 07:44:13,285 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 35 [2019-09-10 07:44:13,517 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 33 [2019-09-10 07:44:13,961 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 33 [2019-09-10 07:44:14,676 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 34 [2019-09-10 07:44:15,226 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2019-09-10 07:44:16,151 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 35 [2019-09-10 07:44:18,999 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 37 [2019-09-10 07:44:19,422 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 32 [2019-09-10 07:44:20,483 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2019-09-10 07:44:23,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:23,762 INFO L93 Difference]: Finished difference Result 223992 states and 273915 transitions. [2019-09-10 07:44:23,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-09-10 07:44:23,763 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 111 [2019-09-10 07:44:23,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:24,015 INFO L225 Difference]: With dead ends: 223992 [2019-09-10 07:44:24,015 INFO L226 Difference]: Without dead ends: 223992 [2019-09-10 07:44:24,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 190 SyntacticMatches, 13 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7168 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=3918, Invalid=17838, Unknown=0, NotChecked=0, Total=21756 [2019-09-10 07:44:24,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223992 states. [2019-09-10 07:44:25,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223992 to 84897. [2019-09-10 07:44:25,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84897 states. [2019-09-10 07:44:25,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84897 states to 84897 states and 106489 transitions. [2019-09-10 07:44:25,989 INFO L78 Accepts]: Start accepts. Automaton has 84897 states and 106489 transitions. Word has length 111 [2019-09-10 07:44:25,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:25,989 INFO L475 AbstractCegarLoop]: Abstraction has 84897 states and 106489 transitions. [2019-09-10 07:44:25,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:44:25,989 INFO L276 IsEmpty]: Start isEmpty. Operand 84897 states and 106489 transitions. [2019-09-10 07:44:25,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 07:44:25,998 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:25,998 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:44:25,999 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:25,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:25,999 INFO L82 PathProgramCache]: Analyzing trace with hash 53662710, now seen corresponding path program 1 times [2019-09-10 07:44:25,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:26,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:26,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:26,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:26,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:26,323 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:26,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:44:26,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:44:26,324 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 113 with the following transitions: [2019-09-10 07:44:26,324 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [104], [107], [110], [113], [152], [155], [156], [158], [180], [184], [221], [224], [227], [230], [271], [275], [562], [626], [629], [632], [635], [661], [665], [819], [822], [826], [829], [832], [836], [838], [841], [844], [847], [852], [855], [861], [863], [866], [869], [872], [883], [885], [888], [891], [894], [905], [907], [910], [915], [918], [922], [932], [937], [939], [942], [945], [953], [955], [958], [961], [969], [971], [974], [977], [985], [1017], [1018], [1022], [1023], [1024] [2019-09-10 07:44:26,327 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:44:26,328 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:44:26,350 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:44:26,609 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:44:26,609 INFO L272 AbstractInterpreter]: Visited 103 different actions 402 times. Merged at 41 different actions 265 times. Widened at 11 different actions 25 times. Performed 1597 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1597 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 32 fixpoints after 10 different actions. Largest state had 173 variables. [2019-09-10 07:44:26,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:26,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:44:26,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:44:26,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:44:26,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:26,632 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:44:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:26,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-10 07:44:26,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:44:27,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:27,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:28,034 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:28,034 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:44:28,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:28,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:28,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:29,089 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:29,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:44:29,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 18] total 48 [2019-09-10 07:44:29,100 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:44:29,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-10 07:44:29,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-10 07:44:29,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2056, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 07:44:29,101 INFO L87 Difference]: Start difference. First operand 84897 states and 106489 transitions. Second operand 33 states. [2019-09-10 07:44:29,292 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-10 07:44:31,420 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2019-09-10 07:44:40,104 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-09-10 07:44:41,729 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-09-10 07:44:45,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:45,166 INFO L93 Difference]: Finished difference Result 272645 states and 340743 transitions. [2019-09-10 07:44:45,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-09-10 07:44:45,167 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 112 [2019-09-10 07:44:45,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:45,487 INFO L225 Difference]: With dead ends: 272645 [2019-09-10 07:44:45,487 INFO L226 Difference]: Without dead ends: 272645 [2019-09-10 07:44:45,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 190 SyntacticMatches, 3 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4220 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=1892, Invalid=13858, Unknown=0, NotChecked=0, Total=15750 [2019-09-10 07:44:45,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272645 states. [2019-09-10 07:44:47,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272645 to 77984. [2019-09-10 07:44:47,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77984 states. [2019-09-10 07:44:47,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77984 states to 77984 states and 97776 transitions. [2019-09-10 07:44:47,490 INFO L78 Accepts]: Start accepts. Automaton has 77984 states and 97776 transitions. Word has length 112 [2019-09-10 07:44:47,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:47,490 INFO L475 AbstractCegarLoop]: Abstraction has 77984 states and 97776 transitions. [2019-09-10 07:44:47,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-10 07:44:47,490 INFO L276 IsEmpty]: Start isEmpty. Operand 77984 states and 97776 transitions. [2019-09-10 07:44:47,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 07:44:47,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:47,497 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:44:47,497 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:47,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:47,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1976166411, now seen corresponding path program 1 times [2019-09-10 07:44:47,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:47,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:47,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:47,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:47,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:47,709 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:47,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:44:47,710 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:44:47,710 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 113 with the following transitions: [2019-09-10 07:44:47,710 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [104], [107], [110], [113], [152], [155], [156], [158], [180], [184], [221], [224], [227], [230], [271], [275], [562], [626], [629], [632], [637], [659], [661], [665], [819], [822], [826], [829], [832], [836], [838], [841], [844], [859], [861], [863], [866], [869], [872], [883], [885], [888], [891], [896], [899], [905], [907], [910], [915], [918], [922], [932], [937], [939], [942], [945], [953], [955], [958], [961], [969], [971], [974], [977], [985], [1017], [1018], [1022], [1023], [1024] [2019-09-10 07:44:47,712 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:44:47,712 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:44:47,735 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:44:48,000 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:44:48,001 INFO L272 AbstractInterpreter]: Visited 103 different actions 467 times. Merged at 40 different actions 321 times. Widened at 14 different actions 45 times. Performed 1805 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1805 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 37 fixpoints after 13 different actions. Largest state had 173 variables. [2019-09-10 07:44:48,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:48,002 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:44:48,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:44:48,002 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:44:48,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:48,022 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:44:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:48,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 984 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 07:44:48,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:44:48,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:48,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:48,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:48,393 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:48,393 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:44:48,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:48,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:48,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:48,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:48,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:49,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:49,805 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:49,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:44:49,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 27 [2019-09-10 07:44:49,811 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:44:49,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:44:49,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:44:49,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:44:49,812 INFO L87 Difference]: Start difference. First operand 77984 states and 97776 transitions. Second operand 18 states. [2019-09-10 07:44:56,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:56,624 INFO L93 Difference]: Finished difference Result 240584 states and 300165 transitions. [2019-09-10 07:44:56,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-10 07:44:56,624 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 112 [2019-09-10 07:44:56,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:56,856 INFO L225 Difference]: With dead ends: 240584 [2019-09-10 07:44:56,856 INFO L226 Difference]: Without dead ends: 240584 [2019-09-10 07:44:56,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 184 SyntacticMatches, 24 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3422 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1865, Invalid=7837, Unknown=0, NotChecked=0, Total=9702 [2019-09-10 07:44:56,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240584 states. [2019-09-10 07:44:58,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240584 to 103155. [2019-09-10 07:44:58,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103155 states. [2019-09-10 07:44:59,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103155 states to 103155 states and 128969 transitions. [2019-09-10 07:44:59,075 INFO L78 Accepts]: Start accepts. Automaton has 103155 states and 128969 transitions. Word has length 112 [2019-09-10 07:44:59,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:59,075 INFO L475 AbstractCegarLoop]: Abstraction has 103155 states and 128969 transitions. [2019-09-10 07:44:59,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:44:59,075 INFO L276 IsEmpty]: Start isEmpty. Operand 103155 states and 128969 transitions. [2019-09-10 07:44:59,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 07:44:59,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:59,080 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:44:59,081 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:59,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:59,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1324157844, now seen corresponding path program 1 times [2019-09-10 07:44:59,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:59,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:59,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:59,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:59,085 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:59,329 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:59,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:44:59,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:44:59,329 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 113 with the following transitions: [2019-09-10 07:44:59,330 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [104], [107], [110], [113], [152], [155], [156], [158], [180], [184], [221], [224], [227], [230], [271], [275], [562], [626], [629], [632], [637], [659], [661], [665], [819], [822], [826], [829], [832], [836], [838], [841], [844], [847], [852], [855], [861], [863], [866], [869], [872], [883], [885], [888], [891], [896], [899], [905], [907], [910], [915], [918], [922], [935], [937], [939], [942], [945], [953], [955], [958], [961], [969], [971], [974], [977], [985], [1017], [1018], [1022], [1023], [1024] [2019-09-10 07:44:59,333 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:44:59,333 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:44:59,354 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:44:59,605 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:44:59,605 INFO L272 AbstractInterpreter]: Visited 105 different actions 450 times. Merged at 42 different actions 308 times. Widened at 12 different actions 35 times. Performed 1747 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1747 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 32 fixpoints after 8 different actions. Largest state had 173 variables. [2019-09-10 07:44:59,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:59,605 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:44:59,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:44:59,606 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:44:59,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:59,624 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:44:59,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:59,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 07:44:59,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:44:59,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:59,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:59,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:00,015 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:00,016 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:45:00,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:00,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:00,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:00,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:00,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:00,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:00,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:00,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:00,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:00,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:00,325 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:00,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:45:00,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 28 [2019-09-10 07:45:00,329 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:45:00,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:45:00,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:45:00,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:45:00,330 INFO L87 Difference]: Start difference. First operand 103155 states and 128969 transitions. Second operand 20 states. [2019-09-10 07:45:02,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:45:02,990 INFO L93 Difference]: Finished difference Result 169418 states and 211412 transitions. [2019-09-10 07:45:02,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 07:45:02,990 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 112 [2019-09-10 07:45:02,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:45:03,159 INFO L225 Difference]: With dead ends: 169418 [2019-09-10 07:45:03,160 INFO L226 Difference]: Without dead ends: 169418 [2019-09-10 07:45:03,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 208 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=514, Invalid=1936, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 07:45:03,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169418 states. [2019-09-10 07:45:06,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169418 to 110376. [2019-09-10 07:45:06,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110376 states. [2019-09-10 07:45:06,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110376 states to 110376 states and 138230 transitions. [2019-09-10 07:45:06,780 INFO L78 Accepts]: Start accepts. Automaton has 110376 states and 138230 transitions. Word has length 112 [2019-09-10 07:45:06,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:45:06,780 INFO L475 AbstractCegarLoop]: Abstraction has 110376 states and 138230 transitions. [2019-09-10 07:45:06,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:45:06,781 INFO L276 IsEmpty]: Start isEmpty. Operand 110376 states and 138230 transitions. [2019-09-10 07:45:06,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 07:45:06,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:45:06,785 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:45:06,785 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:45:06,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:06,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1607271052, now seen corresponding path program 1 times [2019-09-10 07:45:06,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:45:06,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:06,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:06,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:06,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:45:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:07,372 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:07,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:45:07,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:45:07,372 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 113 with the following transitions: [2019-09-10 07:45:07,373 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [104], [107], [110], [113], [152], [155], [156], [158], [180], [184], [221], [224], [227], [232], [269], [271], [275], [562], [626], [629], [632], [635], [661], [665], [819], [822], [826], [829], [832], [836], [838], [841], [844], [847], [850], [861], [863], [866], [869], [874], [877], [883], [885], [888], [891], [896], [899], [905], [907], [910], [915], [918], [922], [935], [937], [939], [942], [945], [953], [955], [958], [961], [969], [971], [974], [977], [985], [1017], [1018], [1022], [1023], [1024] [2019-09-10 07:45:07,375 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:45:07,375 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:45:07,395 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:45:07,607 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:45:07,608 INFO L272 AbstractInterpreter]: Visited 105 different actions 383 times. Merged at 42 different actions 245 times. Widened at 10 different actions 24 times. Performed 1543 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1543 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 28 fixpoints after 10 different actions. Largest state had 173 variables. [2019-09-10 07:45:07,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:07,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:45:07,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:45:07,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:45:07,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:07,646 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:45:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:07,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 07:45:07,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:45:08,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:08,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:08,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:08,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:08,679 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:08,679 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:45:09,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:09,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:09,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:09,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:09,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:09,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:09,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:09,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:09,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:09,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:09,115 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:09,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:45:09,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11, 11] total 39 [2019-09-10 07:45:09,120 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:45:09,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-10 07:45:09,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-10 07:45:09,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1367, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 07:45:09,121 INFO L87 Difference]: Start difference. First operand 110376 states and 138230 transitions. Second operand 30 states. [2019-09-10 07:45:09,322 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-09-10 07:45:18,553 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-09-10 07:45:25,864 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 07:45:28,238 WARN L188 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-10 07:45:32,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:45:32,185 INFO L93 Difference]: Finished difference Result 251686 states and 312357 transitions. [2019-09-10 07:45:32,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2019-09-10 07:45:32,185 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 112 [2019-09-10 07:45:32,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:45:32,475 INFO L225 Difference]: With dead ends: 251686 [2019-09-10 07:45:32,476 INFO L226 Difference]: Without dead ends: 251686 [2019-09-10 07:45:32,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 205 SyntacticMatches, 2 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10845 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=3850, Invalid=28730, Unknown=0, NotChecked=0, Total=32580 [2019-09-10 07:45:32,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251686 states. [2019-09-10 07:45:34,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251686 to 132070. [2019-09-10 07:45:34,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132070 states. [2019-09-10 07:45:34,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132070 states to 132070 states and 165440 transitions. [2019-09-10 07:45:34,857 INFO L78 Accepts]: Start accepts. Automaton has 132070 states and 165440 transitions. Word has length 112 [2019-09-10 07:45:34,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:45:34,858 INFO L475 AbstractCegarLoop]: Abstraction has 132070 states and 165440 transitions. [2019-09-10 07:45:34,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-10 07:45:34,858 INFO L276 IsEmpty]: Start isEmpty. Operand 132070 states and 165440 transitions. [2019-09-10 07:45:34,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 07:45:34,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:45:34,865 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:45:34,866 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:45:34,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:34,866 INFO L82 PathProgramCache]: Analyzing trace with hash 100106068, now seen corresponding path program 1 times [2019-09-10 07:45:34,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:45:34,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:34,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:34,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:34,868 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:45:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:35,116 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:35,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:45:35,117 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:45:35,117 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 113 with the following transitions: [2019-09-10 07:45:35,118 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [104], [107], [110], [115], [152], [155], [156], [158], [178], [180], [184], [221], [224], [227], [230], [271], [275], [562], [626], [629], [632], [637], [659], [661], [665], [819], [822], [826], [829], [832], [836], [838], [841], [844], [847], [852], [855], [861], [863], [866], [881], [883], [885], [888], [891], [896], [899], [905], [907], [910], [915], [918], [922], [935], [937], [939], [942], [945], [953], [955], [958], [961], [969], [971], [974], [977], [985], [1017], [1018], [1022], [1023], [1024] [2019-09-10 07:45:35,120 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:45:35,120 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:45:35,140 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:45:35,375 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:45:35,375 INFO L272 AbstractInterpreter]: Visited 105 different actions 444 times. Merged at 41 different actions 300 times. Widened at 13 different actions 42 times. Performed 1748 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1748 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 31 fixpoints after 10 different actions. Largest state had 173 variables. [2019-09-10 07:45:35,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:35,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:45:35,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:45:35,376 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:45:35,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:35,401 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:45:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:35,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 983 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 07:45:35,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:45:35,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:35,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:35,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:35,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:35,911 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-09-10 07:45:35,946 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:35,946 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:45:36,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:36,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:36,315 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:36,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:45:36,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2019-09-10 07:45:36,326 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:45:36,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:45:36,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:45:36,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2019-09-10 07:45:36,327 INFO L87 Difference]: Start difference. First operand 132070 states and 165440 transitions. Second operand 18 states. [2019-09-10 07:45:37,394 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-09-10 07:45:37,633 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-09-10 07:45:37,869 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-09-10 07:45:38,220 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-09-10 07:45:38,627 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-09-10 07:45:39,504 WARN L188 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2019-09-10 07:45:39,893 WARN L188 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-09-10 07:45:40,162 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 07:45:40,955 WARN L188 SmtUtils]: Spent 746.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-09-10 07:45:41,825 WARN L188 SmtUtils]: Spent 794.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 75 [2019-09-10 07:45:41,996 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-09-10 07:45:42,508 WARN L188 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-10 07:45:42,779 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 07:45:43,024 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-09-10 07:45:43,880 WARN L188 SmtUtils]: Spent 799.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2019-09-10 07:45:44,591 WARN L188 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-09-10 07:45:45,677 WARN L188 SmtUtils]: Spent 987.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-10 07:45:46,614 WARN L188 SmtUtils]: Spent 653.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-09-10 07:45:47,036 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-10 07:45:47,212 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:45:47,349 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 07:45:47,840 WARN L188 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-09-10 07:45:48,674 WARN L188 SmtUtils]: Spent 745.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 79 [2019-09-10 07:45:49,010 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-10 07:45:49,153 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-10 07:45:49,362 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 07:45:49,864 WARN L188 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 07:45:50,741 WARN L188 SmtUtils]: Spent 812.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-09-10 07:45:51,376 WARN L188 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-09-10 07:45:51,662 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 07:45:52,853 WARN L188 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 99 DAG size of output: 79 [2019-09-10 07:45:53,618 WARN L188 SmtUtils]: Spent 662.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-10 07:45:54,082 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-10 07:45:54,474 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-09-10 07:45:55,777 WARN L188 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 96 DAG size of output: 77 [2019-09-10 07:45:56,106 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 07:45:56,990 WARN L188 SmtUtils]: Spent 823.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-09-10 07:45:57,241 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-09-10 07:45:58,417 WARN L188 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2019-09-10 07:45:59,370 WARN L188 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-09-10 07:46:00,112 WARN L188 SmtUtils]: Spent 657.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-10 07:46:01,027 WARN L188 SmtUtils]: Spent 859.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-09-10 07:46:01,214 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-09-10 07:46:02,157 WARN L188 SmtUtils]: Spent 893.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 07:46:03,060 WARN L188 SmtUtils]: Spent 711.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-09-10 07:46:04,015 WARN L188 SmtUtils]: Spent 900.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2019-09-10 07:46:04,881 WARN L188 SmtUtils]: Spent 793.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 79 [2019-09-10 07:46:05,119 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 07:46:05,580 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-09-10 07:46:05,956 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-10 07:46:07,002 WARN L188 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-09-10 07:46:07,751 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-09-10 07:46:08,042 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-09-10 07:46:08,353 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 75 [2019-09-10 07:46:09,121 WARN L188 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-09-10 07:46:09,478 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-09-10 07:46:09,791 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-09-10 07:46:10,595 WARN L188 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-09-10 07:46:10,995 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-09-10 07:46:11,162 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 07:46:12,162 WARN L188 SmtUtils]: Spent 942.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-09-10 07:46:12,803 WARN L188 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-09-10 07:46:13,647 WARN L188 SmtUtils]: Spent 763.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-10 07:46:14,561 WARN L188 SmtUtils]: Spent 844.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-10 07:46:16,095 WARN L188 SmtUtils]: Spent 761.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-09-10 07:46:16,610 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 07:46:16,773 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 07:46:17,519 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 07:46:17,738 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-10 07:46:17,921 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-09-10 07:46:18,177 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-10 07:46:18,325 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 07:46:18,803 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-10 07:46:19,074 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 07:46:19,233 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-10 07:46:19,738 WARN L188 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2019-09-10 07:46:20,168 WARN L188 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 07:46:20,323 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 07:46:20,851 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 07:46:21,122 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-09-10 07:46:21,397 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 07:46:21,676 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-09-10 07:46:21,868 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 07:46:23,559 WARN L188 SmtUtils]: Spent 1.53 s on a formula simplification that was a NOOP. DAG size: 39 [2019-09-10 07:46:23,796 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 07:46:24,170 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-10 07:46:24,544 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-09-10 07:46:24,899 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-10 07:46:25,087 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2019-09-10 07:46:25,359 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 07:46:25,906 WARN L188 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-10 07:46:26,489 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-10 07:46:27,752 WARN L188 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 92 DAG size of output: 76 [2019-09-10 07:46:29,483 WARN L188 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 96 DAG size of output: 76 [2019-09-10 07:46:29,950 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2019-09-10 07:46:30,580 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 07:46:31,170 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-09-10 07:46:32,331 WARN L188 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 98 DAG size of output: 81 [2019-09-10 07:46:32,880 WARN L188 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-10 07:46:33,668 WARN L188 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-10 07:46:34,016 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-10 07:46:34,733 WARN L188 SmtUtils]: Spent 639.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2019-09-10 07:46:35,231 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-09-10 07:46:35,888 WARN L188 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:46:36,593 WARN L188 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-09-10 07:46:36,991 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 07:46:37,452 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-10 07:46:37,928 WARN L188 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 07:46:38,278 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-10 07:46:38,619 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:46:39,149 WARN L188 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-09-10 07:46:39,576 WARN L188 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:46:40,262 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-09-10 07:46:41,202 WARN L188 SmtUtils]: Spent 867.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-10 07:46:41,580 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-10 07:46:41,859 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-10 07:46:43,773 WARN L188 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 102 DAG size of output: 82 [2019-09-10 07:46:44,470 WARN L188 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-09-10 07:46:45,377 WARN L188 SmtUtils]: Spent 840.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-09-10 07:46:45,895 WARN L188 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-09-10 07:46:47,216 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 07:46:47,433 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-10 07:46:48,047 WARN L188 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-09-10 07:46:48,825 WARN L188 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 82 [2019-09-10 07:46:50,205 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 07:46:50,548 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-10 07:46:50,933 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-09-10 07:46:51,271 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-10 07:46:51,475 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-09-10 07:46:52,197 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 07:46:53,253 WARN L188 SmtUtils]: Spent 933.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-10 07:46:54,445 WARN L188 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 102 DAG size of output: 82 [2019-09-10 07:46:54,775 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2019-09-10 07:46:55,065 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 07:46:55,550 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-09-10 07:46:56,311 WARN L188 SmtUtils]: Spent 618.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-09-10 07:46:57,388 WARN L188 SmtUtils]: Spent 962.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2019-09-10 07:46:58,515 WARN L188 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 99 DAG size of output: 80 [2019-09-10 07:46:59,262 WARN L188 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-10 07:46:59,493 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-09-10 07:47:00,255 WARN L188 SmtUtils]: Spent 687.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-09-10 07:47:00,968 WARN L188 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2019-09-10 07:47:02,300 WARN L188 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 98 DAG size of output: 82 [2019-09-10 07:47:03,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:03,685 INFO L93 Difference]: Finished difference Result 638886 states and 790522 transitions. [2019-09-10 07:47:03,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2019-09-10 07:47:03,686 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 112 [2019-09-10 07:47:03,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:04,538 INFO L225 Difference]: With dead ends: 638886 [2019-09-10 07:47:04,538 INFO L226 Difference]: Without dead ends: 638886 [2019-09-10 07:47:04,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 212 SyntacticMatches, 3 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20646 ImplicationChecksByTransitivity, 77.5s TimeCoverageRelationStatistics Valid=7710, Invalid=41352, Unknown=0, NotChecked=0, Total=49062 [2019-09-10 07:47:05,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638886 states. [2019-09-10 07:47:12,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638886 to 209762. [2019-09-10 07:47:12,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209762 states. [2019-09-10 07:47:12,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209762 states to 209762 states and 261784 transitions. [2019-09-10 07:47:12,960 INFO L78 Accepts]: Start accepts. Automaton has 209762 states and 261784 transitions. Word has length 112 [2019-09-10 07:47:12,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:12,960 INFO L475 AbstractCegarLoop]: Abstraction has 209762 states and 261784 transitions. [2019-09-10 07:47:12,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:47:12,960 INFO L276 IsEmpty]: Start isEmpty. Operand 209762 states and 261784 transitions. [2019-09-10 07:47:12,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 07:47:12,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:12,966 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:47:12,966 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:12,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:12,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1915955341, now seen corresponding path program 1 times [2019-09-10 07:47:12,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:12,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:12,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:12,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:12,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:12,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:14,149 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:47:14,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:47:14,149 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:47:14,149 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 114 with the following transitions: [2019-09-10 07:47:14,150 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [104], [107], [110], [113], [152], [155], [156], [158], [180], [184], [221], [224], [227], [230], [271], [275], [562], [626], [629], [632], [637], [659], [661], [665], [819], [822], [826], [829], [832], [836], [838], [841], [844], [847], [850], [861], [863], [866], [869], [872], [883], [885], [888], [891], [896], [899], [905], [907], [910], [915], [918], [922], [932], [937], [939], [942], [945], [953], [955], [958], [961], [969], [971], [974], [977], [985], [1017], [1018], [1022], [1023], [1024] [2019-09-10 07:47:14,152 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:47:14,152 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:47:14,183 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:47:14,450 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:47:14,450 INFO L272 AbstractInterpreter]: Visited 104 different actions 537 times. Merged at 41 different actions 386 times. Widened at 13 different actions 57 times. Performed 1980 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1980 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 44 fixpoints after 15 different actions. Largest state had 173 variables. [2019-09-10 07:47:14,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:14,451 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:47:14,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:47:14,451 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:47:14,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:14,465 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:47:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:14,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-10 07:47:14,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:47:15,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:16,025 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:47:16,025 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:47:16,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:16,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:17,270 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:47:17,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:47:17,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 19] total 53 [2019-09-10 07:47:17,274 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:47:17,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-10 07:47:17,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-10 07:47:17,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=2494, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 07:47:17,275 INFO L87 Difference]: Start difference. First operand 209762 states and 261784 transitions. Second operand 37 states. [2019-09-10 07:47:19,055 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-09-10 07:47:19,426 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-10 07:47:19,756 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-10 07:47:20,888 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 07:47:23,696 WARN L188 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 07:47:23,916 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-10 07:47:24,720 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-10 07:47:25,940 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 07:47:26,576 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-10 07:47:27,401 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:47:30,723 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42